/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:10:55,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:10:55,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:10:55,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:10:55,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:10:55,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:10:55,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:10:55,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:10:55,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:10:55,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:10:55,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:10:55,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:10:55,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:10:55,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:10:55,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:10:55,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:10:55,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:10:55,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:10:55,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:10:55,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:10:55,949 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:10:55,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:10:55,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:10:55,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:10:55,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:10:55,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:10:55,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:10:55,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:10:55,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:10:55,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:10:55,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:10:55,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:10:55,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:10:55,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:10:55,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:10:55,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:10:55,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:10:55,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:10:55,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:10:55,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:10:55,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:10:55,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:10:55,969 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:10:55,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:10:55,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:10:55,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:10:55,979 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:10:55,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:10:55,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:10:55,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:10:55,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:10:55,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:10:55,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:10:55,980 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:10:55,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:10:55,980 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:10:55,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:10:55,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:10:55,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:10:55,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:10:55,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:10:55,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:10:55,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:10:55,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:10:55,982 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:10:55,982 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:10:56,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:10:56,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:10:56,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:10:56,194 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:10:56,194 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:10:56,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2022-04-27 16:10:56,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb1fb3cf6/b7a4645dc29c4f72bcf7d3827c3eac60/FLAGfa005624d [2022-04-27 16:10:56,574 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:10:56,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2022-04-27 16:10:56,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb1fb3cf6/b7a4645dc29c4f72bcf7d3827c3eac60/FLAGfa005624d [2022-04-27 16:10:56,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb1fb3cf6/b7a4645dc29c4f72bcf7d3827c3eac60 [2022-04-27 16:10:56,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:10:56,588 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:10:56,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:10:56,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:10:56,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:10:56,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:10:56" (1/1) ... [2022-04-27 16:10:56,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c723865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:56, skipping insertion in model container [2022-04-27 16:10:56,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:10:56" (1/1) ... [2022-04-27 16:10:56,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:10:56,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:10:56,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c[322,335] [2022-04-27 16:10:56,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:10:56,784 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:10:56,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c[322,335] [2022-04-27 16:10:56,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:10:56,807 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:10:56,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:56 WrapperNode [2022-04-27 16:10:56,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:10:56,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:10:56,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:10:56,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:10:56,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:56" (1/1) ... [2022-04-27 16:10:56,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:56" (1/1) ... [2022-04-27 16:10:56,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:56" (1/1) ... [2022-04-27 16:10:56,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:56" (1/1) ... [2022-04-27 16:10:56,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:56" (1/1) ... [2022-04-27 16:10:56,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:56" (1/1) ... [2022-04-27 16:10:56,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:56" (1/1) ... [2022-04-27 16:10:56,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:10:56,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:10:56,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:10:56,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:10:56,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:56" (1/1) ... [2022-04-27 16:10:56,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:10:56,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:10:56,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:10:56,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:10:56,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:10:56,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:10:56,907 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:10:56,907 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:10:56,907 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:10:56,907 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:10:56,907 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:10:56,907 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:10:56,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:10:56,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:10:56,908 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:10:56,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:10:56,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:10:56,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:10:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:10:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:10:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:10:56,950 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:10:56,951 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:10:57,050 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:10:57,054 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:10:57,055 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 16:10:57,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:10:57 BoogieIcfgContainer [2022-04-27 16:10:57,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:10:57,056 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:10:57,056 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:10:57,072 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:10:57,074 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:10:57" (1/1) ... [2022-04-27 16:10:57,075 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:10:59,817 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:10:59,817 INFO L91 elerationTransformer]: Accelerated Formula: (and (< (mod v_main_~y~0_5 4294967296) 10) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] to Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] [2022-04-27 16:10:59,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:10:59 BasicIcfg [2022-04-27 16:10:59,829 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:10:59,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:10:59,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:10:59,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:10:59,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:10:56" (1/4) ... [2022-04-27 16:10:59,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bb4bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:10:59, skipping insertion in model container [2022-04-27 16:10:59,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:56" (2/4) ... [2022-04-27 16:10:59,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bb4bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:10:59, skipping insertion in model container [2022-04-27 16:10:59,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:10:57" (3/4) ... [2022-04-27 16:10:59,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bb4bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:10:59, skipping insertion in model container [2022-04-27 16:10:59,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:10:59" (4/4) ... [2022-04-27 16:10:59,837 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_1-1.cJordan [2022-04-27 16:10:59,846 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:10:59,846 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:10:59,878 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:10:59,887 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d189446, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48fc2751 [2022-04-27 16:10:59,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:10:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:10:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:10:59,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:10:59,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:10:59,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:10:59,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:10:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash -962721461, now seen corresponding path program 1 times [2022-04-27 16:10:59,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:10:59,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704336287] [2022-04-27 16:10:59,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:10:59,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:11:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:00,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:11:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:00,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-27 16:11:00,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 16:11:00,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 16:11:00,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [52] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:11:00,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-27 16:11:00,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 16:11:00,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 16:11:00,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [53] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 16:11:00,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [56] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_2 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {23#true} is VALID [2022-04-27 16:11:00,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [58] L16-2-->L16-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 16:11:00,061 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [61] L16-3-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_7 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {24#false} is VALID [2022-04-27 16:11:00,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} [66] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-27 16:11:00,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [68] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 16:11:00,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [70] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 16:11:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:11:00,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:11:00,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704336287] [2022-04-27 16:11:00,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704336287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:11:00,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:11:00,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:11:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764981923] [2022-04-27 16:11:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:11:00,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:11:00,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:11:00,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:00,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:11:00,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:11:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:11:00,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:11:00,102 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:00,140 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 16:11:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:11:00,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:11:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-04-27 16:11:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-04-27 16:11:00,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-04-27 16:11:00,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:00,178 INFO L225 Difference]: With dead ends: 20 [2022-04-27 16:11:00,179 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 16:11:00,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:11:00,182 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:00,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:11:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 16:11:00,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 16:11:00,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:00,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,203 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,203 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:00,207 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 16:11:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:11:00,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:00,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:00,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:11:00,209 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:11:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:00,212 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 16:11:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:11:00,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:00,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:00,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:00,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 16:11:00,214 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 16:11:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:00,215 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 16:11:00,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:11:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:11:00,216 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:11:00,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:11:00,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:11:00,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:11:00,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:11:00,224 INFO L85 PathProgramCache]: Analyzing trace with hash -961797940, now seen corresponding path program 1 times [2022-04-27 16:11:00,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:11:00,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848456191] [2022-04-27 16:11:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:11:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:00,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:11:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:00,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {93#true} is VALID [2022-04-27 16:11:00,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {93#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-27 16:11:00,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93#true} {93#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-27 16:11:00,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {93#true} [52] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:11:00,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {93#true} is VALID [2022-04-27 16:11:00,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {93#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-27 16:11:00,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93#true} {93#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-27 16:11:00,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {93#true} [53] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-27 16:11:00,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {93#true} [56] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_2 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {98#(= main_~x~0 0)} is VALID [2022-04-27 16:11:00,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {98#(= main_~x~0 0)} [59] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {94#false} is VALID [2022-04-27 16:11:00,285 INFO L272 TraceCheckUtils]: 7: Hoare triple {94#false} [61] L16-3-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_7 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {94#false} is VALID [2022-04-27 16:11:00,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {94#false} [66] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {94#false} is VALID [2022-04-27 16:11:00,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {94#false} [68] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {94#false} is VALID [2022-04-27 16:11:00,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {94#false} [70] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#false} is VALID [2022-04-27 16:11:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:11:00,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:11:00,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848456191] [2022-04-27 16:11:00,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848456191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:11:00,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:11:00,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:11:00,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296596540] [2022-04-27 16:11:00,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:11:00,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:11:00,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:11:00,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:00,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:11:00,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:11:00,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:11:00,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:11:00,296 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:00,342 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 16:11:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:11:00,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:11:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-27 16:11:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-27 16:11:00,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-04-27 16:11:00,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:00,373 INFO L225 Difference]: With dead ends: 17 [2022-04-27 16:11:00,373 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 16:11:00,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:11:00,374 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:00,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 20 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:11:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 16:11:00,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-04-27 16:11:00,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:00,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,376 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,377 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:00,377 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 16:11:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 16:11:00,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:00,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:00,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 16:11:00,378 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 16:11:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:00,379 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 16:11:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 16:11:00,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:00,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:00,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:00,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 16:11:00,380 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-27 16:11:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:00,380 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 16:11:00,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:11:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:11:00,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:11:00,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:11:00,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:11:00,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:11:00,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:11:00,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1952633576, now seen corresponding path program 1 times [2022-04-27 16:11:00,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:11:00,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771115475] [2022-04-27 16:11:00,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:00,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:11:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:00,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:11:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:00,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {170#true} is VALID [2022-04-27 16:11:00,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170#true} is VALID [2022-04-27 16:11:00,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170#true} {170#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170#true} is VALID [2022-04-27 16:11:00,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {170#true} [52] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:11:00,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {170#true} is VALID [2022-04-27 16:11:00,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170#true} is VALID [2022-04-27 16:11:00,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170#true} {170#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170#true} is VALID [2022-04-27 16:11:00,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {170#true} [53] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170#true} is VALID [2022-04-27 16:11:00,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {170#true} [56] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_2 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {170#true} is VALID [2022-04-27 16:11:00,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {170#true} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {175#(= main_~y~0 0)} is VALID [2022-04-27 16:11:00,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#(= main_~y~0 0)} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {171#false} is VALID [2022-04-27 16:11:00,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#false} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {171#false} is VALID [2022-04-27 16:11:00,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#false} [59] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {171#false} is VALID [2022-04-27 16:11:00,433 INFO L272 TraceCheckUtils]: 10: Hoare triple {171#false} [61] L16-3-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_7 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {171#false} is VALID [2022-04-27 16:11:00,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#false} [66] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {171#false} is VALID [2022-04-27 16:11:00,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {171#false} [68] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {171#false} is VALID [2022-04-27 16:11:00,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {171#false} [70] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#false} is VALID [2022-04-27 16:11:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:11:00,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:11:00,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771115475] [2022-04-27 16:11:00,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771115475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:11:00,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:11:00,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:11:00,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913014089] [2022-04-27 16:11:00,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:11:00,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 16:11:00,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:11:00,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:00,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:11:00,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:11:00,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:11:00,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:11:00,446 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:00,482 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 16:11:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:11:00,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 16:11:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 16:11:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 16:11:00,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-27 16:11:00,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:00,498 INFO L225 Difference]: With dead ends: 16 [2022-04-27 16:11:00,498 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 16:11:00,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:11:00,499 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:00,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 21 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:11:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 16:11:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 16:11:00,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:00,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,502 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,502 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:00,503 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 16:11:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 16:11:00,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:00,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:00,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 16:11:00,503 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 16:11:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:00,504 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 16:11:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 16:11:00,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:00,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:00,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:00,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 16:11:00,505 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-27 16:11:00,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:00,505 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 16:11:00,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 16:11:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:11:00,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:11:00,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:11:00,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 16:11:00,506 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:11:00,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:11:00,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1982267804, now seen corresponding path program 1 times [2022-04-27 16:11:00,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:11:00,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943959587] [2022-04-27 16:11:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:11:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:00,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:11:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:00,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {246#true} is VALID [2022-04-27 16:11:00,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,564 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {246#true} {246#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} [52] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:11:00,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {246#true} is VALID [2022-04-27 16:11:00,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} [53] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} [56] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_2 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {251#(= main_~x~0 0)} is VALID [2022-04-27 16:11:00,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {251#(= main_~x~0 0)} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {251#(= main_~x~0 0)} is VALID [2022-04-27 16:11:00,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {251#(= main_~x~0 0)} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {251#(= main_~x~0 0)} is VALID [2022-04-27 16:11:00,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {251#(= main_~x~0 0)} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {251#(= main_~x~0 0)} is VALID [2022-04-27 16:11:00,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {251#(= main_~x~0 0)} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {252#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:11:00,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [59] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {247#false} is VALID [2022-04-27 16:11:00,568 INFO L272 TraceCheckUtils]: 11: Hoare triple {247#false} [61] L16-3-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_7 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {247#false} is VALID [2022-04-27 16:11:00,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {247#false} [66] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {247#false} is VALID [2022-04-27 16:11:00,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {247#false} [68] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {247#false} is VALID [2022-04-27 16:11:00,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {247#false} [70] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#false} is VALID [2022-04-27 16:11:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:11:00,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:11:00,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943959587] [2022-04-27 16:11:00,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943959587] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:11:00,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029642132] [2022-04-27 16:11:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:00,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:11:00,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:11:00,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:11:00,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:11:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:00,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 16:11:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:00,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:11:00,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} [52] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {246#true} is VALID [2022-04-27 16:11:00,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} [53] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} [56] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_2 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {251#(= main_~x~0 0)} is VALID [2022-04-27 16:11:00,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {251#(= main_~x~0 0)} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {251#(= main_~x~0 0)} is VALID [2022-04-27 16:11:00,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {251#(= main_~x~0 0)} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {251#(= main_~x~0 0)} is VALID [2022-04-27 16:11:00,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {251#(= main_~x~0 0)} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {251#(= main_~x~0 0)} is VALID [2022-04-27 16:11:00,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {251#(= main_~x~0 0)} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {284#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 16:11:00,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {284#(= (+ (- 1) main_~x~0) 0)} [59] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {247#false} is VALID [2022-04-27 16:11:00,670 INFO L272 TraceCheckUtils]: 11: Hoare triple {247#false} [61] L16-3-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_7 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {247#false} is VALID [2022-04-27 16:11:00,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {247#false} [66] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {247#false} is VALID [2022-04-27 16:11:00,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {247#false} [68] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {247#false} is VALID [2022-04-27 16:11:00,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {247#false} [70] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#false} is VALID [2022-04-27 16:11:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:11:00,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:11:00,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {247#false} [70] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#false} is VALID [2022-04-27 16:11:00,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {247#false} [68] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {247#false} is VALID [2022-04-27 16:11:00,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {247#false} [66] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {247#false} is VALID [2022-04-27 16:11:00,732 INFO L272 TraceCheckUtils]: 11: Hoare triple {247#false} [61] L16-3-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_7 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {247#false} is VALID [2022-04-27 16:11:00,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {312#(< (mod main_~x~0 4294967296) 268435455)} [59] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {247#false} is VALID [2022-04-27 16:11:00,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {316#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {312#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 16:11:00,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {316#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {316#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-27 16:11:00,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {316#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-27 16:11:00,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {316#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {316#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-27 16:11:00,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} [56] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_2 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {316#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-27 16:11:00,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} [53] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {246#true} is VALID [2022-04-27 16:11:00,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} [52] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#true} is VALID [2022-04-27 16:11:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:11:00,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029642132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:11:00,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:11:00,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 16:11:00,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924318108] [2022-04-27 16:11:00,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:11:00,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:11:00,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:11:00,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:00,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 16:11:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:11:00,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 16:11:00,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:11:00,755 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:00,885 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 16:11:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:11:00,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:11:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-27 16:11:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-27 16:11:00,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-27 16:11:00,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:00,918 INFO L225 Difference]: With dead ends: 28 [2022-04-27 16:11:00,918 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 16:11:00,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-27 16:11:00,919 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:00,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 32 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:11:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 16:11:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 16:11:00,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:00,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,921 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,921 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:00,922 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 16:11:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-27 16:11:00,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:00,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:00,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-27 16:11:00,923 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-27 16:11:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:00,924 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 16:11:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-27 16:11:00,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:00,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:00,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:00,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-27 16:11:00,926 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2022-04-27 16:11:00,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:00,926 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-27 16:11:00,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:00,926 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-27 16:11:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 16:11:00,926 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:11:00,927 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:11:00,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:11:01,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:11:01,143 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:11:01,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:11:01,144 INFO L85 PathProgramCache]: Analyzing trace with hash 417615660, now seen corresponding path program 2 times [2022-04-27 16:11:01,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:11:01,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863760573] [2022-04-27 16:11:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:01,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:11:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:11:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:01,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {466#true} is VALID [2022-04-27 16:11:01,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} [52] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:11:01,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {466#true} is VALID [2022-04-27 16:11:01,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} [53] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} [56] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_2 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {471#(= main_~x~0 0)} is VALID [2022-04-27 16:11:01,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(= main_~x~0 0)} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {471#(= main_~x~0 0)} is VALID [2022-04-27 16:11:01,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= main_~x~0 0)} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {471#(= main_~x~0 0)} is VALID [2022-04-27 16:11:01,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#(= main_~x~0 0)} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {471#(= main_~x~0 0)} is VALID [2022-04-27 16:11:01,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#(= main_~x~0 0)} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:11:01,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:11:01,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:11:01,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:11:01,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:11:01,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:11:01,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:11:01,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:11:01,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:11:01,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:11:01,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:11:01,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:11:01,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {475#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:11:01,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {475#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [59] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {467#false} is VALID [2022-04-27 16:11:01,259 INFO L272 TraceCheckUtils]: 23: Hoare triple {467#false} [61] L16-3-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_7 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {467#false} is VALID [2022-04-27 16:11:01,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {467#false} [66] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {467#false} is VALID [2022-04-27 16:11:01,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {467#false} [68] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {467#false} is VALID [2022-04-27 16:11:01,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {467#false} [70] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {467#false} is VALID [2022-04-27 16:11:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 16:11:01,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:11:01,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863760573] [2022-04-27 16:11:01,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863760573] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:11:01,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531381270] [2022-04-27 16:11:01,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:11:01,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:11:01,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:11:01,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:11:01,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 16:11:01,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 16:11:01,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:11:01,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 16:11:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:01,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:11:01,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} [52] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {466#true} is VALID [2022-04-27 16:11:01,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} [53] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} [56] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_2 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {471#(= main_~x~0 0)} is VALID [2022-04-27 16:11:01,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(= main_~x~0 0)} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {471#(= main_~x~0 0)} is VALID [2022-04-27 16:11:01,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= main_~x~0 0)} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {471#(= main_~x~0 0)} is VALID [2022-04-27 16:11:01,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#(= main_~x~0 0)} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {471#(= main_~x~0 0)} is VALID [2022-04-27 16:11:01,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#(= main_~x~0 0)} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:11:01,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:11:01,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:11:01,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:11:01,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:11:01,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:11:01,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:11:01,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:11:01,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:11:01,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:11:01,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:11:01,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:11:01,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {543#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:11:01,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {543#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [59] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {467#false} is VALID [2022-04-27 16:11:01,576 INFO L272 TraceCheckUtils]: 23: Hoare triple {467#false} [61] L16-3-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_7 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {467#false} is VALID [2022-04-27 16:11:01,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {467#false} [66] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {467#false} is VALID [2022-04-27 16:11:01,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {467#false} [68] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {467#false} is VALID [2022-04-27 16:11:01,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {467#false} [70] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {467#false} is VALID [2022-04-27 16:11:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 16:11:01,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:11:01,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {467#false} [70] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {467#false} is VALID [2022-04-27 16:11:01,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {467#false} [68] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {467#false} is VALID [2022-04-27 16:11:01,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {467#false} [66] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {467#false} is VALID [2022-04-27 16:11:01,723 INFO L272 TraceCheckUtils]: 23: Hoare triple {467#false} [61] L16-3-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_7 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {467#false} is VALID [2022-04-27 16:11:01,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {571#(< (mod main_~x~0 4294967296) 268435455)} [59] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {467#false} is VALID [2022-04-27 16:11:01,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {575#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {571#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {575#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {575#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {575#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {575#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {588#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {575#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {588#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {588#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {588#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {588#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {601#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {588#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {601#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {601#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {601#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {601#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {601#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {614#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {614#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {614#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {614#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} [56] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_2 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {614#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 16:11:01,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} [53] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {466#true} is VALID [2022-04-27 16:11:01,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} [52] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-04-27 16:11:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 16:11:01,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531381270] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:11:01,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:11:01,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 16:11:01,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003533480] [2022-04-27 16:11:01,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:11:01,734 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 16:11:01,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:11:01,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:01,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:01,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 16:11:01,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:11:01,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 16:11:01,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-27 16:11:01,773 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:02,293 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2022-04-27 16:11:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 16:11:02,293 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 16:11:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-27 16:11:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-27 16:11:02,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-27 16:11:02,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:02,361 INFO L225 Difference]: With dead ends: 52 [2022-04-27 16:11:02,361 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 16:11:02,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-04-27 16:11:02,362 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 66 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:02,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 48 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:11:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 16:11:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 16:11:02,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:02,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:02,366 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:02,366 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:02,367 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2022-04-27 16:11:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-27 16:11:02,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:02,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:02,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-27 16:11:02,368 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-27 16:11:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:02,369 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2022-04-27 16:11:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-27 16:11:02,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:02,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:02,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:02,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-27 16:11:02,371 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 27 [2022-04-27 16:11:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:02,371 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-27 16:11:02,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-27 16:11:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 16:11:02,372 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:11:02,372 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:11:02,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 16:11:02,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:11:02,588 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:11:02,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:11:02,588 INFO L85 PathProgramCache]: Analyzing trace with hash -206820164, now seen corresponding path program 3 times [2022-04-27 16:11:02,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:11:02,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114296872] [2022-04-27 16:11:02,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:02,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:11:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:02,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:11:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:02,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {872#true} is VALID [2022-04-27 16:11:02,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:02,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {872#true} {872#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:02,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {872#true} [52] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:11:02,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {872#true} is VALID [2022-04-27 16:11:02,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {872#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:02,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {872#true} {872#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:02,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {872#true} [53] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:02,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#true} [56] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_2 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {877#(= main_~x~0 0)} is VALID [2022-04-27 16:11:02,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {877#(= main_~x~0 0)} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {877#(= main_~x~0 0)} is VALID [2022-04-27 16:11:02,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#(= main_~x~0 0)} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {877#(= main_~x~0 0)} is VALID [2022-04-27 16:11:02,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#(= main_~x~0 0)} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {877#(= main_~x~0 0)} is VALID [2022-04-27 16:11:02,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#(= main_~x~0 0)} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {878#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:11:02,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {878#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {878#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:11:02,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {878#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {878#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:11:02,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {878#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {878#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:11:02,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {878#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:11:02,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:11:02,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:11:02,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:11:02,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {880#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:11:02,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {880#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {880#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:11:02,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {880#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {880#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:11:02,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {880#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {880#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:11:02,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {880#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {881#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:11:02,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {881#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {881#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:11:02,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {881#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:11:02,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {881#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:11:02,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {881#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {882#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:11:02,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {882#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {882#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:11:02,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {882#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {882#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:11:02,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {882#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {882#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:11:02,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {882#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:11:02,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:11:02,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:11:02,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:11:02,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {884#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:11:02,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {884#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {884#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:11:02,839 INFO L290 TraceCheckUtils]: 35: Hoare triple {884#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {884#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:11:02,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {884#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {884#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:11:02,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {884#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {885#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:11:02,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {885#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {885#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:11:02,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {885#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {885#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:11:02,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {885#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {885#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:11:02,841 INFO L290 TraceCheckUtils]: 41: Hoare triple {885#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {886#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:11:02,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {886#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {886#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:11:02,842 INFO L290 TraceCheckUtils]: 43: Hoare triple {886#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {886#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:11:02,842 INFO L290 TraceCheckUtils]: 44: Hoare triple {886#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {886#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:11:02,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {886#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {887#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:11:02,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {887#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [59] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {873#false} is VALID [2022-04-27 16:11:02,843 INFO L272 TraceCheckUtils]: 47: Hoare triple {873#false} [61] L16-3-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_7 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {873#false} is VALID [2022-04-27 16:11:02,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {873#false} [66] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {873#false} is VALID [2022-04-27 16:11:02,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {873#false} [68] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {873#false} is VALID [2022-04-27 16:11:02,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {873#false} [70] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#false} is VALID [2022-04-27 16:11:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 16:11:02,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:11:02,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114296872] [2022-04-27 16:11:02,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114296872] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:11:02,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50426050] [2022-04-27 16:11:02,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 16:11:02,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:11:02,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:11:02,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:11:02,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 16:11:02,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 16:11:02,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:11:02,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 16:11:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:03,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:11:03,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {872#true} [52] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#true} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {872#true} is VALID [2022-04-27 16:11:03,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {872#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {872#true} {872#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {872#true} [53] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#true} [56] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_2 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {872#true} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#true} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {872#true} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#true} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {872#true} is VALID [2022-04-27 16:11:03,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {872#true} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {872#true} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {872#true} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {872#true} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {872#true} is VALID [2022-04-27 16:11:03,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {872#true} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {872#true} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {872#true} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {872#true} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {872#true} is VALID [2022-04-27 16:11:03,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {872#true} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {872#true} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {872#true} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {872#true} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {872#true} is VALID [2022-04-27 16:11:03,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {872#true} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {872#true} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {872#true} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {872#true} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {872#true} is VALID [2022-04-27 16:11:03,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {872#true} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {872#true} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {872#true} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {872#true} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {872#true} is VALID [2022-04-27 16:11:03,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {872#true} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {872#true} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {872#true} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {872#true} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {872#true} is VALID [2022-04-27 16:11:03,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {872#true} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {872#true} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {872#true} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {872#true} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {872#true} is VALID [2022-04-27 16:11:03,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {872#true} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,561 INFO L290 TraceCheckUtils]: 39: Hoare triple {872#true} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {872#true} is VALID [2022-04-27 16:11:03,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {872#true} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {872#true} is VALID [2022-04-27 16:11:03,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {872#true} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {872#true} is VALID [2022-04-27 16:11:03,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {872#true} [60] L16-2-->L19-2: Formula: (and (= v_main_~y~0_1 0) (< (mod v_main_~x~0_1 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~y~0] {1018#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 16:11:03,564 INFO L290 TraceCheckUtils]: 43: Hoare triple {1018#(< (mod main_~x~0 4294967296) 268435455)} [64] L19-2-->L19-2: Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 10 .cse0) (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (< v_main_~y~0_5 v_main_~y~0_4) (<= (div (+ (* (- 1) v_main_~y~0_4) 10) (- 4294967296)) (+ (div (+ v_main_~y~0_5 (- 4294967295)) 4294967296) 1)) (< .cse0 10)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1018#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 16:11:03,564 INFO L290 TraceCheckUtils]: 44: Hoare triple {1018#(< (mod main_~x~0 4294967296) 268435455)} [63] L19-2-->L19-3: Formula: (not (< (mod v_main_~y~0_3 4294967296) 10)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1018#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 16:11:03,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {1018#(< (mod main_~x~0 4294967296) 268435455)} [67] L19-3-->L16-2: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1028#(< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)} is VALID [2022-04-27 16:11:03,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {1028#(< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)} [59] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1032#(and (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455))} is VALID [2022-04-27 16:11:03,627 INFO L272 TraceCheckUtils]: 47: Hoare triple {1032#(and (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455))} [61] L16-3-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_7 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1036#(and (<= 0 |__VERIFIER_assert_#in~cond|) (< |__VERIFIER_assert_#in~cond| 2) (exists ((aux_div_v_main_~x~0_BEFORE_CALL_1_33 Int)) (and (< (mod (+ (* 2 aux_div_v_main_~x~0_BEFORE_CALL_1_33) |__VERIFIER_assert_#in~cond| 4294967295) 4294967296) 268435455) (not (< (mod (+ (* 2 aux_div_v_main_~x~0_BEFORE_CALL_1_33) |__VERIFIER_assert_#in~cond|) 4294967296) 268435455)))))} is VALID [2022-04-27 16:11:03,628 INFO L290 TraceCheckUtils]: 48: Hoare triple {1036#(and (<= 0 |__VERIFIER_assert_#in~cond|) (< |__VERIFIER_assert_#in~cond| 2) (exists ((aux_div_v_main_~x~0_BEFORE_CALL_1_33 Int)) (and (< (mod (+ (* 2 aux_div_v_main_~x~0_BEFORE_CALL_1_33) |__VERIFIER_assert_#in~cond| 4294967295) 4294967296) 268435455) (not (< (mod (+ (* 2 aux_div_v_main_~x~0_BEFORE_CALL_1_33) |__VERIFIER_assert_#in~cond|) 4294967296) 268435455)))))} [66] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1040#(and (<= 0 __VERIFIER_assert_~cond) (exists ((aux_div_v_main_~x~0_BEFORE_CALL_1_33 Int)) (and (< (mod (+ (* 2 aux_div_v_main_~x~0_BEFORE_CALL_1_33) 4294967295 __VERIFIER_assert_~cond) 4294967296) 268435455) (not (< (mod (+ (* 2 aux_div_v_main_~x~0_BEFORE_CALL_1_33) __VERIFIER_assert_~cond) 4294967296) 268435455)))) (< __VERIFIER_assert_~cond 2))} is VALID [2022-04-27 16:11:03,629 INFO L290 TraceCheckUtils]: 49: Hoare triple {1040#(and (<= 0 __VERIFIER_assert_~cond) (exists ((aux_div_v_main_~x~0_BEFORE_CALL_1_33 Int)) (and (< (mod (+ (* 2 aux_div_v_main_~x~0_BEFORE_CALL_1_33) 4294967295 __VERIFIER_assert_~cond) 4294967296) 268435455) (not (< (mod (+ (* 2 aux_div_v_main_~x~0_BEFORE_CALL_1_33) __VERIFIER_assert_~cond) 4294967296) 268435455)))) (< __VERIFIER_assert_~cond 2))} [68] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {873#false} is VALID [2022-04-27 16:11:03,629 INFO L290 TraceCheckUtils]: 50: Hoare triple {873#false} [70] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#false} is VALID [2022-04-27 16:11:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-04-27 16:11:03,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:11:03,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50426050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:11:03,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 16:11:03,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2022-04-27 16:11:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885742340] [2022-04-27 16:11:03,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:11:03,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-27 16:11:03,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:11:03,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:03,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:03,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:11:03,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:11:03,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:11:03,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-04-27 16:11:03,654 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:03,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:03,733 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-27 16:11:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:11:03,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-27 16:11:03,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2022-04-27 16:11:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2022-04-27 16:11:03,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 18 transitions. [2022-04-27 16:11:03,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:03,756 INFO L225 Difference]: With dead ends: 50 [2022-04-27 16:11:03,756 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:11:03,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-27 16:11:03,757 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:03,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-04-27 16:11:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:11:03,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:11:03,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:03,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:11:03,757 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:11:03,758 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:11:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:03,758 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:11:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:11:03,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:03,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:03,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:11:03,758 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:11:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:03,758 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:11:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:11:03,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:03,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:03,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:03,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:11:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:11:03,759 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2022-04-27 16:11:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:03,759 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:11:03,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:11:03,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:03,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:11:03,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 16:11:03,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:11:03,973 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-04-27 16:11:03,974 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:11:03,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:11:03 BasicIcfg [2022-04-27 16:11:03,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:11:03,977 INFO L158 Benchmark]: Toolchain (without parser) took 7388.75ms. Allocated memory was 209.7MB in the beginning and 280.0MB in the end (delta: 70.3MB). Free memory was 160.6MB in the beginning and 243.0MB in the end (delta: -82.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:11:03,977 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 209.7MB. Free memory was 176.7MB in the beginning and 176.6MB in the end (delta: 80.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:11:03,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.34ms. Allocated memory is still 209.7MB. Free memory was 160.5MB in the beginning and 185.8MB in the end (delta: -25.3MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2022-04-27 16:11:03,977 INFO L158 Benchmark]: Boogie Preprocessor took 25.30ms. Allocated memory is still 209.7MB. Free memory was 185.8MB in the beginning and 184.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:11:03,977 INFO L158 Benchmark]: RCFGBuilder took 222.31ms. Allocated memory is still 209.7MB. Free memory was 184.2MB in the beginning and 174.0MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 16:11:03,977 INFO L158 Benchmark]: IcfgTransformer took 2772.27ms. Allocated memory is still 209.7MB. Free memory was 173.7MB in the beginning and 147.0MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-04-27 16:11:03,978 INFO L158 Benchmark]: TraceAbstraction took 4145.62ms. Allocated memory was 209.7MB in the beginning and 280.0MB in the end (delta: 70.3MB). Free memory was 146.5MB in the beginning and 243.5MB in the end (delta: -97.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:11:03,978 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 209.7MB. Free memory was 176.7MB in the beginning and 176.6MB in the end (delta: 80.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.34ms. Allocated memory is still 209.7MB. Free memory was 160.5MB in the beginning and 185.8MB in the end (delta: -25.3MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.30ms. Allocated memory is still 209.7MB. Free memory was 185.8MB in the beginning and 184.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 222.31ms. Allocated memory is still 209.7MB. Free memory was 184.2MB in the beginning and 174.0MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 2772.27ms. Allocated memory is still 209.7MB. Free memory was 173.7MB in the beginning and 147.0MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 4145.62ms. Allocated memory was 209.7MB in the beginning and 280.0MB in the end (delta: 70.3MB). Free memory was 146.5MB in the beginning and 243.5MB in the end (delta: -97.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 218 IncrementalHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 94 mSDtfsCounter, 218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 222 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 253 ConstructedInterpolants, 2 QuantifiedInterpolants, 951 SizeOfPredicates, 4 NumberOfNonLiveVariables, 208 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 316/719 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:11:03,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...