/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/loops-crafted-1/in-de42.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:39:37,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:39:37,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:39:38,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:39:38,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:39:38,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:39:38,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:39:38,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:39:38,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:39:38,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:39:38,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:39:38,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:39:38,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:39:38,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:39:38,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:39:38,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:39:38,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:39:38,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:39:38,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:39:38,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:39:38,039 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:39:38,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:39:38,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:39:38,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:39:38,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:39:38,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:39:38,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:39:38,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:39:38,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:39:38,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:39:38,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:39:38,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:39:38,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:39:38,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:39:38,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:39:38,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:39:38,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:39:38,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:39:38,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:39:38,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:39:38,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:39:38,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:39:38,068 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:39:38,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:39:38,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:39:38,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:39:38,080 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:39:38,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:39:38,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:39:38,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:39:38,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:39:38,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:39:38,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:39:38,082 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:39:38,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:39:38,082 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:39:38,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:39:38,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:39:38,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:39:38,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:39:38,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:39:38,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:39:38,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:39:38,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:39:38,083 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:39:38,084 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:39:38,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:39:38,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:39:38,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:39:38,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:39:38,337 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:39:38,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-04-27 16:39:38,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c129fc2/9b5f74238b0e4a0f981232066364d766/FLAG2e90b82a8 [2022-04-27 16:39:38,768 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:39:38,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-04-27 16:39:38,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c129fc2/9b5f74238b0e4a0f981232066364d766/FLAG2e90b82a8 [2022-04-27 16:39:39,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c129fc2/9b5f74238b0e4a0f981232066364d766 [2022-04-27 16:39:39,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:39:39,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:39:39,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:39:39,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:39:39,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:39:39,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:39:39" (1/1) ... [2022-04-27 16:39:39,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6879ac6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:39:39, skipping insertion in model container [2022-04-27 16:39:39,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:39:39" (1/1) ... [2022-04-27 16:39:39,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:39:39,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:39:39,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c[368,381] [2022-04-27 16:39:39,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:39:39,358 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:39:39,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c[368,381] [2022-04-27 16:39:39,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:39:39,393 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:39:39,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:39:39 WrapperNode [2022-04-27 16:39:39,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:39:39,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:39:39,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:39:39,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:39:39,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:39:39" (1/1) ... [2022-04-27 16:39:39,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:39:39" (1/1) ... [2022-04-27 16:39:39,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:39:39" (1/1) ... [2022-04-27 16:39:39,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:39:39" (1/1) ... [2022-04-27 16:39:39,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:39:39" (1/1) ... [2022-04-27 16:39:39,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:39:39" (1/1) ... [2022-04-27 16:39:39,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:39:39" (1/1) ... [2022-04-27 16:39:39,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:39:39,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:39:39,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:39:39,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:39:39,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:39:39" (1/1) ... [2022-04-27 16:39:39,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:39:39,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:39:39,505 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:39:39,527 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:39:39,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:39:39,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:39:39,541 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:39:39,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:39:39,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:39:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:39:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:39:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:39:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:39:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 16:39:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:39:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:39:39,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:39:39,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:39:39,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:39:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:39:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:39:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:39:39,605 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:39:39,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:39:39,795 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:39:39,800 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:39:39,800 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-27 16:39:39,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:39:39 BoogieIcfgContainer [2022-04-27 16:39:39,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:39:39,802 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:39:39,802 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:39:39,803 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:39:39,806 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:39:39" (1/1) ... [2022-04-27 16:39:39,807 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:39:40,392 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-27 16:39:40,392 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] to Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_6 v_main_~y~0_5)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_6 v_it_1 1) v_main_~y~0_5)))) (< v_main_~y~0_6 v_main_~y~0_5) (< 0 .cse0) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_6 (* (- 1) v_main_~y~0_5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] [2022-04-27 16:39:40,732 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-27 16:39:40,732 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_10 (+ v_main_~z~0_9 1)) (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_10 4294967296))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_9, main_#t~post8=|v_main_#t~post8_1|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] to Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (= v_main_~z~0_9 (+ (* (- 1) v_main_~x~0_8) v_main_~z~0_10 v_main_~x~0_9)) (< v_main_~x~0_9 v_main_~x~0_8) (< 0 .cse0) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~x~0_9 v_it_2 1) v_main_~x~0_8)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_2 4294967295)) 4294967296))))))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_9, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] [2022-04-27 16:39:41,060 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-27 16:39:41,061 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_4 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_3, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] to Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] [2022-04-27 16:39:41,317 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-27 16:39:41,317 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_4 (+ v_main_~z~0_5 1)) (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_4, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post11, main_#t~post12] to Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= v_main_~x~0_7 v_main_~x~0_6)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= v_main_~z~0_4 (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~z~0_5))))) InVars {main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post11, main_#t~post12] [2022-04-27 16:39:41,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:39:41 BasicIcfg [2022-04-27 16:39:41,321 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:39:41,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:39:41,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:39:41,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:39:41,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:39:39" (1/4) ... [2022-04-27 16:39:41,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3cf704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:39:41, skipping insertion in model container [2022-04-27 16:39:41,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:39:39" (2/4) ... [2022-04-27 16:39:41,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3cf704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:39:41, skipping insertion in model container [2022-04-27 16:39:41,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:39:39" (3/4) ... [2022-04-27 16:39:41,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3cf704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:39:41, skipping insertion in model container [2022-04-27 16:39:41,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:39:41" (4/4) ... [2022-04-27 16:39:41,328 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de42.cJordan [2022-04-27 16:39:41,339 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:39:41,340 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:39:41,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:39:41,375 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@37497c7b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b16cb0d [2022-04-27 16:39:41,375 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:39:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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:39:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:39:41,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:39:41,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:39:41,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:39:41,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:39:41,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2015447748, now seen corresponding path program 1 times [2022-04-27 16:39:41,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:39:41,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145026433] [2022-04-27 16:39:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:39:41,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:39:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:39:41,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:39:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:39:41,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {26#true} is VALID [2022-04-27 16:39:41,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:39:41,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:39:41,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:39:41,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {26#true} is VALID [2022-04-27 16:39:41,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:39:41,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:39:41,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:39:41,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {26#true} is VALID [2022-04-27 16:39:41,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [81] L16-2-->L16-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 16:39:41,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {27#false} is VALID [2022-04-27 16:39:41,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} [85] L23-2-->L29-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 16:39:41,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [88] L29-1-->L35-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 16:39:41,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} [91] L35-1-->L35-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 16:39:41,542 INFO L272 TraceCheckUtils]: 11: Hoare triple {27#false} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {27#false} is VALID [2022-04-27 16:39:41,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {27#false} is VALID [2022-04-27 16:39:41,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 16:39:41,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 16:39:41,543 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:39:41,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:39:41,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145026433] [2022-04-27 16:39:41,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145026433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:39:41,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:39:41,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:39:41,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302345849] [2022-04-27 16:39:41,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:39:41,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2022-04-27 16:39:41,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:39:41,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:39:41,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:39:41,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:39:41,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:39:41,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:39:41,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:39:41,606 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:39:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:39:41,656 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-27 16:39:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:39:41,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2022-04-27 16:39:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:39:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:39:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-04-27 16:39:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:39:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-04-27 16:39:41,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2022-04-27 16:39:41,699 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:39:41,705 INFO L225 Difference]: With dead ends: 23 [2022-04-27 16:39:41,705 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 16:39:41,706 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:39:41,709 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 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:39:41,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:39:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 16:39:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 16:39:41,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:39:41,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:39:41,731 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:39:41,732 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:39:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:39:41,734 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-27 16:39:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-27 16:39:41,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:39:41,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:39:41,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:39:41,735 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:39:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:39:41,737 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-27 16:39:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-27 16:39:41,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:39:41,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:39:41,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:39:41,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:39:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:39:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-04-27 16:39:41,740 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-04-27 16:39:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:39:41,741 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-04-27 16:39:41,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:39:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-27 16:39:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:39:41,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:39:41,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:39:41,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:39:41,742 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:39:41,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:39:41,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1389121438, now seen corresponding path program 1 times [2022-04-27 16:39:41,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:39:41,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135463030] [2022-04-27 16:39:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:39:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:39:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:39:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:39:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:39:42,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {105#true} is VALID [2022-04-27 16:39:42,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-04-27 16:39:42,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105#true} {105#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-04-27 16:39:42,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {105#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:39:42,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {105#true} is VALID [2022-04-27 16:39:42,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {105#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-04-27 16:39:42,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105#true} {105#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-04-27 16:39:42,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {105#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-04-27 16:39:42,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {110#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 16:39:42,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {110#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {111#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 16:39:42,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {111#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {112#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} is VALID [2022-04-27 16:39:42,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {112#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {113#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:39:42,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {113#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {113#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:39:42,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {113#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {114#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:39:42,019 INFO L272 TraceCheckUtils]: 11: Hoare triple {114#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {115#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:39:42,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {115#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {116#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:39:42,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {116#(not (= __VERIFIER_assert_~cond 0))} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {106#false} is VALID [2022-04-27 16:39:42,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {106#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#false} is VALID [2022-04-27 16:39:42,021 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:39:42,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:39:42,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135463030] [2022-04-27 16:39:42,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135463030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:39:42,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:39:42,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-27 16:39:42,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268530343] [2022-04-27 16:39:42,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:39:42,026 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-27 16:39:42,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:39:42,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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:39:42,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:39:42,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 16:39:42,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:39:42,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 16:39:42,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 16:39:42,047 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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:39:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:39:42,449 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-27 16:39:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:39:42,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-27 16:39:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:39:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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:39:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-27 16:39:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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:39:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-27 16:39:42,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-27 16:39:42,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:39:42,502 INFO L225 Difference]: With dead ends: 27 [2022-04-27 16:39:42,502 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 16:39:42,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-27 16:39:42,503 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:39:42,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 57 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 4 Unchecked, 0.1s Time] [2022-04-27 16:39:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 16:39:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-04-27 16:39:42,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:39:42,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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:39:42,507 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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:39:42,509 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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:39:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:39:42,512 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2022-04-27 16:39:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-04-27 16:39:42,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:39:42,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:39:42,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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 24 states. [2022-04-27 16:39:42,514 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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 24 states. [2022-04-27 16:39:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:39:42,524 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2022-04-27 16:39:42,524 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-04-27 16:39:42,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:39:42,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:39:42,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:39:42,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:39:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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:39:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-27 16:39:42,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 15 [2022-04-27 16:39:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:39:42,526 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-27 16:39:42,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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:39:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-27 16:39:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:39:42,527 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:39:42,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:39:42,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:39:42,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:39:42,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:39:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash 139812261, now seen corresponding path program 1 times [2022-04-27 16:39:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:39:42,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57643034] [2022-04-27 16:39:42,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:39:42,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:39:42,547 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-27 16:39:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:39:42,592 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-27 16:39:42,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:39:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:39:42,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {226#true} is VALID [2022-04-27 16:39:42,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 16:39:42,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {226#true} {226#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 16:39:42,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:39:42,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {226#true} is VALID [2022-04-27 16:39:42,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 16:39:42,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 16:39:42,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 16:39:42,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {231#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:39:42,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {232#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:39:42,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {233#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 16:39:42,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {233#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {233#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 16:39:42,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {233#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {233#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 16:39:42,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {233#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [93] L35-1-->L35-1: Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= v_main_~x~0_7 v_main_~x~0_6)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= v_main_~z~0_4 (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~z~0_5))))) InVars {main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post11, main_#t~post12] {234#(and (= main_~z~0 0) (<= (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-27 16:39:42,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#(and (= main_~z~0 0) (<= (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0)))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {234#(and (= main_~z~0 0) (<= (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-27 16:39:42,775 INFO L272 TraceCheckUtils]: 12: Hoare triple {234#(and (= main_~z~0 0) (<= (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0)))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {235#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:39:42,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {236#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:39:42,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {236#(not (= __VERIFIER_assert_~cond 0))} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 16:39:42,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {227#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 16:39:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:39:42,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:39:42,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57643034] [2022-04-27 16:39:42,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57643034] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:39:42,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746289494] [2022-04-27 16:39:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:39:42,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:39:42,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:39:42,780 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:39:42,783 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:39:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:39:42,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 16:39:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:39:42,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:39:43,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 16:39:43,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} [77] 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) 10) (= (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] {226#true} is VALID [2022-04-27 16:39:43,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 16:39:43,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 16:39:43,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 16:39:43,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {256#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 16:39:43,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(= main_~n~0 main_~x~0)} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {260#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 16:39:43,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {260#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~x~0 4294967296))))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {260#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 16:39:43,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~x~0 4294967296))))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {267#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 16:39:43,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {267#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 16:39:43,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} [93] L35-1-->L35-1: Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= v_main_~x~0_7 v_main_~x~0_6)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= v_main_~z~0_4 (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~z~0_5))))) InVars {main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post11, main_#t~post12] {267#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 16:39:43,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {267#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {277#(and (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-27 16:39:43,631 INFO L272 TraceCheckUtils]: 12: Hoare triple {277#(and (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {281#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:39:43,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {281#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {285#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:39:43,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {285#(<= 1 __VERIFIER_assert_~cond)} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 16:39:43,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {227#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 16:39:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:39:43,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:39:43,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746289494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:39:43,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 16:39:43,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-04-27 16:39:43,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650948713] [2022-04-27 16:39:43,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:39:43,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 16 [2022-04-27 16:39:43,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:39:43,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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:39:43,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:39:43,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 16:39:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:39:43,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 16:39:43,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-27 16:39:43,668 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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:39:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:39:43,833 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-27 16:39:43,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:39:43,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 16 [2022-04-27 16:39:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:39:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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:39:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-27 16:39:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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:39:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-27 16:39:43,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-27 16:39:43,870 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:39:43,871 INFO L225 Difference]: With dead ends: 25 [2022-04-27 16:39:43,871 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 16:39:43,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-27 16:39:43,873 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:39:43,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-04-27 16:39:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 16:39:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 16:39:43,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:39:43,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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:39:43,876 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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:39:43,876 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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:39:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:39:43,877 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-27 16:39:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-27 16:39:43,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:39:43,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:39:43,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 20 states. [2022-04-27 16:39:43,878 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 20 states. [2022-04-27 16:39:43,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:39:43,880 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-27 16:39:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-27 16:39:43,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:39:43,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:39:43,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:39:43,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:39:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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:39:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-27 16:39:43,882 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 16 [2022-04-27 16:39:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:39:43,882 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-27 16:39:43,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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:39:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-27 16:39:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:39:43,883 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:39:43,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:39:43,910 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:39:44,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:39:44,100 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:39:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:39:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash 912799338, now seen corresponding path program 1 times [2022-04-27 16:39:44,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:39:44,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671308924] [2022-04-27 16:39:44,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:39:44,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:39:44,119 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:39:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:39:44,162 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:39:44,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:39:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:39:44,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {390#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {378#true} is VALID [2022-04-27 16:39:44,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:44,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {378#true} {378#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:44,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {378#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:39:44,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {378#true} is VALID [2022-04-27 16:39:44,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:44,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378#true} {378#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:44,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {378#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:44,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {383#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:39:44,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {383#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {384#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:39:44,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {385#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:39:44,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {385#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {385#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:39:44,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {385#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {386#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:39:44,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {386#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {386#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:39:44,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {387#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:39:44,413 INFO L272 TraceCheckUtils]: 12: Hoare triple {387#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {388#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:39:44,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {388#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {389#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:39:44,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {389#(not (= __VERIFIER_assert_~cond 0))} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {379#false} is VALID [2022-04-27 16:39:44,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {379#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#false} is VALID [2022-04-27 16:39:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:39:44,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:39:44,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671308924] [2022-04-27 16:39:44,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671308924] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:39:44,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086136056] [2022-04-27 16:39:44,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:39:44,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:39:44,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:39:44,431 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:39:44,459 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:39:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:39:44,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 16:39:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:39:44,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:39:44,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {378#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:44,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} [77] 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) 10) (= (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] {378#true} is VALID [2022-04-27 16:39:44,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:44,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378#true} {378#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:44,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {378#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:44,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {383#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:39:44,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {383#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {412#(and (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:39:44,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {412#(and (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {416#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:39:44,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {416#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {416#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:39:44,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {416#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {423#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 16:39:44,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {423#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 16:39:44,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {423#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {423#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 16:39:44,826 INFO L272 TraceCheckUtils]: 12: Hoare triple {423#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:39:44,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:39:44,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {437#(<= 1 __VERIFIER_assert_~cond)} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {379#false} is VALID [2022-04-27 16:39:44,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {379#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#false} is VALID [2022-04-27 16:39:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:39:44,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:39:54,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {379#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#false} is VALID [2022-04-27 16:39:54,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {437#(<= 1 __VERIFIER_assert_~cond)} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {379#false} is VALID [2022-04-27 16:39:54,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:39:54,411 INFO L272 TraceCheckUtils]: 12: Hoare triple {453#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:39:54,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {453#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {453#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} is VALID [2022-04-27 16:39:54,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {453#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {453#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} is VALID [2022-04-27 16:39:54,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {463#(forall ((aux_mod_v_main_~z~0_23_31 Int) (aux_div_v_main_~z~0_23_31 Int)) (or (> 0 aux_mod_v_main_~z~0_23_31) (and (or (not (= (+ aux_mod_v_main_~z~0_23_31 (* 4294967296 aux_div_v_main_~z~0_23_31)) main_~z~0)) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 main_~z~0 1) (+ aux_mod_v_main_~z~0_23_31 (* 4294967296 aux_div_v_main_~z~0_23_31))) (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< main_~z~0 (+ aux_mod_v_main_~z~0_23_31 (* 4294967296 aux_div_v_main_~z~0_23_31)))))) (>= aux_mod_v_main_~z~0_23_31 4294967296) (= aux_mod_v_main_~z~0_23_31 (mod (* main_~n~0 2) 4294967296))))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {453#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} is VALID [2022-04-27 16:39:56,510 WARN L290 TraceCheckUtils]: 8: Hoare triple {467#(or (< 0 (mod main_~z~0 4294967296)) (forall ((aux_mod_v_main_~z~0_23_31 Int) (aux_div_v_main_~z~0_23_31 Int)) (or (> 0 aux_mod_v_main_~z~0_23_31) (and (or (not (= (+ aux_mod_v_main_~z~0_23_31 (* 4294967296 aux_div_v_main_~z~0_23_31)) main_~z~0)) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 main_~z~0 1) (+ aux_mod_v_main_~z~0_23_31 (* 4294967296 aux_div_v_main_~z~0_23_31))) (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< main_~z~0 (+ aux_mod_v_main_~z~0_23_31 (* 4294967296 aux_div_v_main_~z~0_23_31)))))) (>= aux_mod_v_main_~z~0_23_31 4294967296) (= aux_mod_v_main_~z~0_23_31 (mod (* main_~n~0 2) 4294967296)))))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {463#(forall ((aux_mod_v_main_~z~0_23_31 Int) (aux_div_v_main_~z~0_23_31 Int)) (or (> 0 aux_mod_v_main_~z~0_23_31) (and (or (not (= (+ aux_mod_v_main_~z~0_23_31 (* 4294967296 aux_div_v_main_~z~0_23_31)) main_~z~0)) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 main_~z~0 1) (+ aux_mod_v_main_~z~0_23_31 (* 4294967296 aux_div_v_main_~z~0_23_31))) (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< main_~z~0 (+ aux_mod_v_main_~z~0_23_31 (* 4294967296 aux_div_v_main_~z~0_23_31)))))) (>= aux_mod_v_main_~z~0_23_31 4294967296) (= aux_mod_v_main_~z~0_23_31 (mod (* main_~n~0 2) 4294967296))))} is UNKNOWN [2022-04-27 16:39:56,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(or (<= (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 1) (mod (* main_~n~0 2) 4294967296) (* (- 1) main_~y~0)) (- 4294967296))) (< 0 (mod main_~y~0 4294967296)))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {467#(or (< 0 (mod main_~z~0 4294967296)) (forall ((aux_mod_v_main_~z~0_23_31 Int) (aux_div_v_main_~z~0_23_31 Int)) (or (> 0 aux_mod_v_main_~z~0_23_31) (and (or (not (= (+ aux_mod_v_main_~z~0_23_31 (* 4294967296 aux_div_v_main_~z~0_23_31)) main_~z~0)) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 main_~z~0 1) (+ aux_mod_v_main_~z~0_23_31 (* 4294967296 aux_div_v_main_~z~0_23_31))) (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< main_~z~0 (+ aux_mod_v_main_~z~0_23_31 (* 4294967296 aux_div_v_main_~z~0_23_31)))))) (>= aux_mod_v_main_~z~0_23_31 4294967296) (= aux_mod_v_main_~z~0_23_31 (mod (* main_~n~0 2) 4294967296)))))} is VALID [2022-04-27 16:39:56,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#(or (<= (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 1) (mod (* main_~n~0 2) 4294967296) (* (- 1) main_~y~0)) (- 4294967296))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod main_~y~0 4294967296)))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {471#(or (<= (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 1) (mod (* main_~n~0 2) 4294967296) (* (- 1) main_~y~0)) (- 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 16:39:56,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {475#(or (<= (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 1) (mod (* main_~n~0 2) 4294967296) (* (- 1) main_~y~0)) (- 4294967296))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 16:39:56,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {378#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:56,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378#true} {378#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:56,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:56,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} [77] 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) 10) (= (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] {378#true} is VALID [2022-04-27 16:39:56,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {378#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#true} is VALID [2022-04-27 16:39:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:39:56,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086136056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:39:56,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:39:56,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 20 [2022-04-27 16:39:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737438358] [2022-04-27 16:39:56,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:39:56,525 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 16:39:56,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:39:56,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:39:58,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 16:39:58,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 16:39:58,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:39:58,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 16:39:58,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=298, Unknown=4, NotChecked=0, Total=380 [2022-04-27 16:39:58,726 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:40:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:40:01,529 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-27 16:40:01,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 16:40:01,529 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 16:40:01,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:40:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:40:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2022-04-27 16:40:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:40:01,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2022-04-27 16:40:01,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 38 transitions. [2022-04-27 16:40:01,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:40:01,569 INFO L225 Difference]: With dead ends: 28 [2022-04-27 16:40:01,569 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 16:40:01,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=145, Invalid=552, Unknown=5, NotChecked=0, Total=702 [2022-04-27 16:40:01,570 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:40:01,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 71 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-04-27 16:40:01,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 16:40:01,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-27 16:40:01,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:40:01,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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:40:01,573 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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:40:01,574 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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:40:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:40:01,575 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2022-04-27 16:40:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-04-27 16:40:01,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:40:01,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:40:01,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 25 states. [2022-04-27 16:40:01,576 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 25 states. [2022-04-27 16:40:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:40:01,577 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2022-04-27 16:40:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-04-27 16:40:01,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:40:01,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:40:01,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:40:01,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:40:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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:40:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-27 16:40:01,579 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 16 [2022-04-27 16:40:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:40:01,579 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-27 16:40:01,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:40:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-27 16:40:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:40:01,580 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:40:01,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:40:01,600 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:40:01,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 16:40:01,792 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:40:01,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:40:01,792 INFO L85 PathProgramCache]: Analyzing trace with hash -894405051, now seen corresponding path program 1 times [2022-04-27 16:40:01,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:40:01,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793891632] [2022-04-27 16:40:01,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:40:01,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:40:01,810 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-27 16:40:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:40:01,827 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-27 16:40:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:40:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:40:01,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {611#true} is VALID [2022-04-27 16:40:01,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {611#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {611#true} is VALID [2022-04-27 16:40:01,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {611#true} {611#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {611#true} is VALID [2022-04-27 16:40:01,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {611#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:40:01,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {611#true} is VALID [2022-04-27 16:40:01,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {611#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {611#true} is VALID [2022-04-27 16:40:01,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {611#true} {611#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {611#true} is VALID [2022-04-27 16:40:01,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {611#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {611#true} is VALID [2022-04-27 16:40:01,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {611#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {616#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:40:01,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {616#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {617#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:40:01,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {617#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {618#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 16:40:02,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {618#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [87] L23-2-->L23-2: Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (= v_main_~z~0_9 (+ (* (- 1) v_main_~x~0_8) v_main_~z~0_10 v_main_~x~0_9)) (< v_main_~x~0_9 v_main_~x~0_8) (< 0 .cse0) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~x~0_9 v_it_2 1) v_main_~x~0_8)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_2 4294967295)) 4294967296))))))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_9, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {619#(or (and (= main_~z~0 0) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1))) (not (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-27 16:40:02,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {619#(or (and (= main_~z~0 0) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1))) (not (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {620#(and (= main_~z~0 0) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} is VALID [2022-04-27 16:40:02,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {620#(and (= main_~z~0 0) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {620#(and (= main_~z~0 0) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} is VALID [2022-04-27 16:40:02,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {620#(and (= main_~z~0 0) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {620#(and (= main_~z~0 0) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} is VALID [2022-04-27 16:40:02,027 INFO L272 TraceCheckUtils]: 12: Hoare triple {620#(and (= main_~z~0 0) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {621#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:40:02,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {622#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:40:02,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {622#(not (= __VERIFIER_assert_~cond 0))} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {612#false} is VALID [2022-04-27 16:40:02,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {612#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {612#false} is VALID [2022-04-27 16:40:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:40:02,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:40:02,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793891632] [2022-04-27 16:40:02,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793891632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:40:02,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422445084] [2022-04-27 16:40:02,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:40:02,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:40:02,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:40:02,032 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:40:02,035 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:40:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:40:02,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 16:40:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:40:02,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:40:02,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {611#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {611#true} is VALID [2022-04-27 16:40:02,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {611#true} [77] 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) 10) (= (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] {611#true} is VALID [2022-04-27 16:40:02,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {611#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {611#true} is VALID [2022-04-27 16:40:02,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {611#true} {611#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {611#true} is VALID [2022-04-27 16:40:02,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {611#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {611#true} is VALID [2022-04-27 16:40:02,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {611#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {642#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 16:40:02,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {642#(= main_~n~0 main_~x~0)} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {646#(not (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-27 16:40:02,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {646#(not (< 0 (mod main_~n~0 4294967296)))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {646#(not (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-27 16:40:02,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {646#(not (< 0 (mod main_~n~0 4294967296)))} [87] L23-2-->L23-2: Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (= v_main_~z~0_9 (+ (* (- 1) v_main_~x~0_8) v_main_~z~0_10 v_main_~x~0_9)) (< v_main_~x~0_9 v_main_~x~0_8) (< 0 .cse0) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~x~0_9 v_it_2 1) v_main_~x~0_8)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_2 4294967295)) 4294967296))))))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_9, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {646#(not (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-27 16:40:02,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {646#(not (< 0 (mod main_~n~0 4294967296)))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {656#(and (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-27 16:40:02,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {656#(and (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {656#(and (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-27 16:40:02,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {656#(and (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {656#(and (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-27 16:40:02,798 INFO L272 TraceCheckUtils]: 12: Hoare triple {656#(and (not (< 0 (mod main_~z~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {666#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:40:02,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {666#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {670#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:40:02,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#(<= 1 __VERIFIER_assert_~cond)} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {612#false} is VALID [2022-04-27 16:40:02,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {612#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {612#false} is VALID [2022-04-27 16:40:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:40:02,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:40:02,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422445084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:40:02,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 16:40:02,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-04-27 16:40:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033573666] [2022-04-27 16:40:02,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:40:02,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 16 [2022-04-27 16:40:02,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:40:02,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:40:02,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:40:02,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:40:02,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:40:02,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:40:02,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-27 16:40:02,834 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:40:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:40:02,955 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-27 16:40:02,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:40:02,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 16 [2022-04-27 16:40:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:40:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:40:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 16:40:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:40:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 16:40:02,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-27 16:40:02,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:40:02,997 INFO L225 Difference]: With dead ends: 28 [2022-04-27 16:40:02,997 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 16:40:02,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-27 16:40:02,998 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:40:02,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 74 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-04-27 16:40:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 16:40:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-04-27 16:40:03,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:40:03,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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:40:03,002 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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:40:03,002 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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:40:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:40:03,003 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-04-27 16:40:03,003 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-04-27 16:40:03,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:40:03,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:40:03,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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 25 states. [2022-04-27 16:40:03,004 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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 25 states. [2022-04-27 16:40:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:40:03,005 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-04-27 16:40:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-04-27 16:40:03,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:40:03,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:40:03,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:40:03,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:40:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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:40:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-04-27 16:40:03,007 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2022-04-27 16:40:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:40:03,007 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-04-27 16:40:03,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:40:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-27 16:40:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:40:03,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:40:03,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:40:03,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 16:40:03,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:40:03,231 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:40:03,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:40:03,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1590526661, now seen corresponding path program 1 times [2022-04-27 16:40:03,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:40:03,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111527839] [2022-04-27 16:40:03,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:40:03,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:40:03,250 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:40:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:40:03,288 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:40:03,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:40:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:40:03,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {783#true} is VALID [2022-04-27 16:40:03,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:03,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {783#true} {783#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:03,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:40:03,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {783#true} is VALID [2022-04-27 16:40:03,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:03,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:03,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:03,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {788#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:40:03,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {788#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [83] L16-2-->L16-2: Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_6 v_main_~y~0_5)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_6 v_it_1 1) v_main_~y~0_5)))) (< v_main_~y~0_6 v_main_~y~0_5) (< 0 .cse0) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_6 (* (- 1) v_main_~y~0_5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {789#(or (<= main_~n~0 (* (div (* main_~n~0 2) 4294967296) 2147483648)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-27 16:40:03,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {789#(or (<= main_~n~0 (* (div (* main_~n~0 2) 4294967296) 2147483648)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {790#(or (<= main_~n~0 (* (div (* main_~n~0 2) 4294967296) 2147483648)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-27 16:40:03,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#(or (<= main_~n~0 (* (div (* main_~n~0 2) 4294967296) 2147483648)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {791#(or (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-27 16:40:03,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {791#(or (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {792#(or (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-27 16:40:03,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {792#(or (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {793#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:40:03,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {793#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {793#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:40:03,567 INFO L272 TraceCheckUtils]: 12: Hoare triple {793#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {794#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:40:03,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {794#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {795#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:40:03,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {795#(not (= __VERIFIER_assert_~cond 0))} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {784#false} is VALID [2022-04-27 16:40:03,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {784#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#false} is VALID [2022-04-27 16:40:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:40:03,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:40:03,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111527839] [2022-04-27 16:40:03,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111527839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:40:03,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151044649] [2022-04-27 16:40:03,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:40:03,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:40:03,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:40:03,572 INFO L229 MonitoredProcess]: Starting monitored process 5 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:40:03,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 16:40:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:40:03,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 16:40:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:40:03,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:40:09,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:09,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} [77] 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) 10) (= (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] {783#true} is VALID [2022-04-27 16:40:09,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:09,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:09,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:09,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {788#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:40:09,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {788#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [83] L16-2-->L16-2: Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_6 v_main_~y~0_5)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_6 v_it_1 1) v_main_~y~0_5)))) (< v_main_~y~0_6 v_main_~y~0_5) (< 0 .cse0) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_6 (* (- 1) v_main_~y~0_5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {818#(or (and (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) main_~y~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)))} is VALID [2022-04-27 16:40:09,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {818#(or (and (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) main_~y~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {818#(or (and (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) main_~y~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)))} is VALID [2022-04-27 16:40:09,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {818#(or (and (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) main_~y~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {825#(and (= main_~z~0 main_~y~0) (or (and (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) main_~y~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0))))} is VALID [2022-04-27 16:40:09,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {825#(and (= main_~z~0 main_~y~0) (or (and (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) main_~y~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0))))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {829#(and (= main_~z~0 main_~y~0) (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0))} is VALID [2022-04-27 16:40:09,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {829#(and (= main_~z~0 main_~y~0) (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {833#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 16:40:09,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {833#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {833#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 16:40:09,251 INFO L272 TraceCheckUtils]: 12: Hoare triple {833#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {840#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:40:09,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {840#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {844#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:40:09,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#(<= 1 __VERIFIER_assert_~cond)} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {784#false} is VALID [2022-04-27 16:40:09,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {784#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#false} is VALID [2022-04-27 16:40:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:40:09,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:40:14,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {784#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#false} is VALID [2022-04-27 16:40:14,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#(<= 1 __VERIFIER_assert_~cond)} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {784#false} is VALID [2022-04-27 16:40:14,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {840#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {844#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:40:14,462 INFO L272 TraceCheckUtils]: 12: Hoare triple {793#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {840#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:40:14,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {793#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {793#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:40:14,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {792#(or (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {793#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:40:14,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {869#(or (< 0 (mod main_~z~0 4294967296)) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {792#(or (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-27 16:40:14,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#(or (<= main_~n~0 (* (div (* main_~n~0 2) 4294967296) 2147483648)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {869#(or (< 0 (mod main_~z~0 4294967296)) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-27 16:40:14,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#(or (<= main_~n~0 (* (div (* main_~n~0 2) 4294967296) 2147483648)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {790#(or (<= main_~n~0 (* (div (* main_~n~0 2) 4294967296) 2147483648)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-27 16:40:14,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {879#(or (<= main_~n~0 (* (div (* main_~n~0 2) 4294967296) 2147483648)) (forall ((aux_mod_v_main_~y~0_18_31 Int) (aux_div_v_main_~y~0_18_31 Int)) (or (<= 1 aux_mod_v_main_~y~0_18_31) (< aux_mod_v_main_~y~0_18_31 0) (and (or (not (= (+ (* aux_div_v_main_~y~0_18_31 4294967296) aux_mod_v_main_~y~0_18_31) main_~y~0)) (< 0 (mod main_~x~0 4294967296))) (or (not (< main_~y~0 (+ (* aux_div_v_main_~y~0_18_31 4294967296) aux_mod_v_main_~y~0_18_31))) (not (< 0 (mod main_~x~0 4294967296))) (exists ((v_it_1 Int)) (and (not (< 0 (mod (+ main_~x~0 (* v_it_1 4294967295)) 4294967296))) (<= (+ v_it_1 main_~y~0 1) (+ (* aux_div_v_main_~y~0_18_31 4294967296) aux_mod_v_main_~y~0_18_31)) (<= 1 v_it_1))))))))} [83] L16-2-->L16-2: Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_6 v_main_~y~0_5)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_6 v_it_1 1) v_main_~y~0_5)))) (< v_main_~y~0_6 v_main_~y~0_5) (< 0 .cse0) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_6 (* (- 1) v_main_~y~0_5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {790#(or (<= main_~n~0 (* (div (* main_~n~0 2) 4294967296) 2147483648)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-27 16:40:14,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {879#(or (<= main_~n~0 (* (div (* main_~n~0 2) 4294967296) 2147483648)) (forall ((aux_mod_v_main_~y~0_18_31 Int) (aux_div_v_main_~y~0_18_31 Int)) (or (<= 1 aux_mod_v_main_~y~0_18_31) (< aux_mod_v_main_~y~0_18_31 0) (and (or (not (= (+ (* aux_div_v_main_~y~0_18_31 4294967296) aux_mod_v_main_~y~0_18_31) main_~y~0)) (< 0 (mod main_~x~0 4294967296))) (or (not (< main_~y~0 (+ (* aux_div_v_main_~y~0_18_31 4294967296) aux_mod_v_main_~y~0_18_31))) (not (< 0 (mod main_~x~0 4294967296))) (exists ((v_it_1 Int)) (and (not (< 0 (mod (+ main_~x~0 (* v_it_1 4294967295)) 4294967296))) (<= (+ v_it_1 main_~y~0 1) (+ (* aux_div_v_main_~y~0_18_31 4294967296) aux_mod_v_main_~y~0_18_31)) (<= 1 v_it_1))))))))} is VALID [2022-04-27 16:40:14,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:14,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:14,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:14,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} [77] 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) 10) (= (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] {783#true} is VALID [2022-04-27 16:40:14,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 16:40:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:40:14,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151044649] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:40:14,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:40:14,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-04-27 16:40:14,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547055848] [2022-04-27 16:40:14,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:40:14,479 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 16 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 16:40:14,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:40:14,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 16 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:40:14,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:40:14,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 16:40:14,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:40:14,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 16:40:14,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=264, Unknown=2, NotChecked=0, Total=342 [2022-04-27 16:40:14,594 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 16 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:40:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:40:14,944 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-27 16:40:14,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 16:40:14,945 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 16 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 16:40:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:40:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 16 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:40:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-27 16:40:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 16 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:40:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-27 16:40:14,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2022-04-27 16:40:15,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:40:15,015 INFO L225 Difference]: With dead ends: 33 [2022-04-27 16:40:15,015 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 16:40:15,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=130, Invalid=468, Unknown=2, NotChecked=0, Total=600 [2022-04-27 16:40:15,016 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:40:15,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 63 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-04-27 16:40:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 16:40:15,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-04-27 16:40:15,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:40:15,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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:40:15,019 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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:40:15,019 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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:40:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:40:15,021 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2022-04-27 16:40:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2022-04-27 16:40:15,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:40:15,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:40:15,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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 30 states. [2022-04-27 16:40:15,021 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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 30 states. [2022-04-27 16:40:15,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:40:15,023 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2022-04-27 16:40:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2022-04-27 16:40:15,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:40:15,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:40:15,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:40:15,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:40:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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:40:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-04-27 16:40:15,024 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 16 [2022-04-27 16:40:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:40:15,024 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-04-27 16:40:15,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 16 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:40:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-27 16:40:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:40:15,025 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:40:15,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:40:15,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 16:40:15,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:40:15,234 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:40:15,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:40:15,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1741270951, now seen corresponding path program 1 times [2022-04-27 16:40:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:40:15,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824997584] [2022-04-27 16:40:15,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:40:15,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:40:15,246 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:40:15,247 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-27 16:40:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:40:15,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:40:15,267 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-27 16:40:15,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:40:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:40:15,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {1044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {1032#true} is VALID [2022-04-27 16:40:15,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {1032#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:15,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1032#true} {1032#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:15,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {1032#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:40:15,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {1044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {1032#true} is VALID [2022-04-27 16:40:15,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:15,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#true} {1032#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:15,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:15,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1037#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:40:15,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {1037#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1038#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:40:15,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {1038#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {1039#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:40:15,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {1039#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1039#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:40:15,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {1039#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {1040#(and (= main_~n~0 main_~x~0) (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~x~0 2)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= 0 main_~z~0))} is VALID [2022-04-27 16:40:15,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {1040#(and (= main_~n~0 main_~x~0) (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~x~0 2)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= 0 main_~z~0))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1040#(and (= main_~n~0 main_~x~0) (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~x~0 2)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= 0 main_~z~0))} is VALID [2022-04-27 16:40:15,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {1040#(and (= main_~n~0 main_~x~0) (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~x~0 2)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= 0 main_~z~0))} [93] L35-1-->L35-1: Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= v_main_~x~0_7 v_main_~x~0_6)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= v_main_~z~0_4 (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~z~0_5))))) InVars {main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post11, main_#t~post12] {1041#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:40:15,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {1041#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1041#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:40:15,447 INFO L272 TraceCheckUtils]: 13: Hoare triple {1041#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1042#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:40:15,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1043#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:40:15,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {1043#(not (= __VERIFIER_assert_~cond 0))} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1033#false} is VALID [2022-04-27 16:40:15,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {1033#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#false} is VALID [2022-04-27 16:40:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:40:15,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:40:15,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824997584] [2022-04-27 16:40:15,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824997584] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:40:15,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691958095] [2022-04-27 16:40:15,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:40:15,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:40:15,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:40:15,450 INFO L229 MonitoredProcess]: Starting monitored process 6 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:40:15,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 16:40:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:40:15,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 16:40:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:40:15,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:40:16,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {1032#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:16,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {1032#true} [77] 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) 10) (= (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] {1032#true} is VALID [2022-04-27 16:40:16,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:16,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#true} {1032#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:16,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:16,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1037#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:40:16,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {1037#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1038#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:40:16,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {1038#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {1039#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:40:16,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {1039#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1039#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:40:16,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {1039#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {1040#(and (= main_~n~0 main_~x~0) (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~x~0 2)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= 0 main_~z~0))} is VALID [2022-04-27 16:40:16,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {1040#(and (= main_~n~0 main_~x~0) (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~x~0 2)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= 0 main_~z~0))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1040#(and (= main_~n~0 main_~x~0) (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~x~0 2)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= 0 main_~z~0))} is VALID [2022-04-27 16:40:16,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {1040#(and (= main_~n~0 main_~x~0) (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~x~0 2)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= 0 main_~z~0))} [93] L35-1-->L35-1: Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= v_main_~x~0_7 v_main_~x~0_6)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= v_main_~z~0_4 (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~z~0_5))))) InVars {main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post11, main_#t~post12] {1040#(and (= main_~n~0 main_~x~0) (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~x~0 2)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= 0 main_~z~0))} is VALID [2022-04-27 16:40:16,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {1040#(and (= main_~n~0 main_~x~0) (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~x~0 2)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= 0 main_~z~0))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1084#(and (<= (mod main_~n~0 4294967296) 0) (<= (+ (* (div main_~n~0 4294967296) 8589934592) main_~z~0) (* main_~n~0 2)) (<= 0 main_~z~0))} is VALID [2022-04-27 16:40:16,458 INFO L272 TraceCheckUtils]: 13: Hoare triple {1084#(and (<= (mod main_~n~0 4294967296) 0) (<= (+ (* (div main_~n~0 4294967296) 8589934592) main_~z~0) (* main_~n~0 2)) (<= 0 main_~z~0))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1088#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:40:16,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {1088#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1092#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:40:16,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {1092#(<= 1 __VERIFIER_assert_~cond)} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1033#false} is VALID [2022-04-27 16:40:16,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {1033#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#false} is VALID [2022-04-27 16:40:16,459 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:40:16,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:40:28,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_#t~post10| Int) (v_main_~y~0_21 Int) (|v_main_#t~post10_9| Int) (|main_#t~post9| Int) (|v_main_#t~post9_9| Int) (v_main_~z~0_31 Int)) (or (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (or (not (= |v_main_#t~post10_9| |main_#t~post10|)) (not (= |main_#t~post9| |v_main_#t~post9_9|)) (not (<= .cse0 0)) (not (= v_main_~y~0_21 c_main_~y~0)) (not (= v_main_~z~0_31 c_main_~z~0))) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_main_~y~0_21 v_it_3 1) c_main_~y~0))) (not (< 0 .cse0)) (not (= v_main_~z~0_31 (+ (* (- 1) v_main_~y~0_21) c_main_~y~0 c_main_~z~0))) (not (< v_main_~y~0_21 c_main_~y~0))))) (forall ((aux_mod_v_main_~z~0_30_31 Int)) (or (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (forall ((aux_div_v_main_~z~0_30_31 Int)) (not (= v_main_~z~0_31 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)))) .cse1) (or (forall ((aux_div_v_main_~x~0_25_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (let ((.cse2 (* 4294967296 aux_div_v_main_~z~0_30_31))) (let ((.cse4 (+ v_main_~z~0_31 c_main_~x~0)) (.cse3 (+ .cse2 aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296)))) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~z~0_31 v_it_4 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)) (<= 1 v_it_4))) (not (< v_main_~z~0_31 (+ .cse2 aux_mod_v_main_~z~0_30_31))) (< .cse3 .cse4) (< .cse4 .cse3))))) (not .cse1)))) (= aux_mod_v_main_~z~0_30_31 (mod (* 2 c_main_~n~0) 4294967296)) (>= aux_mod_v_main_~z~0_30_31 4294967296) (> 0 aux_mod_v_main_~z~0_30_31))))) is different from false [2022-04-27 16:40:50,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {1033#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#false} is VALID [2022-04-27 16:40:50,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {1092#(<= 1 __VERIFIER_assert_~cond)} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1033#false} is VALID [2022-04-27 16:40:50,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {1088#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1092#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:40:50,526 INFO L272 TraceCheckUtils]: 13: Hoare triple {1108#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1088#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:40:50,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {1112#(or (= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296)) (< 0 (mod main_~x~0 4294967296)))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1108#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} is VALID [2022-04-27 16:40:52,539 WARN L290 TraceCheckUtils]: 11: Hoare triple {1116#(forall ((aux_mod_v_main_~z~0_30_31 Int)) (or (>= aux_mod_v_main_~z~0_30_31 4294967296) (and (or (forall ((aux_div_v_main_~x~0_25_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (< (+ main_~z~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296))) (< (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296)) (+ main_~z~0 main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= (+ v_it_4 main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)) (<= 1 v_it_4))) (not (< main_~z~0 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~z~0_30_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31) main_~z~0))) (< 0 (mod main_~x~0 4294967296)))) (> 0 aux_mod_v_main_~z~0_30_31) (= aux_mod_v_main_~z~0_30_31 (mod (* main_~n~0 2) 4294967296))))} [93] L35-1-->L35-1: Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= v_main_~x~0_7 v_main_~x~0_6)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= v_main_~z~0_4 (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~z~0_5))))) InVars {main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post11, main_#t~post12] {1112#(or (= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is UNKNOWN [2022-04-27 16:40:52,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {1116#(forall ((aux_mod_v_main_~z~0_30_31 Int)) (or (>= aux_mod_v_main_~z~0_30_31 4294967296) (and (or (forall ((aux_div_v_main_~x~0_25_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (< (+ main_~z~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296))) (< (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296)) (+ main_~z~0 main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= (+ v_it_4 main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)) (<= 1 v_it_4))) (not (< main_~z~0 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~z~0_30_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31) main_~z~0))) (< 0 (mod main_~x~0 4294967296)))) (> 0 aux_mod_v_main_~z~0_30_31) (= aux_mod_v_main_~z~0_30_31 (mod (* main_~n~0 2) 4294967296))))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1116#(forall ((aux_mod_v_main_~z~0_30_31 Int)) (or (>= aux_mod_v_main_~z~0_30_31 4294967296) (and (or (forall ((aux_div_v_main_~x~0_25_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (< (+ main_~z~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296))) (< (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296)) (+ main_~z~0 main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= (+ v_it_4 main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)) (<= 1 v_it_4))) (not (< main_~z~0 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~z~0_30_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31) main_~z~0))) (< 0 (mod main_~x~0 4294967296)))) (> 0 aux_mod_v_main_~z~0_30_31) (= aux_mod_v_main_~z~0_30_31 (mod (* main_~n~0 2) 4294967296))))} is VALID [2022-04-27 16:40:54,551 WARN L290 TraceCheckUtils]: 9: Hoare triple {1123#(forall ((|main_#t~post10| Int) (v_main_~y~0_21 Int) (|v_main_#t~post10_9| Int) (|main_#t~post9| Int) (|v_main_#t~post9_9| Int) (v_main_~z~0_31 Int)) (or (forall ((aux_mod_v_main_~z~0_30_31 Int)) (or (and (or (forall ((aux_div_v_main_~x~0_25_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (not (< v_main_~z~0_31 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31))) (< (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296)) (+ v_main_~z~0_31 main_~x~0)) (< (+ v_main_~z~0_31 main_~x~0) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296))) (exists ((v_it_4 Int)) (and (<= (+ v_main_~z~0_31 v_it_4 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)) (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_4))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~z~0_30_31 Int)) (not (= v_main_~z~0_31 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)))) (< 0 (mod main_~x~0 4294967296)))) (>= aux_mod_v_main_~z~0_30_31 4294967296) (> 0 aux_mod_v_main_~z~0_30_31) (= aux_mod_v_main_~z~0_30_31 (mod (* main_~n~0 2) 4294967296)))) (and (or (not (= v_main_~y~0_21 main_~y~0)) (not (<= (mod main_~y~0 4294967296) 0)) (not (= |v_main_#t~post10_9| |main_#t~post10|)) (not (= |main_#t~post9| |v_main_#t~post9_9|)) (not (= v_main_~z~0_31 main_~z~0))) (or (not (< 0 (mod main_~y~0 4294967296))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_main_~y~0_21 v_it_3 1) main_~y~0) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (= v_main_~z~0_31 (+ (* (- 1) v_main_~y~0_21) main_~z~0 main_~y~0))) (not (< v_main_~y~0_21 main_~y~0))))))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {1116#(forall ((aux_mod_v_main_~z~0_30_31 Int)) (or (>= aux_mod_v_main_~z~0_30_31 4294967296) (and (or (forall ((aux_div_v_main_~x~0_25_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (< (+ main_~z~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296))) (< (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296)) (+ main_~z~0 main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= (+ v_it_4 main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)) (<= 1 v_it_4))) (not (< main_~z~0 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~z~0_30_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31) main_~z~0))) (< 0 (mod main_~x~0 4294967296)))) (> 0 aux_mod_v_main_~z~0_30_31) (= aux_mod_v_main_~z~0_30_31 (mod (* main_~n~0 2) 4294967296))))} is UNKNOWN [2022-04-27 16:40:56,570 WARN L290 TraceCheckUtils]: 8: Hoare triple {1127#(or (forall ((|main_#t~post10| Int) (v_main_~y~0_21 Int) (|v_main_#t~post10_9| Int) (|main_#t~post9| Int) (|v_main_#t~post9_9| Int) (v_main_~z~0_31 Int)) (or (forall ((aux_mod_v_main_~z~0_30_31 Int)) (or (and (or (forall ((aux_div_v_main_~x~0_25_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (not (< v_main_~z~0_31 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31))) (< (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296)) (+ v_main_~z~0_31 main_~x~0)) (< (+ v_main_~z~0_31 main_~x~0) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296))) (exists ((v_it_4 Int)) (and (<= (+ v_main_~z~0_31 v_it_4 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)) (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_4))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~z~0_30_31 Int)) (not (= v_main_~z~0_31 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)))) (< 0 (mod main_~x~0 4294967296)))) (>= aux_mod_v_main_~z~0_30_31 4294967296) (> 0 aux_mod_v_main_~z~0_30_31) (= aux_mod_v_main_~z~0_30_31 (mod (* main_~n~0 2) 4294967296)))) (and (or (not (= v_main_~y~0_21 main_~y~0)) (not (<= (mod main_~y~0 4294967296) 0)) (not (= |v_main_#t~post10_9| |main_#t~post10|)) (not (= |main_#t~post9| |v_main_#t~post9_9|)) (not (= v_main_~z~0_31 main_~z~0))) (or (not (< 0 (mod main_~y~0 4294967296))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_main_~y~0_21 v_it_3 1) main_~y~0) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (= v_main_~z~0_31 (+ (* (- 1) v_main_~y~0_21) main_~z~0 main_~y~0))) (not (< v_main_~y~0_21 main_~y~0)))))) (< 0 (mod main_~z~0 4294967296)))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1123#(forall ((|main_#t~post10| Int) (v_main_~y~0_21 Int) (|v_main_#t~post10_9| Int) (|main_#t~post9| Int) (|v_main_#t~post9_9| Int) (v_main_~z~0_31 Int)) (or (forall ((aux_mod_v_main_~z~0_30_31 Int)) (or (and (or (forall ((aux_div_v_main_~x~0_25_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (not (< v_main_~z~0_31 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31))) (< (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296)) (+ v_main_~z~0_31 main_~x~0)) (< (+ v_main_~z~0_31 main_~x~0) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296))) (exists ((v_it_4 Int)) (and (<= (+ v_main_~z~0_31 v_it_4 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)) (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_4))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~z~0_30_31 Int)) (not (= v_main_~z~0_31 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)))) (< 0 (mod main_~x~0 4294967296)))) (>= aux_mod_v_main_~z~0_30_31 4294967296) (> 0 aux_mod_v_main_~z~0_30_31) (= aux_mod_v_main_~z~0_30_31 (mod (* main_~n~0 2) 4294967296)))) (and (or (not (= v_main_~y~0_21 main_~y~0)) (not (<= (mod main_~y~0 4294967296) 0)) (not (= |v_main_#t~post10_9| |main_#t~post10|)) (not (= |main_#t~post9| |v_main_#t~post9_9|)) (not (= v_main_~z~0_31 main_~z~0))) (or (not (< 0 (mod main_~y~0 4294967296))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_main_~y~0_21 v_it_3 1) main_~y~0) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (= v_main_~z~0_31 (+ (* (- 1) v_main_~y~0_21) main_~z~0 main_~y~0))) (not (< v_main_~y~0_21 main_~y~0))))))} is UNKNOWN [2022-04-27 16:40:58,580 WARN L290 TraceCheckUtils]: 7: Hoare triple {1131#(or (forall ((aux_mod_v_main_~z~0_30_31 Int)) (or (>= aux_mod_v_main_~z~0_30_31 4294967296) (and (or (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_25_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (< (+ main_~y~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ v_it_4 main_~y~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)))) (not (< main_~y~0 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31))) (< (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296)) (+ main_~y~0 main_~x~0))))) (or (forall ((aux_div_v_main_~z~0_30_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31) main_~y~0))) (< 0 (mod main_~x~0 4294967296)))) (> 0 aux_mod_v_main_~z~0_30_31) (= aux_mod_v_main_~z~0_30_31 (mod (* main_~n~0 2) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {1127#(or (forall ((|main_#t~post10| Int) (v_main_~y~0_21 Int) (|v_main_#t~post10_9| Int) (|main_#t~post9| Int) (|v_main_#t~post9_9| Int) (v_main_~z~0_31 Int)) (or (forall ((aux_mod_v_main_~z~0_30_31 Int)) (or (and (or (forall ((aux_div_v_main_~x~0_25_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (not (< v_main_~z~0_31 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31))) (< (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296)) (+ v_main_~z~0_31 main_~x~0)) (< (+ v_main_~z~0_31 main_~x~0) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296))) (exists ((v_it_4 Int)) (and (<= (+ v_main_~z~0_31 v_it_4 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)) (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_4))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~z~0_30_31 Int)) (not (= v_main_~z~0_31 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)))) (< 0 (mod main_~x~0 4294967296)))) (>= aux_mod_v_main_~z~0_30_31 4294967296) (> 0 aux_mod_v_main_~z~0_30_31) (= aux_mod_v_main_~z~0_30_31 (mod (* main_~n~0 2) 4294967296)))) (and (or (not (= v_main_~y~0_21 main_~y~0)) (not (<= (mod main_~y~0 4294967296) 0)) (not (= |v_main_#t~post10_9| |main_#t~post10|)) (not (= |main_#t~post9| |v_main_#t~post9_9|)) (not (= v_main_~z~0_31 main_~z~0))) (or (not (< 0 (mod main_~y~0 4294967296))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_main_~y~0_21 v_it_3 1) main_~y~0) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (= v_main_~z~0_31 (+ (* (- 1) v_main_~y~0_21) main_~z~0 main_~y~0))) (not (< v_main_~y~0_21 main_~y~0)))))) (< 0 (mod main_~z~0 4294967296)))} is UNKNOWN [2022-04-27 16:40:58,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {1135#(or (<= (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 1) (mod (* main_~n~0 2) 4294967296) (* (- 1) main_~y~0)) (- 4294967296))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod main_~y~0 4294967296)))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1131#(or (forall ((aux_mod_v_main_~z~0_30_31 Int)) (or (>= aux_mod_v_main_~z~0_30_31 4294967296) (and (or (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_25_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (< (+ main_~y~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ v_it_4 main_~y~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)))) (not (< main_~y~0 (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31))) (< (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31 (* aux_div_v_main_~x~0_25_31 4294967296)) (+ main_~y~0 main_~x~0))))) (or (forall ((aux_div_v_main_~z~0_30_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31) main_~y~0))) (< 0 (mod main_~x~0 4294967296)))) (> 0 aux_mod_v_main_~z~0_30_31) (= aux_mod_v_main_~z~0_30_31 (mod (* main_~n~0 2) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 16:40:58,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1135#(or (<= (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 1) (mod (* main_~n~0 2) 4294967296) (* (- 1) main_~y~0)) (- 4294967296))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 16:40:58,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:58,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#true} {1032#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:58,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:58,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {1032#true} [77] 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) 10) (= (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] {1032#true} is VALID [2022-04-27 16:40:58,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {1032#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-27 16:40:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-04-27 16:40:58,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691958095] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:40:58,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:40:58,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 20 [2022-04-27 16:40:58,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452443970] [2022-04-27 16:40:58,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:40:58,592 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 16:40:58,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:40:58,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:41:08,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 28 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-27 16:41:08,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 16:41:08,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:41:08,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 16:41:08,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=268, Unknown=7, NotChecked=34, Total=380 [2022-04-27 16:41:08,770 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:41:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:41:17,456 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-27 16:41:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 16:41:17,456 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 16:41:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:41:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:41:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-27 16:41:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:41:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-27 16:41:17,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2022-04-27 16:41:17,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:41:17,509 INFO L225 Difference]: With dead ends: 35 [2022-04-27 16:41:17,510 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 16:41:17,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=127, Invalid=468, Unknown=9, NotChecked=46, Total=650 [2022-04-27 16:41:17,511 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:41:17,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 67 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-04-27 16:41:17,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 16:41:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-27 16:41:17,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:41:17,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 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:41:17,513 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 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:41:17,513 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 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:41:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:41:17,515 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2022-04-27 16:41:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2022-04-27 16:41:17,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:41:17,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:41:17,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 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 30 states. [2022-04-27 16:41:17,515 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 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 30 states. [2022-04-27 16:41:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:41:17,516 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2022-04-27 16:41:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2022-04-27 16:41:17,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:41:17,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:41:17,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:41:17,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:41:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 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:41:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-04-27 16:41:17,518 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-04-27 16:41:17,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:41:17,518 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-04-27 16:41:17,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:41:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-27 16:41:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:41:17,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:41:17,519 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:41:17,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 16:41:17,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:41:17,738 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:41:17,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:41:17,738 INFO L85 PathProgramCache]: Analyzing trace with hash -968283874, now seen corresponding path program 2 times [2022-04-27 16:41:17,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:41:17,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918758466] [2022-04-27 16:41:17,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:41:17,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:41:17,749 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:41:17,755 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-04-27 16:41:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:41:17,786 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:41:17,795 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-04-27 16:41:17,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:41:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:41:17,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {1303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {1291#true} is VALID [2022-04-27 16:41:17,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {1291#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:41:17,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1291#true} {1291#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:41:17,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {1291#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:41:17,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {1303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {1291#true} is VALID [2022-04-27 16:41:17,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {1291#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:41:17,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1291#true} {1291#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:41:17,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {1291#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:41:17,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {1291#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1296#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:41:17,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {1296#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1297#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:41:17,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {1298#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:41:17,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {1298#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1298#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:41:17,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {1298#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {1298#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:41:18,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {1298#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {1299#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:41:18,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {1299#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1299#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:41:18,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {1299#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1300#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:41:18,018 INFO L272 TraceCheckUtils]: 13: Hoare triple {1300#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1301#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:41:18,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {1301#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1302#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:41:18,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#(not (= __VERIFIER_assert_~cond 0))} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1292#false} is VALID [2022-04-27 16:41:18,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {1292#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1292#false} is VALID [2022-04-27 16:41:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:41:18,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:41:18,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918758466] [2022-04-27 16:41:18,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918758466] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:41:18,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908480285] [2022-04-27 16:41:18,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:41:18,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:41:18,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:41:18,021 INFO L229 MonitoredProcess]: Starting monitored process 7 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:41:18,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 16:41:18,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 16:41:18,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:41:18,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 16:41:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:41:18,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:41:18,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {1291#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:41:18,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {1291#true} [77] 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) 10) (= (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] {1291#true} is VALID [2022-04-27 16:41:18,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {1291#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:41:18,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1291#true} {1291#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:41:18,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {1291#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:41:18,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {1291#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1296#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:41:18,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {1296#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1325#(and (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:41:18,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#(and (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {1329#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:41:18,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {1329#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1329#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:41:18,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {1329#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:41:18,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {1329#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~n~0 4294967296))) (= main_~y~0 0))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {1339#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 16:41:18,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {1339#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1339#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 16:41:18,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {1339#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1339#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 16:41:18,388 INFO L272 TraceCheckUtils]: 13: Hoare triple {1339#(and (= main_~z~0 0) (<= (mod main_~n~0 4294967296) 0))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1349#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:41:18,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {1349#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1353#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:41:18,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {1353#(<= 1 __VERIFIER_assert_~cond)} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1292#false} is VALID [2022-04-27 16:41:18,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {1292#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1292#false} is VALID [2022-04-27 16:41:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:41:18,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:42:15,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {1292#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1292#false} is VALID [2022-04-27 16:42:15,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {1353#(<= 1 __VERIFIER_assert_~cond)} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1292#false} is VALID [2022-04-27 16:42:15,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {1349#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1353#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:42:15,342 INFO L272 TraceCheckUtils]: 13: Hoare triple {1369#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1349#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:42:15,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {1369#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1369#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} is VALID [2022-04-27 16:42:15,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {1369#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1369#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} is VALID [2022-04-27 16:42:15,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {1379#(forall ((aux_div_v_main_~z~0_36_31 Int) (aux_mod_v_main_~z~0_36_31 Int)) (or (and (or (not (= (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31) main_~z~0)) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))) (<= (+ v_it_3 main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31)))) (not (< main_~z~0 (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31))))) (>= aux_mod_v_main_~z~0_36_31 4294967296) (= aux_mod_v_main_~z~0_36_31 (mod (* main_~n~0 2) 4294967296)) (> 0 aux_mod_v_main_~z~0_36_31)))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {1369#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} is VALID [2022-04-27 16:42:17,366 WARN L290 TraceCheckUtils]: 9: Hoare triple {1383#(forall ((aux_mod_v_main_~z~0_36_31 Int)) (or (>= aux_mod_v_main_~z~0_36_31 4294967296) (= aux_mod_v_main_~z~0_36_31 (mod (* main_~n~0 2) 4294967296)) (and (or (forall ((aux_div_v_main_~z~0_36_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31) main_~z~0))) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (forall ((v_main_~z~0_37 Int)) (or (and (or (not (< 0 (mod (+ main_~z~0 main_~y~0 (* v_main_~z~0_37 4294967295)) 4294967296))) (forall ((aux_div_v_main_~z~0_36_31 Int)) (or (not (< v_main_~z~0_37 (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_main_~z~0_37 v_it_3 1) (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31)) (not (< 0 (mod (+ main_~z~0 main_~y~0 (* v_it_3 4294967295) (* v_main_~z~0_37 4294967295)) 4294967296)))))))) (or (forall ((aux_div_v_main_~z~0_36_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31) v_main_~z~0_37))) (< 0 (mod (+ main_~z~0 main_~y~0 (* v_main_~z~0_37 4294967295)) 4294967296)))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))) (<= (+ v_it_3 main_~z~0 1) v_main_~z~0_37))) (not (< main_~z~0 v_main_~z~0_37)))))) (> 0 aux_mod_v_main_~z~0_36_31)))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {1379#(forall ((aux_div_v_main_~z~0_36_31 Int) (aux_mod_v_main_~z~0_36_31 Int)) (or (and (or (not (= (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31) main_~z~0)) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))) (<= (+ v_it_3 main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31)))) (not (< main_~z~0 (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31))))) (>= aux_mod_v_main_~z~0_36_31 4294967296) (= aux_mod_v_main_~z~0_36_31 (mod (* main_~n~0 2) 4294967296)) (> 0 aux_mod_v_main_~z~0_36_31)))} is UNKNOWN [2022-04-27 16:42:19,397 WARN L290 TraceCheckUtils]: 8: Hoare triple {1387#(or (< 0 (mod main_~z~0 4294967296)) (forall ((aux_mod_v_main_~z~0_36_31 Int)) (or (>= aux_mod_v_main_~z~0_36_31 4294967296) (= aux_mod_v_main_~z~0_36_31 (mod (* main_~n~0 2) 4294967296)) (and (or (forall ((aux_div_v_main_~z~0_36_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31) main_~z~0))) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (forall ((v_main_~z~0_37 Int)) (or (and (or (not (< 0 (mod (+ main_~z~0 main_~y~0 (* v_main_~z~0_37 4294967295)) 4294967296))) (forall ((aux_div_v_main_~z~0_36_31 Int)) (or (not (< v_main_~z~0_37 (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_main_~z~0_37 v_it_3 1) (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31)) (not (< 0 (mod (+ main_~z~0 main_~y~0 (* v_it_3 4294967295) (* v_main_~z~0_37 4294967295)) 4294967296)))))))) (or (forall ((aux_div_v_main_~z~0_36_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31) v_main_~z~0_37))) (< 0 (mod (+ main_~z~0 main_~y~0 (* v_main_~z~0_37 4294967295)) 4294967296)))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))) (<= (+ v_it_3 main_~z~0 1) v_main_~z~0_37))) (not (< main_~z~0 v_main_~z~0_37)))))) (> 0 aux_mod_v_main_~z~0_36_31))))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1383#(forall ((aux_mod_v_main_~z~0_36_31 Int)) (or (>= aux_mod_v_main_~z~0_36_31 4294967296) (= aux_mod_v_main_~z~0_36_31 (mod (* main_~n~0 2) 4294967296)) (and (or (forall ((aux_div_v_main_~z~0_36_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31) main_~z~0))) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (forall ((v_main_~z~0_37 Int)) (or (and (or (not (< 0 (mod (+ main_~z~0 main_~y~0 (* v_main_~z~0_37 4294967295)) 4294967296))) (forall ((aux_div_v_main_~z~0_36_31 Int)) (or (not (< v_main_~z~0_37 (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_main_~z~0_37 v_it_3 1) (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31)) (not (< 0 (mod (+ main_~z~0 main_~y~0 (* v_it_3 4294967295) (* v_main_~z~0_37 4294967295)) 4294967296)))))))) (or (forall ((aux_div_v_main_~z~0_36_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31) v_main_~z~0_37))) (< 0 (mod (+ main_~z~0 main_~y~0 (* v_main_~z~0_37 4294967295)) 4294967296)))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))) (<= (+ v_it_3 main_~z~0 1) v_main_~z~0_37))) (not (< main_~z~0 v_main_~z~0_37)))))) (> 0 aux_mod_v_main_~z~0_36_31)))} is UNKNOWN [2022-04-27 16:42:19,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {1391#(or (<= (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 1) (mod (* main_~n~0 2) 4294967296) (* (- 1) main_~y~0)) (- 4294967296))) (< 0 (mod main_~y~0 4294967296)))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {1387#(or (< 0 (mod main_~z~0 4294967296)) (forall ((aux_mod_v_main_~z~0_36_31 Int)) (or (>= aux_mod_v_main_~z~0_36_31 4294967296) (= aux_mod_v_main_~z~0_36_31 (mod (* main_~n~0 2) 4294967296)) (and (or (forall ((aux_div_v_main_~z~0_36_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31) main_~z~0))) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (forall ((v_main_~z~0_37 Int)) (or (and (or (not (< 0 (mod (+ main_~z~0 main_~y~0 (* v_main_~z~0_37 4294967295)) 4294967296))) (forall ((aux_div_v_main_~z~0_36_31 Int)) (or (not (< v_main_~z~0_37 (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_main_~z~0_37 v_it_3 1) (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31)) (not (< 0 (mod (+ main_~z~0 main_~y~0 (* v_it_3 4294967295) (* v_main_~z~0_37 4294967295)) 4294967296)))))))) (or (forall ((aux_div_v_main_~z~0_36_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_36_31) aux_mod_v_main_~z~0_36_31) v_main_~z~0_37))) (< 0 (mod (+ main_~z~0 main_~y~0 (* v_main_~z~0_37 4294967295)) 4294967296)))) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))) (<= (+ v_it_3 main_~z~0 1) v_main_~z~0_37))) (not (< main_~z~0 v_main_~z~0_37)))))) (> 0 aux_mod_v_main_~z~0_36_31))))} is VALID [2022-04-27 16:42:19,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {1395#(or (<= (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 1) (mod (* main_~n~0 2) 4294967296) (* (- 1) main_~y~0)) (- 4294967296))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod main_~y~0 4294967296)))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1391#(or (<= (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 1) (mod (* main_~n~0 2) 4294967296) (* (- 1) main_~y~0)) (- 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 16:42:19,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {1291#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1395#(or (<= (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 1) (mod (* main_~n~0 2) 4294967296) (* (- 1) main_~y~0)) (- 4294967296))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 16:42:19,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {1291#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:42:19,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1291#true} {1291#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:42:19,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {1291#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:42:19,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {1291#true} [77] 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) 10) (= (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] {1291#true} is VALID [2022-04-27 16:42:19,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {1291#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#true} is VALID [2022-04-27 16:42:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:42:19,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908480285] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:42:19,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:42:19,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 21 [2022-04-27 16:42:19,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569887915] [2022-04-27 16:42:19,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:42:19,406 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 16:42:19,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:42:19,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:42:25,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 35 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 16:42:25,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 16:42:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:42:25,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 16:42:25,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=319, Unknown=19, NotChecked=0, Total=420 [2022-04-27 16:42:25,534 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:42:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:42:30,490 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-27 16:42:30,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:42:30,490 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 16:42:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:42:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:42:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-27 16:42:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:42:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-27 16:42:30,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-04-27 16:42:30,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:42:30,528 INFO L225 Difference]: With dead ends: 34 [2022-04-27 16:42:30,528 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 16:42:30,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 52.3s TimeCoverageRelationStatistics Valid=129, Invalid=501, Unknown=20, NotChecked=0, Total=650 [2022-04-27 16:42:30,529 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:42:30,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 81 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 113 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-04-27 16:42:30,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 16:42:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-04-27 16:42:30,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:42:30,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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:42:30,533 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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:42:30,533 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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:42:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:42:30,534 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-04-27 16:42:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2022-04-27 16:42:30,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:42:30,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:42:30,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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 31 states. [2022-04-27 16:42:30,535 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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 31 states. [2022-04-27 16:42:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:42:30,536 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-04-27 16:42:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2022-04-27 16:42:30,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:42:30,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:42:30,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:42:30,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:42:30,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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:42:30,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-04-27 16:42:30,538 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2022-04-27 16:42:30,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:42:30,538 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-04-27 16:42:30,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:42:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-04-27 16:42:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:42:30,539 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:42:30,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:42:30,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 16:42:30,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:42:30,743 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:42:30,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:42:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1930032162, now seen corresponding path program 1 times [2022-04-27 16:42:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:42:30,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215964261] [2022-04-27 16:42:30,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:42:30,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:42:30,759 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-27 16:42:30,761 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-04-27 16:42:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:42:30,778 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-27 16:42:30,785 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.4))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-04-27 16:42:30,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:42:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:42:30,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {1562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {1551#true} is VALID [2022-04-27 16:42:30,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {1551#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:30,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1551#true} {1551#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:30,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {1551#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:42:30,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {1551#true} is VALID [2022-04-27 16:42:30,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {1551#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:30,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1551#true} {1551#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:30,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {1551#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:30,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {1551#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1556#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-27 16:42:30,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {1556#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1557#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:42:30,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {1557#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {1558#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 16:42:30,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {1558#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [87] L23-2-->L23-2: Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (= v_main_~z~0_9 (+ (* (- 1) v_main_~x~0_8) v_main_~z~0_10 v_main_~x~0_9)) (< v_main_~x~0_9 v_main_~x~0_8) (< 0 .cse0) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~x~0_9 v_it_2 1) v_main_~x~0_8)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_2 4294967295)) 4294967296))))))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_9, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {1558#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 16:42:30,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {1558#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1558#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 16:42:30,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {1558#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1558#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 16:42:30,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {1558#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [93] L35-1-->L35-1: Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= v_main_~x~0_7 v_main_~x~0_6)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= v_main_~z~0_4 (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~z~0_5))))) InVars {main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post11, main_#t~post12] {1559#(and (= main_~z~0 0) (<= (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-27 16:42:30,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {1559#(and (= main_~z~0 0) (<= (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0)))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1559#(and (= main_~z~0 0) (<= (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-27 16:42:30,916 INFO L272 TraceCheckUtils]: 13: Hoare triple {1559#(and (= main_~z~0 0) (<= (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0)))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:42:30,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1561#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:42:30,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#(not (= __VERIFIER_assert_~cond 0))} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1552#false} is VALID [2022-04-27 16:42:30,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {1552#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1552#false} is VALID [2022-04-27 16:42:30,917 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:42:30,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:42:30,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215964261] [2022-04-27 16:42:30,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215964261] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:42:30,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106592705] [2022-04-27 16:42:30,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:42:30,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:42:30,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:42:30,920 INFO L229 MonitoredProcess]: Starting monitored process 8 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:42:30,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 16:42:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:42:30,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 16:42:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:42:30,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:42:31,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {1551#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:31,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {1551#true} [77] 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) 10) (= (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] {1551#true} is VALID [2022-04-27 16:42:31,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {1551#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:31,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1551#true} {1551#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:31,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {1551#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:31,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {1551#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1556#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-27 16:42:31,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {1556#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1557#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:42:31,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {1557#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {1587#(and (= main_~n~0 main_~x~0) (= main_~z~0 main_~y~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:42:31,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {1587#(and (= main_~n~0 main_~x~0) (= main_~z~0 main_~y~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [87] L23-2-->L23-2: Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (= v_main_~z~0_9 (+ (* (- 1) v_main_~x~0_8) v_main_~z~0_10 v_main_~x~0_9)) (< v_main_~x~0_9 v_main_~x~0_8) (< 0 .cse0) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~x~0_9 v_it_2 1) v_main_~x~0_8)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_2 4294967295)) 4294967296))))))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_9, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {1587#(and (= main_~n~0 main_~x~0) (= main_~z~0 main_~y~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:42:31,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {1587#(and (= main_~n~0 main_~x~0) (= main_~z~0 main_~y~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1587#(and (= main_~n~0 main_~x~0) (= main_~z~0 main_~y~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:42:31,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {1587#(and (= main_~n~0 main_~x~0) (= main_~z~0 main_~y~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1558#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 16:42:31,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {1558#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [93] L35-1-->L35-1: Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= v_main_~x~0_7 v_main_~x~0_6)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= v_main_~z~0_4 (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~z~0_5))))) InVars {main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post11, main_#t~post12] {1600#(and (= main_~z~0 0) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-27 16:42:31,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {1600#(and (= main_~z~0 0) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1600#(and (= main_~z~0 0) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-27 16:42:31,418 INFO L272 TraceCheckUtils]: 13: Hoare triple {1600#(and (= main_~z~0 0) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1607#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:42:31,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {1607#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1611#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:42:31,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {1611#(<= 1 __VERIFIER_assert_~cond)} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1552#false} is VALID [2022-04-27 16:42:31,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {1552#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1552#false} is VALID [2022-04-27 16:42:31,419 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:42:31,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:42:44,873 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~z~0_42_31 Int)) (or (>= aux_mod_v_main_~z~0_42_31 4294967296) (> 0 aux_mod_v_main_~z~0_42_31) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse0 (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~z~0_42_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~z~0_42_31 Int)) (not (= (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)) c_main_~z~0))) .cse1)))) (or (forall ((v_main_~z~0_43 Int)) (or (exists ((v_it_2 Int)) (and (<= (+ v_main_~z~0_43 v_it_2 1) c_main_~z~0) (<= 1 v_it_2) (not (< 0 (mod (+ (* v_it_2 4294967295) c_main_~z~0) 4294967296))))) (let ((.cse2 (< 0 (mod (+ (* v_main_~z~0_43 4294967295) c_main_~x~0 c_main_~z~0) 4294967296)))) (and (or (not .cse2) (forall ((aux_div_v_main_~z~0_42_31 Int)) (or (not (< v_main_~z~0_43 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (exists ((v_it_4 Int)) (and (<= (+ v_main_~z~0_43 v_it_4 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (<= 1 v_it_4) (not (< 0 (mod (+ (* v_it_4 4294967295) (* v_main_~z~0_43 4294967295) c_main_~x~0 c_main_~z~0) 4294967296)))))))) (or (forall ((aux_div_v_main_~z~0_42_31 Int)) (not (= v_main_~z~0_43 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))))) .cse2))) (not (< v_main_~z~0_43 c_main_~z~0)))) (not .cse0)))) (= aux_mod_v_main_~z~0_42_31 (mod (* 2 c_main_~n~0) 4294967296)))) (< 0 (mod c_main_~y~0 4294967296))) is different from true [2022-04-27 16:42:45,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {1552#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1552#false} is VALID [2022-04-27 16:42:45,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {1611#(<= 1 __VERIFIER_assert_~cond)} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1552#false} is VALID [2022-04-27 16:42:45,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {1607#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1611#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:42:45,795 INFO L272 TraceCheckUtils]: 13: Hoare triple {1627#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1607#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:42:45,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {1627#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1627#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} is VALID [2022-04-27 16:42:47,817 WARN L290 TraceCheckUtils]: 11: Hoare triple {1634#(forall ((aux_mod_v_main_~z~0_42_31 Int) (aux_div_v_main_~z~0_42_31 Int)) (or (= aux_mod_v_main_~z~0_42_31 (mod (* main_~n~0 2) 4294967296)) (>= aux_mod_v_main_~z~0_42_31 4294967296) (> 0 aux_mod_v_main_~z~0_42_31) (and (or (not (< main_~z~0 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (not (< 0 (mod main_~x~0 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= (+ v_it_4 main_~z~0 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (<= 1 v_it_4)))) (or (not (= (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)) main_~z~0)) (< 0 (mod main_~x~0 4294967296))))))} [93] L35-1-->L35-1: Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= v_main_~x~0_7 v_main_~x~0_6)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= v_main_~z~0_4 (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~z~0_5))))) InVars {main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post11, main_#t~post12] {1627#(= (mod main_~z~0 4294967296) (mod (* main_~n~0 2) 4294967296))} is UNKNOWN [2022-04-27 16:42:47,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {1638#(or (forall ((aux_mod_v_main_~z~0_42_31 Int) (aux_div_v_main_~z~0_42_31 Int)) (or (= aux_mod_v_main_~z~0_42_31 (mod (* main_~n~0 2) 4294967296)) (>= aux_mod_v_main_~z~0_42_31 4294967296) (> 0 aux_mod_v_main_~z~0_42_31) (and (or (not (< main_~z~0 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (not (< 0 (mod main_~x~0 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= (+ v_it_4 main_~z~0 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (<= 1 v_it_4)))) (or (not (= (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)) main_~z~0)) (< 0 (mod main_~x~0 4294967296)))))) (< 0 (mod main_~y~0 4294967296)))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1634#(forall ((aux_mod_v_main_~z~0_42_31 Int) (aux_div_v_main_~z~0_42_31 Int)) (or (= aux_mod_v_main_~z~0_42_31 (mod (* main_~n~0 2) 4294967296)) (>= aux_mod_v_main_~z~0_42_31 4294967296) (> 0 aux_mod_v_main_~z~0_42_31) (and (or (not (< main_~z~0 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (not (< 0 (mod main_~x~0 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= (+ v_it_4 main_~z~0 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (<= 1 v_it_4)))) (or (not (= (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)) main_~z~0)) (< 0 (mod main_~x~0 4294967296))))))} is VALID [2022-04-27 16:42:49,836 WARN L290 TraceCheckUtils]: 9: Hoare triple {1638#(or (forall ((aux_mod_v_main_~z~0_42_31 Int) (aux_div_v_main_~z~0_42_31 Int)) (or (= aux_mod_v_main_~z~0_42_31 (mod (* main_~n~0 2) 4294967296)) (>= aux_mod_v_main_~z~0_42_31 4294967296) (> 0 aux_mod_v_main_~z~0_42_31) (and (or (not (< main_~z~0 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (not (< 0 (mod main_~x~0 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= (+ v_it_4 main_~z~0 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (<= 1 v_it_4)))) (or (not (= (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)) main_~z~0)) (< 0 (mod main_~x~0 4294967296)))))) (< 0 (mod main_~y~0 4294967296)))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1638#(or (forall ((aux_mod_v_main_~z~0_42_31 Int) (aux_div_v_main_~z~0_42_31 Int)) (or (= aux_mod_v_main_~z~0_42_31 (mod (* main_~n~0 2) 4294967296)) (>= aux_mod_v_main_~z~0_42_31 4294967296) (> 0 aux_mod_v_main_~z~0_42_31) (and (or (not (< main_~z~0 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (not (< 0 (mod main_~x~0 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= (+ v_it_4 main_~z~0 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (<= 1 v_it_4)))) (or (not (= (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)) main_~z~0)) (< 0 (mod main_~x~0 4294967296)))))) (< 0 (mod main_~y~0 4294967296)))} is UNKNOWN [2022-04-27 16:42:51,846 WARN L290 TraceCheckUtils]: 8: Hoare triple {1645#(or (forall ((aux_mod_v_main_~z~0_42_31 Int)) (or (= aux_mod_v_main_~z~0_42_31 (mod (* main_~n~0 2) 4294967296)) (>= aux_mod_v_main_~z~0_42_31 4294967296) (and (or (not (< 0 (mod main_~z~0 4294967296))) (forall ((v_main_~z~0_43 Int)) (or (not (< v_main_~z~0_43 main_~z~0)) (exists ((v_it_2 Int)) (and (not (< 0 (mod (+ main_~z~0 (* v_it_2 4294967295)) 4294967296))) (<= 1 v_it_2) (<= (+ v_main_~z~0_43 v_it_2 1) main_~z~0))) (and (or (not (< 0 (mod (+ main_~z~0 main_~x~0 (* v_main_~z~0_43 4294967295)) 4294967296))) (forall ((aux_div_v_main_~z~0_42_31 Int)) (or (not (< v_main_~z~0_43 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~z~0 main_~x~0 (* v_main_~z~0_43 4294967295)) 4294967296))) (<= (+ v_main_~z~0_43 v_it_4 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~z~0_42_31 Int)) (not (= v_main_~z~0_43 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))))) (< 0 (mod (+ main_~z~0 main_~x~0 (* v_main_~z~0_43 4294967295)) 4294967296))))))) (or (< 0 (mod main_~z~0 4294967296)) (and (or (forall ((aux_div_v_main_~z~0_42_31 Int)) (or (not (< main_~z~0 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= (+ v_it_4 main_~z~0 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (<= 1 v_it_4))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~z~0_42_31 Int)) (not (= (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)) main_~z~0))) (< 0 (mod main_~x~0 4294967296)))))) (> 0 aux_mod_v_main_~z~0_42_31))) (< 0 (mod main_~y~0 4294967296)))} [87] L23-2-->L23-2: Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (= v_main_~z~0_9 (+ (* (- 1) v_main_~x~0_8) v_main_~z~0_10 v_main_~x~0_9)) (< v_main_~x~0_9 v_main_~x~0_8) (< 0 .cse0) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~x~0_9 v_it_2 1) v_main_~x~0_8)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_2 4294967295)) 4294967296))))))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_9, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {1638#(or (forall ((aux_mod_v_main_~z~0_42_31 Int) (aux_div_v_main_~z~0_42_31 Int)) (or (= aux_mod_v_main_~z~0_42_31 (mod (* main_~n~0 2) 4294967296)) (>= aux_mod_v_main_~z~0_42_31 4294967296) (> 0 aux_mod_v_main_~z~0_42_31) (and (or (not (< main_~z~0 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (not (< 0 (mod main_~x~0 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= (+ v_it_4 main_~z~0 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (<= 1 v_it_4)))) (or (not (= (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)) main_~z~0)) (< 0 (mod main_~x~0 4294967296)))))) (< 0 (mod main_~y~0 4294967296)))} is UNKNOWN [2022-04-27 16:42:53,858 WARN L290 TraceCheckUtils]: 7: Hoare triple {1649#(or (forall ((aux_mod_v_main_~z~0_42_31 Int)) (or (= aux_mod_v_main_~z~0_42_31 (mod (* main_~n~0 2) 4294967296)) (>= aux_mod_v_main_~z~0_42_31 4294967296) (> 0 aux_mod_v_main_~z~0_42_31) (and (or (forall ((aux_div_v_main_~z~0_42_31 Int)) (or (not (< main_~y~0 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 main_~y~0 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_4))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (< 0 (mod main_~x~0 4294967296)) (forall ((aux_div_v_main_~z~0_42_31 Int)) (not (= (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)) main_~y~0))))))) (< 0 (mod main_~y~0 4294967296)))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {1645#(or (forall ((aux_mod_v_main_~z~0_42_31 Int)) (or (= aux_mod_v_main_~z~0_42_31 (mod (* main_~n~0 2) 4294967296)) (>= aux_mod_v_main_~z~0_42_31 4294967296) (and (or (not (< 0 (mod main_~z~0 4294967296))) (forall ((v_main_~z~0_43 Int)) (or (not (< v_main_~z~0_43 main_~z~0)) (exists ((v_it_2 Int)) (and (not (< 0 (mod (+ main_~z~0 (* v_it_2 4294967295)) 4294967296))) (<= 1 v_it_2) (<= (+ v_main_~z~0_43 v_it_2 1) main_~z~0))) (and (or (not (< 0 (mod (+ main_~z~0 main_~x~0 (* v_main_~z~0_43 4294967295)) 4294967296))) (forall ((aux_div_v_main_~z~0_42_31 Int)) (or (not (< v_main_~z~0_43 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~z~0 main_~x~0 (* v_main_~z~0_43 4294967295)) 4294967296))) (<= (+ v_main_~z~0_43 v_it_4 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~z~0_42_31 Int)) (not (= v_main_~z~0_43 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))))) (< 0 (mod (+ main_~z~0 main_~x~0 (* v_main_~z~0_43 4294967295)) 4294967296))))))) (or (< 0 (mod main_~z~0 4294967296)) (and (or (forall ((aux_div_v_main_~z~0_42_31 Int)) (or (not (< main_~z~0 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= (+ v_it_4 main_~z~0 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (<= 1 v_it_4))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~z~0_42_31 Int)) (not (= (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)) main_~z~0))) (< 0 (mod main_~x~0 4294967296)))))) (> 0 aux_mod_v_main_~z~0_42_31))) (< 0 (mod main_~y~0 4294967296)))} is UNKNOWN [2022-04-27 16:42:53,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {1653#(or (<= (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 1) (mod (* main_~n~0 2) 4294967296) (* (- 1) main_~y~0)) (- 4294967296))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod main_~y~0 4294967296)))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1649#(or (forall ((aux_mod_v_main_~z~0_42_31 Int)) (or (= aux_mod_v_main_~z~0_42_31 (mod (* main_~n~0 2) 4294967296)) (>= aux_mod_v_main_~z~0_42_31 4294967296) (> 0 aux_mod_v_main_~z~0_42_31) (and (or (forall ((aux_div_v_main_~z~0_42_31 Int)) (or (not (< main_~y~0 (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)))) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 main_~y~0 1) (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31))) (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_4))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (< 0 (mod main_~x~0 4294967296)) (forall ((aux_div_v_main_~z~0_42_31 Int)) (not (= (+ aux_mod_v_main_~z~0_42_31 (* 4294967296 aux_div_v_main_~z~0_42_31)) main_~y~0))))))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 16:42:53,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {1551#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1653#(or (<= (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 1) (mod (* main_~n~0 2) 4294967296) (* (- 1) main_~y~0)) (- 4294967296))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 16:42:53,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {1551#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:53,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1551#true} {1551#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:53,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {1551#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:53,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {1551#true} [77] 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) 10) (= (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] {1551#true} is VALID [2022-04-27 16:42:53,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {1551#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#true} is VALID [2022-04-27 16:42:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-04-27 16:42:53,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106592705] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:42:53,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:42:53,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 19 [2022-04-27 16:42:53,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075239871] [2022-04-27 16:42:53,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:42:53,865 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 16:42:53,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:42:53,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:43:03,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 32 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-27 16:43:03,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 16:43:03,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:43:03,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 16:43:03,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=242, Unknown=3, NotChecked=32, Total=342 [2022-04-27 16:43:03,971 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:43:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:43:06,039 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-27 16:43:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 16:43:06,040 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 16:43:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:43:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:43:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2022-04-27 16:43:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:43:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2022-04-27 16:43:06,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 40 transitions. [2022-04-27 16:43:06,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:43:06,079 INFO L225 Difference]: With dead ends: 37 [2022-04-27 16:43:06,079 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 16:43:06,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=115, Invalid=438, Unknown=3, NotChecked=44, Total=600 [2022-04-27 16:43:06,081 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:43:06,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 57 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 66 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2022-04-27 16:43:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 16:43:06,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-04-27 16:43:06,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:43:06,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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:43:06,083 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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:43:06,083 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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:43:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:43:06,085 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-04-27 16:43:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-04-27 16:43:06,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:43:06,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:43:06,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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 34 states. [2022-04-27 16:43:06,085 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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 34 states. [2022-04-27 16:43:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:43:06,086 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-04-27 16:43:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-04-27 16:43:06,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:43:06,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:43:06,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:43:06,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:43:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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:43:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2022-04-27 16:43:06,088 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 17 [2022-04-27 16:43:06,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:43:06,088 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2022-04-27 16:43:06,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:43:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2022-04-27 16:43:06,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:43:06,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:43:06,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:43:06,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 16:43:06,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:43:06,296 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:43:06,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:43:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1157045085, now seen corresponding path program 1 times [2022-04-27 16:43:06,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:43:06,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830499569] [2022-04-27 16:43:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:43:06,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:43:06,304 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-27 16:43:06,305 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:43:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:43:06,321 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-27 16:43:06,325 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:43:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:43:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:43:06,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {1834#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {1822#true} is VALID [2022-04-27 16:43:06,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1822#true} is VALID [2022-04-27 16:43:06,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1822#true} {1822#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1822#true} is VALID [2022-04-27 16:43:06,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1834#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:43:06,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {1834#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] 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) 10) (= (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] {1822#true} is VALID [2022-04-27 16:43:06,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1822#true} is VALID [2022-04-27 16:43:06,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1822#true} is VALID [2022-04-27 16:43:06,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1822#true} is VALID [2022-04-27 16:43:06,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} [79] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1827#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:43:06,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [82] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1828#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:43:06,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [84] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_6) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {1829#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 16:43:06,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {1829#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [87] L23-2-->L23-2: Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (= v_main_~z~0_9 (+ (* (- 1) v_main_~x~0_8) v_main_~z~0_10 v_main_~x~0_9)) (< v_main_~x~0_9 v_main_~x~0_8) (< 0 .cse0) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~x~0_9 v_it_2 1) v_main_~x~0_8)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_2 4294967295)) 4294967296))))))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_9, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {1830#(and (= main_~z~0 0) (<= main_~n~0 (* (div main_~n~0 2147483648) 2147483648)) (= main_~y~0 0))} is VALID [2022-04-27 16:43:06,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {1830#(and (= main_~z~0 0) (<= main_~n~0 (* (div main_~n~0 2147483648) 2147483648)) (= main_~y~0 0))} [86] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1830#(and (= main_~z~0 0) (<= main_~n~0 (* (div main_~n~0 2147483648) 2147483648)) (= main_~y~0 0))} is VALID [2022-04-27 16:43:06,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {1830#(and (= main_~z~0 0) (<= main_~n~0 (* (div main_~n~0 2147483648) 2147483648)) (= main_~y~0 0))} [90] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {1831#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:43:06,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {1831#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [89] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1831#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:43:06,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {1831#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [92] L35-1-->L35-2: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1831#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:43:06,527 INFO L272 TraceCheckUtils]: 13: Hoare triple {1831#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= 0 main_~z~0) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} [94] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~n~0_3 2) 4294967296) (mod v_main_~z~0_11 4294967296)) 1 0)) InVars {main_~z~0=v_main_~z~0_11, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1832#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:43:06,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {1832#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1833#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:43:06,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {1833#(not (= __VERIFIER_assert_~cond 0))} [98] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1823#false} is VALID [2022-04-27 16:43:06,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {1823#false} [100] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1823#false} is VALID [2022-04-27 16:43:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:43:06,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:43:06,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830499569] [2022-04-27 16:43:06,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830499569] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:43:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332742101] [2022-04-27 16:43:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:43:06,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:43:06,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:43:06,532 INFO L229 MonitoredProcess]: Starting monitored process 9 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:43:06,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process