/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 20:06:01,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 20:06:01,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 20:06:01,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 20:06:01,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 20:06:01,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 20:06:01,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 20:06:01,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 20:06:01,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 20:06:01,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 20:06:01,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 20:06:01,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 20:06:01,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 20:06:01,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 20:06:01,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 20:06:01,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 20:06:01,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 20:06:01,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 20:06:01,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 20:06:01,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 20:06:01,646 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 20:06:01,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 20:06:01,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 20:06:01,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 20:06:01,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 20:06:01,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 20:06:01,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 20:06:01,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 20:06:01,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 20:06:01,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 20:06:01,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 20:06:01,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 20:06:01,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 20:06:01,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 20:06:01,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 20:06:01,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 20:06:01,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 20:06:01,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 20:06:01,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 20:06:01,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 20:06:01,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 20:06:01,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 20:06:01,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 20:06:01,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 20:06:01,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 20:06:01,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 20:06:01,677 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 20:06:01,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 20:06:01,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 20:06:01,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 20:06:01,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 20:06:01,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 20:06:01,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 20:06:01,678 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 20:06:01,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 20:06:01,678 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 20:06:01,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 20:06:01,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 20:06:01,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 20:06:01,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 20:06:01,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 20:06:01,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:06:01,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 20:06:01,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 20:06:01,679 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 20:06:01,679 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-14 20:06:01,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 20:06:01,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 20:06:01,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 20:06:01,877 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 20:06:01,878 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 20:06:01,878 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i [2022-04-14 20:06:01,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb193fedd/0b18889047b44c62b739e3d858f93216/FLAGa7f8d05ab [2022-04-14 20:06:02,268 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 20:06:02,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i [2022-04-14 20:06:02,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb193fedd/0b18889047b44c62b739e3d858f93216/FLAGa7f8d05ab [2022-04-14 20:06:02,280 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb193fedd/0b18889047b44c62b739e3d858f93216 [2022-04-14 20:06:02,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 20:06:02,282 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 20:06:02,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 20:06:02,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 20:06:02,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 20:06:02,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:06:02" (1/1) ... [2022-04-14 20:06:02,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e778c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:06:02, skipping insertion in model container [2022-04-14 20:06:02,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:06:02" (1/1) ... [2022-04-14 20:06:02,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 20:06:02,308 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 20:06:02,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i[873,886] [2022-04-14 20:06:02,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:06:02,456 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 20:06:02,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i[873,886] [2022-04-14 20:06:02,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:06:02,475 INFO L208 MainTranslator]: Completed translation [2022-04-14 20:06:02,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:06:02 WrapperNode [2022-04-14 20:06:02,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 20:06:02,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 20:06:02,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 20:06:02,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 20:06:02,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:06:02" (1/1) ... [2022-04-14 20:06:02,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:06:02" (1/1) ... [2022-04-14 20:06:02,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:06:02" (1/1) ... [2022-04-14 20:06:02,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:06:02" (1/1) ... [2022-04-14 20:06:02,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:06:02" (1/1) ... [2022-04-14 20:06:02,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:06:02" (1/1) ... [2022-04-14 20:06:02,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:06:02" (1/1) ... [2022-04-14 20:06:02,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 20:06:02,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 20:06:02,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 20:06:02,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 20:06:02,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:06:02" (1/1) ... [2022-04-14 20:06:02,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:06:02,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:06:02,524 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-14 20:06:02,526 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-14 20:06:02,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 20:06:02,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 20:06:02,554 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 20:06:02,554 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 20:06:02,554 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 20:06:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 20:06:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 20:06:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 20:06:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 20:06:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 20:06:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 20:06:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-14 20:06:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 20:06:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 20:06:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 20:06:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 20:06:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 20:06:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 20:06:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 20:06:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 20:06:02,598 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 20:06:02,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 20:06:02,689 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 20:06:02,694 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 20:06:02,694 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 20:06:02,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:06:02 BoogieIcfgContainer [2022-04-14 20:06:02,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 20:06:02,696 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 20:06:02,696 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 20:06:02,697 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 20:06:02,699 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:06:02" (1/1) ... [2022-04-14 20:06:02,701 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 20:06:03,270 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-14 20:06:03,271 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_2) v_main_~sum~0_1) (< v_main_~i~0_3 v_main_~n~0_2) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~sum~0=v_main_~sum~0_2, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~sum~0=v_main_~sum~0_1, main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~sum~0, main_#t~post4, main_~i~0] to Formula: (let ((.cse1 (* (- 1) v_main_~i~0_3)) (.cse2 (* (- 1) v_main_~i~0_2))) (or (and (not (< v_main_~i~0_3 v_main_~n~0_2)) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~sum~0_2 v_main_~sum~0_1) (= v_main_~i~0_3 v_main_~i~0_2)) (let ((.cse0 (div (+ .cse2 v_main_~i~0_3 1) (- 2)))) (and (= (mod (+ v_main_~i~0_3 v_main_~i~0_2 1) 2) 0) (= (+ .cse0 v_main_~i~0_3 (* (* .cse0 .cse0) 2) (* 2 (* .cse0 v_main_~i~0_3)) v_main_~sum~0_2) v_main_~sum~0_1) (< .cse0 (+ (div (+ (- 1) v_main_~n~0_2 .cse1) 2) 1)) (<= 0 .cse0))) (let ((.cse3 (div (+ .cse2 v_main_~i~0_3) (- 2)))) (and (= (+ (* (* .cse3 .cse3) 2) (* 2 (* v_main_~i~0_3 .cse3)) v_main_~sum~0_2) (+ .cse3 v_main_~sum~0_1)) (< 0 .cse3) (< .cse3 (+ (div (+ (- 2) v_main_~n~0_2 .cse1) 2) 2)) (= (mod (+ v_main_~i~0_3 v_main_~i~0_2) 2) 0))))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post4=|v_main_#t~post4_3|, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_1} AuxVars[] AssignedVars[main_~sum~0, main_#t~post4, main_~i~0] [2022-04-14 20:06:03,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:06:03 BasicIcfg [2022-04-14 20:06:03,275 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 20:06:03,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 20:06:03,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 20:06:03,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 20:06:03,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 08:06:02" (1/4) ... [2022-04-14 20:06:03,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7581fd27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:06:03, skipping insertion in model container [2022-04-14 20:06:03,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:06:02" (2/4) ... [2022-04-14 20:06:03,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7581fd27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:06:03, skipping insertion in model container [2022-04-14 20:06:03,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:06:02" (3/4) ... [2022-04-14 20:06:03,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7581fd27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:06:03, skipping insertion in model container [2022-04-14 20:06:03,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:06:03" (4/4) ... [2022-04-14 20:06:03,280 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark20_conjunctive.iJordan [2022-04-14 20:06:03,283 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 20:06:03,284 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 20:06:03,307 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 20:06:03,311 INFO L340 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 [2022-04-14 20:06:03,312 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 20:06:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-14 20:06:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 20:06:03,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:06:03,325 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:06:03,326 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:06:03,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:06:03,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1809217115, now seen corresponding path program 1 times [2022-04-14 20:06:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:06:03,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520356588] [2022-04-14 20:06:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:06:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:06:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:06:03,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:06:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:06:03,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-14 20:06:03,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:06:03,462 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:06:03,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:06:03,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-14 20:06:03,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:06:03,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:06:03,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:06:03,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [52] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet3_2| v_main_~sum~0_3) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~n~0_3 |v_main_#t~nondet2_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet3, main_~sum~0, main_#t~nondet2, main_~i~0, main_~n~0] {23#true} is VALID [2022-04-14 20:06:03,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [55] L23-->L24-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_6 0) (<= v_main_~n~0_5 100) (= 0 v_main_~sum~0_6)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_6} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:06:03,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [57] L24-2-->L24-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 20:06:03,467 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~sum~0_7) 1 0)) InVars {main_~sum~0=v_main_~sum~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0] {24#false} is VALID [2022-04-14 20:06:03,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-14 20:06:03,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 20:06:03,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 20:06:03,469 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-14 20:06:03,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:06:03,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520356588] [2022-04-14 20:06:03,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520356588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:06:03,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:06:03,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 20:06:03,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073149500] [2022-04-14 20:06:03,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:06:03,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-14 20:06:03,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:06:03,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:06:03,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:06:03,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 20:06:03,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:06:03,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 20:06:03,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:06:03,525 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:06:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:06:03,570 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-14 20:06:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 20:06:03,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-14 20:06:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:06:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:06:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 20:06:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:06:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 20:06:03,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-14 20:06:03,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:06:03,611 INFO L225 Difference]: With dead ends: 20 [2022-04-14 20:06:03,611 INFO L226 Difference]: Without dead ends: 13 [2022-04-14 20:06:03,612 INFO L912 BasicCegarLoop]: 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-14 20:06:03,616 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:06:03,617 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:06:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-14 20:06:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-14 20:06:03,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:06:03,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-14 20:06:03,637 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-14 20:06:03,637 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-14 20:06:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:06:03,641 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-14 20:06:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 20:06:03,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:06:03,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:06:03,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-14 20:06:03,642 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-14 20:06:03,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:06:03,647 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-14 20:06:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 20:06:03,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:06:03,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:06:03,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:06:03,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:06:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-14 20:06:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-14 20:06:03,650 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-14 20:06:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:06:03,651 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-14 20:06:03,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:06:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 20:06:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 20:06:03,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:06:03,661 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:06:03,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 20:06:03,662 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:06:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:06:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1810140636, now seen corresponding path program 1 times [2022-04-14 20:06:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:06:03,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251114625] [2022-04-14 20:06:03,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:06:03,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:06:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:06:03,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:06:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:06:03,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {98#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {90#true} is VALID [2022-04-14 20:06:03,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:06:03,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:06:03,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:06:03,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {98#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {90#true} is VALID [2022-04-14 20:06:03,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:06:03,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:06:03,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:06:03,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} [52] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet3_2| v_main_~sum~0_3) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~n~0_3 |v_main_#t~nondet2_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet3, main_~sum~0, main_#t~nondet2, main_~i~0, main_~n~0] {90#true} is VALID [2022-04-14 20:06:03,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} [55] L23-->L24-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_6 0) (<= v_main_~n~0_5 100) (= 0 v_main_~sum~0_6)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_6} AuxVars[] AssignedVars[] {95#(<= 0 main_~sum~0)} is VALID [2022-04-14 20:06:03,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {95#(<= 0 main_~sum~0)} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {95#(<= 0 main_~sum~0)} is VALID [2022-04-14 20:06:03,773 INFO L272 TraceCheckUtils]: 8: Hoare triple {95#(<= 0 main_~sum~0)} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~sum~0_7) 1 0)) InVars {main_~sum~0=v_main_~sum~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0] {96#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:06:03,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {96#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {97#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 20:06:03,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {97#(not (= __VERIFIER_assert_~cond 0))} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-14 20:06:03,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {91#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-14 20:06:03,774 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-14 20:06:03,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:06:03,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251114625] [2022-04-14 20:06:03,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251114625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:06:03,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:06:03,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 20:06:03,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124487316] [2022-04-14 20:06:03,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:06:03,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-14 20:06:03,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:06:03,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 20:06:03,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:06:03,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:06:03,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:06:03,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:06:03,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 20:06:03,817 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 20:06:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:06:03,915 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-14 20:06:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:06:03,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-14 20:06:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:06:03,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 20:06:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-14 20:06:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 20:06:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-14 20:06:03,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-14 20:06:03,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:06:03,941 INFO L225 Difference]: With dead ends: 17 [2022-04-14 20:06:03,941 INFO L226 Difference]: Without dead ends: 14 [2022-04-14 20:06:03,943 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-14 20:06:03,945 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:06:03,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 28 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:06:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-14 20:06:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-14 20:06:03,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:06:03,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-14 20:06:03,950 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-14 20:06:03,950 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-14 20:06:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:06:03,951 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 20:06:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 20:06:03,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:06:03,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:06:03,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-14 20:06:03,953 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-14 20:06:03,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:06:03,957 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 20:06:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 20:06:03,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:06:03,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:06:03,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:06:03,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:06:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-14 20:06:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-14 20:06:03,959 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-14 20:06:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:06:03,959 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-14 20:06:03,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 20:06:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 20:06:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-14 20:06:03,960 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:06:03,960 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:06:03,960 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 20:06:03,960 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:06:03,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:06:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash 306506437, now seen corresponding path program 1 times [2022-04-14 20:06:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:06:03,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601016891] [2022-04-14 20:06:03,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:06:03,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:06:03,985 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:06:03,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068551454] [2022-04-14 20:06:03,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:06:03,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:06:03,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:06:03,987 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-14 20:06:03,990 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-14 20:06:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:06:04,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 20:06:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:06:04,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:08:05,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:05,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#true} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {166#true} is VALID [2022-04-14 20:08:05,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:05,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166#true} {166#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:05,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {166#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:05,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} [52] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet3_2| v_main_~sum~0_3) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~n~0_3 |v_main_#t~nondet2_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet3, main_~sum~0, main_#t~nondet2, main_~i~0, main_~n~0] {166#true} is VALID [2022-04-14 20:08:05,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#true} [55] L23-->L24-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_6 0) (<= v_main_~n~0_5 100) (= 0 v_main_~sum~0_6)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_6} AuxVars[] AssignedVars[] {189#(and (= main_~i~0 0) (<= 0 main_~sum~0))} is VALID [2022-04-14 20:08:05,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {189#(and (= main_~i~0 0) (<= 0 main_~sum~0))} [59] L24-2-->L24-2: Formula: (let ((.cse1 (* (- 1) v_main_~i~0_3)) (.cse2 (* (- 1) v_main_~i~0_2))) (or (and (not (< v_main_~i~0_3 v_main_~n~0_2)) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~sum~0_2 v_main_~sum~0_1) (= v_main_~i~0_3 v_main_~i~0_2)) (let ((.cse0 (div (+ .cse2 v_main_~i~0_3 1) (- 2)))) (and (= (mod (+ v_main_~i~0_3 v_main_~i~0_2 1) 2) 0) (= (+ .cse0 v_main_~i~0_3 (* (* .cse0 .cse0) 2) (* 2 (* .cse0 v_main_~i~0_3)) v_main_~sum~0_2) v_main_~sum~0_1) (< .cse0 (+ (div (+ (- 1) v_main_~n~0_2 .cse1) 2) 1)) (<= 0 .cse0))) (let ((.cse3 (div (+ .cse2 v_main_~i~0_3) (- 2)))) (and (= (+ (* (* .cse3 .cse3) 2) (* 2 (* v_main_~i~0_3 .cse3)) v_main_~sum~0_2) (+ .cse3 v_main_~sum~0_1)) (< 0 .cse3) (< .cse3 (+ (div (+ (- 2) v_main_~n~0_2 .cse1) 2) 2)) (= (mod (+ v_main_~i~0_3 v_main_~i~0_2) 2) 0))))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post4=|v_main_#t~post4_3|, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_1} AuxVars[] AssignedVars[main_~sum~0, main_#t~post4, main_~i~0] {193#(<= 0 main_~sum~0)} is VALID [2022-04-14 20:08:05,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(<= 0 main_~sum~0)} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {193#(<= 0 main_~sum~0)} is VALID [2022-04-14 20:08:05,940 INFO L272 TraceCheckUtils]: 9: Hoare triple {193#(<= 0 main_~sum~0)} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~sum~0_7) 1 0)) InVars {main_~sum~0=v_main_~sum~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0] {200#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:08:05,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {200#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {204#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:05,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {167#false} is VALID [2022-04-14 20:08:05,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#false} is VALID [2022-04-14 20:08:05,941 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-14 20:08:05,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:10:56,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#false} is VALID [2022-04-14 20:10:56,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {167#false} is VALID [2022-04-14 20:10:56,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {200#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {204#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:10:56,555 INFO L272 TraceCheckUtils]: 9: Hoare triple {193#(<= 0 main_~sum~0)} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~sum~0_7) 1 0)) InVars {main_~sum~0=v_main_~sum~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0] {200#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:10:56,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(<= 0 main_~sum~0)} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {193#(<= 0 main_~sum~0)} is VALID [2022-04-14 20:10:56,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#(and (forall ((aux_div_v_main_~i~0_8_51 Int)) (or (< aux_div_v_main_~i~0_8_51 0) (<= 0 (+ main_~sum~0 main_~i~0 (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) aux_div_v_main_~i~0_8_51 (* 2 (* main_~i~0 aux_div_v_main_~i~0_8_51)))))) (forall ((aux_div_aux_mod_v_main_~i~0_8_49_32 Int) (aux_div_v_main_~i~0_8_49 Int)) (or (<= aux_div_v_main_~i~0_8_49 0) (< (* aux_div_aux_mod_v_main_~i~0_8_49_32 2) 0) (<= (+ (* 2 (* aux_div_aux_mod_v_main_~i~0_8_49_32 main_~i~0)) aux_div_v_main_~i~0_8_49 (* 4 (* aux_div_aux_mod_v_main_~i~0_8_49_32 aux_div_v_main_~i~0_8_49))) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_aux_mod_v_main_~i~0_8_49_32 main_~sum~0 (* 2 (* main_~i~0 aux_div_v_main_~i~0_8_49)) (* 2 (* aux_div_aux_mod_v_main_~i~0_8_49_32 aux_div_aux_mod_v_main_~i~0_8_49_32)))) (<= 2 (* aux_div_aux_mod_v_main_~i~0_8_49_32 2)))) (<= 0 main_~sum~0))} [59] L24-2-->L24-2: Formula: (let ((.cse1 (* (- 1) v_main_~i~0_3)) (.cse2 (* (- 1) v_main_~i~0_2))) (or (and (not (< v_main_~i~0_3 v_main_~n~0_2)) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~sum~0_2 v_main_~sum~0_1) (= v_main_~i~0_3 v_main_~i~0_2)) (let ((.cse0 (div (+ .cse2 v_main_~i~0_3 1) (- 2)))) (and (= (mod (+ v_main_~i~0_3 v_main_~i~0_2 1) 2) 0) (= (+ .cse0 v_main_~i~0_3 (* (* .cse0 .cse0) 2) (* 2 (* .cse0 v_main_~i~0_3)) v_main_~sum~0_2) v_main_~sum~0_1) (< .cse0 (+ (div (+ (- 1) v_main_~n~0_2 .cse1) 2) 1)) (<= 0 .cse0))) (let ((.cse3 (div (+ .cse2 v_main_~i~0_3) (- 2)))) (and (= (+ (* (* .cse3 .cse3) 2) (* 2 (* v_main_~i~0_3 .cse3)) v_main_~sum~0_2) (+ .cse3 v_main_~sum~0_1)) (< 0 .cse3) (< .cse3 (+ (div (+ (- 2) v_main_~n~0_2 .cse1) 2) 2)) (= (mod (+ v_main_~i~0_3 v_main_~i~0_2) 2) 0))))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post4=|v_main_#t~post4_3|, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_1} AuxVars[] AssignedVars[main_~sum~0, main_#t~post4, main_~i~0] {193#(<= 0 main_~sum~0)} is VALID [2022-04-14 20:10:56,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#true} [55] L23-->L24-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_6 0) (<= v_main_~n~0_5 100) (= 0 v_main_~sum~0_6)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_6} AuxVars[] AssignedVars[] {226#(and (forall ((aux_div_v_main_~i~0_8_51 Int)) (or (< aux_div_v_main_~i~0_8_51 0) (<= 0 (+ main_~sum~0 main_~i~0 (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) aux_div_v_main_~i~0_8_51 (* 2 (* main_~i~0 aux_div_v_main_~i~0_8_51)))))) (forall ((aux_div_aux_mod_v_main_~i~0_8_49_32 Int) (aux_div_v_main_~i~0_8_49 Int)) (or (<= aux_div_v_main_~i~0_8_49 0) (< (* aux_div_aux_mod_v_main_~i~0_8_49_32 2) 0) (<= (+ (* 2 (* aux_div_aux_mod_v_main_~i~0_8_49_32 main_~i~0)) aux_div_v_main_~i~0_8_49 (* 4 (* aux_div_aux_mod_v_main_~i~0_8_49_32 aux_div_v_main_~i~0_8_49))) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_aux_mod_v_main_~i~0_8_49_32 main_~sum~0 (* 2 (* main_~i~0 aux_div_v_main_~i~0_8_49)) (* 2 (* aux_div_aux_mod_v_main_~i~0_8_49_32 aux_div_aux_mod_v_main_~i~0_8_49_32)))) (<= 2 (* aux_div_aux_mod_v_main_~i~0_8_49_32 2)))) (<= 0 main_~sum~0))} is VALID [2022-04-14 20:10:56,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} [52] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet3_2| v_main_~sum~0_3) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~n~0_3 |v_main_#t~nondet2_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet3, main_~sum~0, main_#t~nondet2, main_~i~0, main_~n~0] {166#true} is VALID [2022-04-14 20:10:56,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {166#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:10:56,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166#true} {166#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:10:56,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:10:56,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#true} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {166#true} is VALID [2022-04-14 20:10:56,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:10:56,624 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-14 20:10:56,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:10:56,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601016891] [2022-04-14 20:10:56,624 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:10:56,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068551454] [2022-04-14 20:10:56,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068551454] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:10:56,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:10:56,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-14 20:10:56,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139296452] [2022-04-14 20:10:56,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 20:10:56,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 13 [2022-04-14 20:10:56,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:10:56,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-14 20:10:56,651 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-14 20:10:56,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 20:10:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:10:56,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 20:10:56,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-14 20:10:56,652 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-14 20:10:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:10:56,704 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-14 20:10:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:10:56,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 13 [2022-04-14 20:10:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:10:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-14 20:10:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-04-14 20:10:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-14 20:10:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-04-14 20:10:56,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 19 transitions. [2022-04-14 20:10:56,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:10:56,727 INFO L225 Difference]: With dead ends: 18 [2022-04-14 20:10:56,727 INFO L226 Difference]: Without dead ends: 15 [2022-04-14 20:10:56,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-14 20:10:56,727 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:10:56,728 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2022-04-14 20:10:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-14 20:10:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-14 20:10:56,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:10:56,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:10:56,729 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:10:56,729 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:10:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:10:56,730 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-14 20:10:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-14 20:10:56,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:10:56,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:10:56,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-14 20:10:56,731 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-14 20:10:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:10:56,731 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-14 20:10:56,731 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-14 20:10:56,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:10:56,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:10:56,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:10:56,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:10:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:10:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-14 20:10:56,732 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-14 20:10:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:10:56,732 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-14 20:10:56,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-14 20:10:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-14 20:10:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-14 20:10:56,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:10:56,733 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:10:56,749 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-14 20:10:56,935 WARN L460 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-14 20:10:56,935 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:10:56,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:10:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash 938486524, now seen corresponding path program 2 times [2022-04-14 20:10:56,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:10:56,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733825576] [2022-04-14 20:10:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:10:56,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:10:56,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:10:56,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1822600822] [2022-04-14 20:10:56,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 20:10:56,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:10:56,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:10:56,959 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-14 20:10:56,960 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-14 20:10:57,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 20:10:57,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 20:10:57,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-14 20:10:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:10:57,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:13:15,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {315#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#true} is VALID [2022-04-14 20:13:15,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {315#true} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {315#true} is VALID [2022-04-14 20:13:15,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#true} is VALID [2022-04-14 20:13:15,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#true} {315#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#true} is VALID [2022-04-14 20:13:15,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#true} is VALID [2022-04-14 20:13:15,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#true} [52] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet3_2| v_main_~sum~0_3) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~n~0_3 |v_main_#t~nondet2_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet3, main_~sum~0, main_#t~nondet2, main_~i~0, main_~n~0] {315#true} is VALID [2022-04-14 20:13:15,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {315#true} [55] L23-->L24-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_6 0) (<= v_main_~n~0_5 100) (= 0 v_main_~sum~0_6)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_6} AuxVars[] AssignedVars[] {338#(and (= main_~i~0 0) (<= 0 main_~sum~0))} is VALID [2022-04-14 20:13:15,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {338#(and (= main_~i~0 0) (<= 0 main_~sum~0))} [59] L24-2-->L24-2: Formula: (let ((.cse1 (* (- 1) v_main_~i~0_3)) (.cse2 (* (- 1) v_main_~i~0_2))) (or (and (not (< v_main_~i~0_3 v_main_~n~0_2)) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~sum~0_2 v_main_~sum~0_1) (= v_main_~i~0_3 v_main_~i~0_2)) (let ((.cse0 (div (+ .cse2 v_main_~i~0_3 1) (- 2)))) (and (= (mod (+ v_main_~i~0_3 v_main_~i~0_2 1) 2) 0) (= (+ .cse0 v_main_~i~0_3 (* (* .cse0 .cse0) 2) (* 2 (* .cse0 v_main_~i~0_3)) v_main_~sum~0_2) v_main_~sum~0_1) (< .cse0 (+ (div (+ (- 1) v_main_~n~0_2 .cse1) 2) 1)) (<= 0 .cse0))) (let ((.cse3 (div (+ .cse2 v_main_~i~0_3) (- 2)))) (and (= (+ (* (* .cse3 .cse3) 2) (* 2 (* v_main_~i~0_3 .cse3)) v_main_~sum~0_2) (+ .cse3 v_main_~sum~0_1)) (< 0 .cse3) (< .cse3 (+ (div (+ (- 2) v_main_~n~0_2 .cse1) 2) 2)) (= (mod (+ v_main_~i~0_3 v_main_~i~0_2) 2) 0))))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post4=|v_main_#t~post4_3|, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_1} AuxVars[] AssignedVars[main_~sum~0, main_#t~post4, main_~i~0] {342#(or (and (< 0 (div (* (- 1) main_~i~0) (- 2))) (<= (* (* (div (* (- 1) main_~i~0) (- 2)) (div (* (- 1) main_~i~0) (- 2))) 2) (+ main_~sum~0 (div (* (- 1) main_~i~0) (- 2)))) (< (div (* (- 1) main_~i~0) (- 2)) (+ (div (+ (- 2) main_~n~0) 2) 2))) (and (<= 0 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (< (div (+ (* (- 1) main_~i~0) 1) (- 2)) (+ (div (+ (- 1) main_~n~0) 2) 1)) (<= (+ (div (+ (* (- 1) main_~i~0) 1) (- 2)) (* 2 (* (div (+ (* (- 1) main_~i~0) 1) (- 2)) (div (+ (* (- 1) main_~i~0) 1) (- 2))))) main_~sum~0) (= (mod (+ main_~i~0 1) 2) 0)) (and (not (< 0 main_~n~0)) (= main_~i~0 0) (<= 0 main_~sum~0)))} is VALID [2022-04-14 20:13:15,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#(or (and (< 0 (div (* (- 1) main_~i~0) (- 2))) (<= (* (* (div (* (- 1) main_~i~0) (- 2)) (div (* (- 1) main_~i~0) (- 2))) 2) (+ main_~sum~0 (div (* (- 1) main_~i~0) (- 2)))) (< (div (* (- 1) main_~i~0) (- 2)) (+ (div (+ (- 2) main_~n~0) 2) 2))) (and (<= 0 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (< (div (+ (* (- 1) main_~i~0) 1) (- 2)) (+ (div (+ (- 1) main_~n~0) 2) 1)) (<= (+ (div (+ (* (- 1) main_~i~0) 1) (- 2)) (* 2 (* (div (+ (* (- 1) main_~i~0) 1) (- 2)) (div (+ (* (- 1) main_~i~0) 1) (- 2))))) main_~sum~0) (= (mod (+ main_~i~0 1) 2) 0)) (and (not (< 0 main_~n~0)) (= main_~i~0 0) (<= 0 main_~sum~0)))} [59] L24-2-->L24-2: Formula: (let ((.cse1 (* (- 1) v_main_~i~0_3)) (.cse2 (* (- 1) v_main_~i~0_2))) (or (and (not (< v_main_~i~0_3 v_main_~n~0_2)) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~sum~0_2 v_main_~sum~0_1) (= v_main_~i~0_3 v_main_~i~0_2)) (let ((.cse0 (div (+ .cse2 v_main_~i~0_3 1) (- 2)))) (and (= (mod (+ v_main_~i~0_3 v_main_~i~0_2 1) 2) 0) (= (+ .cse0 v_main_~i~0_3 (* (* .cse0 .cse0) 2) (* 2 (* .cse0 v_main_~i~0_3)) v_main_~sum~0_2) v_main_~sum~0_1) (< .cse0 (+ (div (+ (- 1) v_main_~n~0_2 .cse1) 2) 1)) (<= 0 .cse0))) (let ((.cse3 (div (+ .cse2 v_main_~i~0_3) (- 2)))) (and (= (+ (* (* .cse3 .cse3) 2) (* 2 (* v_main_~i~0_3 .cse3)) v_main_~sum~0_2) (+ .cse3 v_main_~sum~0_1)) (< 0 .cse3) (< .cse3 (+ (div (+ (- 2) v_main_~n~0_2 .cse1) 2) 2)) (= (mod (+ v_main_~i~0_3 v_main_~i~0_2) 2) 0))))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post4=|v_main_#t~post4_3|, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_1} AuxVars[] AssignedVars[main_~sum~0, main_#t~post4, main_~i~0] {346#(<= 0 main_~sum~0)} is VALID [2022-04-14 20:13:15,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {346#(<= 0 main_~sum~0)} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {346#(<= 0 main_~sum~0)} is VALID [2022-04-14 20:13:15,091 INFO L272 TraceCheckUtils]: 10: Hoare triple {346#(<= 0 main_~sum~0)} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~sum~0_7) 1 0)) InVars {main_~sum~0=v_main_~sum~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0] {353#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:13:15,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {353#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {357#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:13:15,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {357#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {316#false} is VALID [2022-04-14 20:13:15,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {316#false} is VALID [2022-04-14 20:13:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:13:15,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:14:35,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {316#false} is VALID [2022-04-14 20:14:35,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {357#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {316#false} is VALID [2022-04-14 20:14:35,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {353#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {357#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:14:35,241 INFO L272 TraceCheckUtils]: 10: Hoare triple {346#(<= 0 main_~sum~0)} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~sum~0_7) 1 0)) InVars {main_~sum~0=v_main_~sum~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0] {353#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:14:35,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {346#(<= 0 main_~sum~0)} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {346#(<= 0 main_~sum~0)} is VALID [2022-04-14 20:14:35,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {379#(and (or (< main_~i~0 main_~n~0) (<= 0 main_~sum~0)) (forall ((aux_div_aux_mod_v_main_~i~0_11_50_77 Int)) (or (<= aux_div_aux_mod_v_main_~i~0_11_50_77 (+ (* (* main_~i~0 aux_div_aux_mod_v_main_~i~0_11_50_77) 2) main_~sum~0 (* (* aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_aux_mod_v_main_~i~0_11_50_77) 2))) (<= (+ (div (+ (* (- 1) main_~i~0) (- 2) main_~n~0) 2) 2) aux_div_aux_mod_v_main_~i~0_11_50_77) (<= aux_div_aux_mod_v_main_~i~0_11_50_77 0))) (forall ((aux_div_v_main_~i~0_11_38 Int)) (or (< aux_div_v_main_~i~0_11_38 (+ main_~i~0 1)) (<= (+ main_~i~0 2 (div (+ (- 1) (* (- 1) main_~i~0) main_~n~0) 2)) aux_div_v_main_~i~0_11_38) (<= (+ (* 3 aux_div_v_main_~i~0_11_38) (* 2 (* main_~i~0 aux_div_v_main_~i~0_11_38))) (+ (* (* aux_div_v_main_~i~0_11_38 aux_div_v_main_~i~0_11_38) 2) main_~sum~0 (* main_~i~0 2) 1)))))} [59] L24-2-->L24-2: Formula: (let ((.cse1 (* (- 1) v_main_~i~0_3)) (.cse2 (* (- 1) v_main_~i~0_2))) (or (and (not (< v_main_~i~0_3 v_main_~n~0_2)) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~sum~0_2 v_main_~sum~0_1) (= v_main_~i~0_3 v_main_~i~0_2)) (let ((.cse0 (div (+ .cse2 v_main_~i~0_3 1) (- 2)))) (and (= (mod (+ v_main_~i~0_3 v_main_~i~0_2 1) 2) 0) (= (+ .cse0 v_main_~i~0_3 (* (* .cse0 .cse0) 2) (* 2 (* .cse0 v_main_~i~0_3)) v_main_~sum~0_2) v_main_~sum~0_1) (< .cse0 (+ (div (+ (- 1) v_main_~n~0_2 .cse1) 2) 1)) (<= 0 .cse0))) (let ((.cse3 (div (+ .cse2 v_main_~i~0_3) (- 2)))) (and (= (+ (* (* .cse3 .cse3) 2) (* 2 (* v_main_~i~0_3 .cse3)) v_main_~sum~0_2) (+ .cse3 v_main_~sum~0_1)) (< 0 .cse3) (< .cse3 (+ (div (+ (- 2) v_main_~n~0_2 .cse1) 2) 2)) (= (mod (+ v_main_~i~0_3 v_main_~i~0_2) 2) 0))))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post4=|v_main_#t~post4_3|, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_1} AuxVars[] AssignedVars[main_~sum~0, main_#t~post4, main_~i~0] {346#(<= 0 main_~sum~0)} is VALID [2022-04-14 20:14:37,778 WARN L290 TraceCheckUtils]: 7: Hoare triple {383#(and (forall ((aux_div_v_main_~i~0_12_36 Int)) (or (and (<= (+ (* (* main_~i~0 aux_div_v_main_~i~0_12_36) 2) aux_div_v_main_~i~0_12_36) (+ main_~sum~0 main_~i~0 (* 2 (* aux_div_v_main_~i~0_12_36 aux_div_v_main_~i~0_12_36)))) (forall ((aux_div_aux_mod_v_main_~i~0_11_50_77 Int)) (or (<= (+ (* (* main_~i~0 aux_div_aux_mod_v_main_~i~0_11_50_77) 2) (* (* main_~i~0 aux_div_v_main_~i~0_12_36) 2) aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_v_main_~i~0_12_36) (+ (* 4 (* aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_v_main_~i~0_12_36)) main_~sum~0 main_~i~0 (* (* aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_aux_mod_v_main_~i~0_11_50_77) 2) (* 2 (* aux_div_v_main_~i~0_12_36 aux_div_v_main_~i~0_12_36)))) (<= aux_div_aux_mod_v_main_~i~0_11_50_77 0))) (forall ((aux_div_v_main_~i~0_11_38 Int)) (or (< (+ main_~i~0 aux_div_v_main_~i~0_11_38) (+ (* 2 aux_div_v_main_~i~0_12_36) 1)) (<= (+ (* (* aux_div_v_main_~i~0_11_38 aux_div_v_main_~i~0_12_36) 4) main_~i~0 (* (* main_~i~0 aux_div_v_main_~i~0_12_36) 2) (* 3 aux_div_v_main_~i~0_11_38)) (+ (* 3 aux_div_v_main_~i~0_12_36) (* (* aux_div_v_main_~i~0_11_38 aux_div_v_main_~i~0_11_38) 2) main_~sum~0 (* 2 (* main_~i~0 aux_div_v_main_~i~0_11_38)) (* 2 (* aux_div_v_main_~i~0_12_36 aux_div_v_main_~i~0_12_36)) 1))))) (<= aux_div_v_main_~i~0_12_36 main_~i~0))) (<= 0 main_~sum~0) (forall ((aux_div_v_main_~i~0_12_52 Int) (aux_div_aux_mod_v_main_~i~0_12_52_33 Int)) (or (< (* aux_div_aux_mod_v_main_~i~0_12_52_33 2) 0) (< aux_div_v_main_~i~0_12_52 0) (and (forall ((aux_div_aux_mod_v_main_~i~0_11_50_77 Int)) (or (<= (+ aux_div_aux_mod_v_main_~i~0_12_52_33 (* 4 (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_v_main_~i~0_12_52)) (* 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 main_~i~0)) (* (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_aux_mod_v_main_~i~0_11_50_77) 4)) (+ (* (* main_~i~0 aux_div_v_main_~i~0_12_52) 2) (* (* main_~i~0 aux_div_aux_mod_v_main_~i~0_11_50_77) 2) (* (* aux_div_v_main_~i~0_12_52 aux_div_v_main_~i~0_12_52) 2) (* 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_aux_mod_v_main_~i~0_12_52_33)) main_~sum~0 main_~i~0 (* (* aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_aux_mod_v_main_~i~0_11_50_77) 2) (* 4 (* aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_v_main_~i~0_12_52)) aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_v_main_~i~0_12_52)) (<= aux_div_aux_mod_v_main_~i~0_11_50_77 0))) (<= (+ aux_div_aux_mod_v_main_~i~0_12_52_33 (* 4 (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_v_main_~i~0_12_52)) (* 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 main_~i~0))) (+ (* (* main_~i~0 aux_div_v_main_~i~0_12_52) 2) (* (* aux_div_v_main_~i~0_12_52 aux_div_v_main_~i~0_12_52) 2) (* 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_aux_mod_v_main_~i~0_12_52_33)) main_~sum~0 main_~i~0 aux_div_v_main_~i~0_12_52)) (forall ((aux_div_v_main_~i~0_11_38 Int)) (or (<= (+ (* 4 (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_v_main_~i~0_12_52)) (* 5 aux_div_v_main_~i~0_11_38) (* aux_div_aux_mod_v_main_~i~0_12_52_33 5) (* 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 main_~i~0)) (* 4 (* aux_div_v_main_~i~0_11_38 aux_div_v_main_~i~0_12_52)) (* 2 (* main_~i~0 aux_div_v_main_~i~0_11_38))) (+ (* (* main_~i~0 aux_div_v_main_~i~0_12_52) 2) (* (* aux_div_v_main_~i~0_12_52 aux_div_v_main_~i~0_12_52) 2) (* (* aux_div_v_main_~i~0_11_38 aux_div_v_main_~i~0_11_38) 2) (* 5 aux_div_v_main_~i~0_12_52) (* 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_aux_mod_v_main_~i~0_12_52_33)) main_~sum~0 3 (* (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_v_main_~i~0_11_38) 4) (* main_~i~0 3))) (< (+ (* aux_div_aux_mod_v_main_~i~0_12_52_33 2) aux_div_v_main_~i~0_11_38) (+ main_~i~0 2 (* 2 aux_div_v_main_~i~0_12_52)))))) (<= 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 2)))))} [59] L24-2-->L24-2: Formula: (let ((.cse1 (* (- 1) v_main_~i~0_3)) (.cse2 (* (- 1) v_main_~i~0_2))) (or (and (not (< v_main_~i~0_3 v_main_~n~0_2)) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~sum~0_2 v_main_~sum~0_1) (= v_main_~i~0_3 v_main_~i~0_2)) (let ((.cse0 (div (+ .cse2 v_main_~i~0_3 1) (- 2)))) (and (= (mod (+ v_main_~i~0_3 v_main_~i~0_2 1) 2) 0) (= (+ .cse0 v_main_~i~0_3 (* (* .cse0 .cse0) 2) (* 2 (* .cse0 v_main_~i~0_3)) v_main_~sum~0_2) v_main_~sum~0_1) (< .cse0 (+ (div (+ (- 1) v_main_~n~0_2 .cse1) 2) 1)) (<= 0 .cse0))) (let ((.cse3 (div (+ .cse2 v_main_~i~0_3) (- 2)))) (and (= (+ (* (* .cse3 .cse3) 2) (* 2 (* v_main_~i~0_3 .cse3)) v_main_~sum~0_2) (+ .cse3 v_main_~sum~0_1)) (< 0 .cse3) (< .cse3 (+ (div (+ (- 2) v_main_~n~0_2 .cse1) 2) 2)) (= (mod (+ v_main_~i~0_3 v_main_~i~0_2) 2) 0))))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post4=|v_main_#t~post4_3|, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sum~0=v_main_~sum~0_1} AuxVars[] AssignedVars[main_~sum~0, main_#t~post4, main_~i~0] {379#(and (or (< main_~i~0 main_~n~0) (<= 0 main_~sum~0)) (forall ((aux_div_aux_mod_v_main_~i~0_11_50_77 Int)) (or (<= aux_div_aux_mod_v_main_~i~0_11_50_77 (+ (* (* main_~i~0 aux_div_aux_mod_v_main_~i~0_11_50_77) 2) main_~sum~0 (* (* aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_aux_mod_v_main_~i~0_11_50_77) 2))) (<= (+ (div (+ (* (- 1) main_~i~0) (- 2) main_~n~0) 2) 2) aux_div_aux_mod_v_main_~i~0_11_50_77) (<= aux_div_aux_mod_v_main_~i~0_11_50_77 0))) (forall ((aux_div_v_main_~i~0_11_38 Int)) (or (< aux_div_v_main_~i~0_11_38 (+ main_~i~0 1)) (<= (+ main_~i~0 2 (div (+ (- 1) (* (- 1) main_~i~0) main_~n~0) 2)) aux_div_v_main_~i~0_11_38) (<= (+ (* 3 aux_div_v_main_~i~0_11_38) (* 2 (* main_~i~0 aux_div_v_main_~i~0_11_38))) (+ (* (* aux_div_v_main_~i~0_11_38 aux_div_v_main_~i~0_11_38) 2) main_~sum~0 (* main_~i~0 2) 1)))))} is UNKNOWN [2022-04-14 20:14:37,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {315#true} [55] L23-->L24-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_6 0) (<= v_main_~n~0_5 100) (= 0 v_main_~sum~0_6)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_6} AuxVars[] AssignedVars[] {383#(and (forall ((aux_div_v_main_~i~0_12_36 Int)) (or (and (<= (+ (* (* main_~i~0 aux_div_v_main_~i~0_12_36) 2) aux_div_v_main_~i~0_12_36) (+ main_~sum~0 main_~i~0 (* 2 (* aux_div_v_main_~i~0_12_36 aux_div_v_main_~i~0_12_36)))) (forall ((aux_div_aux_mod_v_main_~i~0_11_50_77 Int)) (or (<= (+ (* (* main_~i~0 aux_div_aux_mod_v_main_~i~0_11_50_77) 2) (* (* main_~i~0 aux_div_v_main_~i~0_12_36) 2) aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_v_main_~i~0_12_36) (+ (* 4 (* aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_v_main_~i~0_12_36)) main_~sum~0 main_~i~0 (* (* aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_aux_mod_v_main_~i~0_11_50_77) 2) (* 2 (* aux_div_v_main_~i~0_12_36 aux_div_v_main_~i~0_12_36)))) (<= aux_div_aux_mod_v_main_~i~0_11_50_77 0))) (forall ((aux_div_v_main_~i~0_11_38 Int)) (or (< (+ main_~i~0 aux_div_v_main_~i~0_11_38) (+ (* 2 aux_div_v_main_~i~0_12_36) 1)) (<= (+ (* (* aux_div_v_main_~i~0_11_38 aux_div_v_main_~i~0_12_36) 4) main_~i~0 (* (* main_~i~0 aux_div_v_main_~i~0_12_36) 2) (* 3 aux_div_v_main_~i~0_11_38)) (+ (* 3 aux_div_v_main_~i~0_12_36) (* (* aux_div_v_main_~i~0_11_38 aux_div_v_main_~i~0_11_38) 2) main_~sum~0 (* 2 (* main_~i~0 aux_div_v_main_~i~0_11_38)) (* 2 (* aux_div_v_main_~i~0_12_36 aux_div_v_main_~i~0_12_36)) 1))))) (<= aux_div_v_main_~i~0_12_36 main_~i~0))) (<= 0 main_~sum~0) (forall ((aux_div_v_main_~i~0_12_52 Int) (aux_div_aux_mod_v_main_~i~0_12_52_33 Int)) (or (< (* aux_div_aux_mod_v_main_~i~0_12_52_33 2) 0) (< aux_div_v_main_~i~0_12_52 0) (and (forall ((aux_div_aux_mod_v_main_~i~0_11_50_77 Int)) (or (<= (+ aux_div_aux_mod_v_main_~i~0_12_52_33 (* 4 (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_v_main_~i~0_12_52)) (* 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 main_~i~0)) (* (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_aux_mod_v_main_~i~0_11_50_77) 4)) (+ (* (* main_~i~0 aux_div_v_main_~i~0_12_52) 2) (* (* main_~i~0 aux_div_aux_mod_v_main_~i~0_11_50_77) 2) (* (* aux_div_v_main_~i~0_12_52 aux_div_v_main_~i~0_12_52) 2) (* 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_aux_mod_v_main_~i~0_12_52_33)) main_~sum~0 main_~i~0 (* (* aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_aux_mod_v_main_~i~0_11_50_77) 2) (* 4 (* aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_v_main_~i~0_12_52)) aux_div_aux_mod_v_main_~i~0_11_50_77 aux_div_v_main_~i~0_12_52)) (<= aux_div_aux_mod_v_main_~i~0_11_50_77 0))) (<= (+ aux_div_aux_mod_v_main_~i~0_12_52_33 (* 4 (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_v_main_~i~0_12_52)) (* 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 main_~i~0))) (+ (* (* main_~i~0 aux_div_v_main_~i~0_12_52) 2) (* (* aux_div_v_main_~i~0_12_52 aux_div_v_main_~i~0_12_52) 2) (* 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_aux_mod_v_main_~i~0_12_52_33)) main_~sum~0 main_~i~0 aux_div_v_main_~i~0_12_52)) (forall ((aux_div_v_main_~i~0_11_38 Int)) (or (<= (+ (* 4 (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_v_main_~i~0_12_52)) (* 5 aux_div_v_main_~i~0_11_38) (* aux_div_aux_mod_v_main_~i~0_12_52_33 5) (* 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 main_~i~0)) (* 4 (* aux_div_v_main_~i~0_11_38 aux_div_v_main_~i~0_12_52)) (* 2 (* main_~i~0 aux_div_v_main_~i~0_11_38))) (+ (* (* main_~i~0 aux_div_v_main_~i~0_12_52) 2) (* (* aux_div_v_main_~i~0_12_52 aux_div_v_main_~i~0_12_52) 2) (* (* aux_div_v_main_~i~0_11_38 aux_div_v_main_~i~0_11_38) 2) (* 5 aux_div_v_main_~i~0_12_52) (* 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_aux_mod_v_main_~i~0_12_52_33)) main_~sum~0 3 (* (* aux_div_aux_mod_v_main_~i~0_12_52_33 aux_div_v_main_~i~0_11_38) 4) (* main_~i~0 3))) (< (+ (* aux_div_aux_mod_v_main_~i~0_12_52_33 2) aux_div_v_main_~i~0_11_38) (+ main_~i~0 2 (* 2 aux_div_v_main_~i~0_12_52)))))) (<= 2 (* aux_div_aux_mod_v_main_~i~0_12_52_33 2)))))} is VALID [2022-04-14 20:14:37,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#true} [52] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet3_2| v_main_~sum~0_3) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~n~0_3 |v_main_#t~nondet2_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet3, main_~sum~0, main_#t~nondet2, main_~i~0, main_~n~0] {315#true} is VALID [2022-04-14 20:14:37,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#true} is VALID [2022-04-14 20:14:37,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#true} {315#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#true} is VALID [2022-04-14 20:14:37,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#true} is VALID [2022-04-14 20:14:37,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {315#true} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {315#true} is VALID [2022-04-14 20:14:37,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {315#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#true} is VALID [2022-04-14 20:14:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:14:37,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:14:37,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733825576] [2022-04-14 20:14:37,787 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:14:37,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822600822] [2022-04-14 20:14:37,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822600822] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:14:37,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:14:37,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-14 20:14:37,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37809344] [2022-04-14 20:14:37,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 20:14:37,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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 14 [2022-04-14 20:14:37,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:14:37,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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-14 20:14:40,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 20:14:40,176 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 20:14:40,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:14:40,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 20:14:40,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=49, Unknown=1, NotChecked=0, Total=72 [2022-04-14 20:14:40,177 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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-14 20:14:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:14:42,642 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-14 20:14:42,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 20:14:42,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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 14 [2022-04-14 20:14:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:14:42,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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-14 20:14:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-14 20:14:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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-14 20:14:42,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-14 20:14:42,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-14 20:14:43,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:14:43,142 INFO L225 Difference]: With dead ends: 20 [2022-04-14 20:14:43,142 INFO L226 Difference]: Without dead ends: 17 [2022-04-14 20:14:43,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=32, Invalid=76, Unknown=2, NotChecked=0, Total=110 [2022-04-14 20:14:43,142 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:14:43,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2022-04-14 20:14:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-14 20:14:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-14 20:14:43,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:14:43,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:14:43,144 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:14:43,144 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:14:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:14:43,145 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-14 20:14:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-14 20:14:43,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:14:43,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:14:43,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-14 20:14:43,145 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-14 20:14:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:14:43,146 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-14 20:14:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-14 20:14:43,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:14:43,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:14:43,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:14:43,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:14:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:14:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-14 20:14:43,147 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-14 20:14:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:14:43,147 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-14 20:14:43,147 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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-14 20:14:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-14 20:14:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-14 20:14:43,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:14:43,148 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:14:43,163 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-14 20:14:43,350 WARN L460 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-14 20:14:43,350 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:14:43,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:14:43,351 INFO L85 PathProgramCache]: Analyzing trace with hash 797507612, now seen corresponding path program 3 times [2022-04-14 20:14:43,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:14:43,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213708732] [2022-04-14 20:14:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:14:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:14:43,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:14:43,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494569055] [2022-04-14 20:14:43,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 20:14:43,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:14:43,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:14:43,375 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-14 20:14:43,376 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-14 20:14:44,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-14 20:14:44,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 20:14:44,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 20:14:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:14:45,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:14:57,489 WARN L855 $PredicateComparison]: unable to prove that (or (and (let ((.cse1 (* (- 1) c_main_~i~0))) (or (let ((.cse0 (div .cse1 (- 2)))) (and (< 0 .cse0) (< .cse0 (+ (div (+ (- 2) c_main_~n~0) 2) 2)) (<= (* 2 (* .cse0 .cse0)) (+ .cse0 c_main_~sum~0)))) (and (= c_main_~i~0 0) (<= 0 c_main_~sum~0)) (let ((.cse2 (div (+ .cse1 1) (- 2)))) (and (<= (+ .cse2 (* 2 (* .cse2 .cse2))) c_main_~sum~0) (< .cse2 (+ (div (+ (- 1) c_main_~n~0) 2) 1)) (<= 0 .cse2))))) (not (< c_main_~i~0 c_main_~n~0))) (exists ((aux_div_v_main_~i~0_14_36 Int)) (let ((.cse3 (* (- 2) aux_div_v_main_~i~0_14_36))) (and (< aux_div_v_main_~i~0_14_36 c_main_~i~0) (< c_main_~i~0 (+ 2 (div (+ c_main_~i~0 (- 2) c_main_~n~0 .cse3) 2) aux_div_v_main_~i~0_14_36)) (let ((.cse5 (* (* c_main_~i~0 aux_div_v_main_~i~0_14_36) 2)) (.cse6 (* 2 (* aux_div_v_main_~i~0_14_36 aux_div_v_main_~i~0_14_36)))) (or (let ((.cse4 (div (+ c_main_~i~0 .cse3 1) (- 2)))) (and (<= 0 .cse4) (<= (+ .cse5 (* 2 (* .cse4 .cse4)) .cse4 aux_div_v_main_~i~0_14_36) (+ .cse6 c_main_~i~0 c_main_~sum~0)) (= (mod (+ c_main_~i~0 1) 2) 0))) (let ((.cse7 (div (+ c_main_~i~0 .cse3) (- 2)))) (and (<= (+ .cse5 (* 2 (* .cse7 .cse7)) aux_div_v_main_~i~0_14_36) (+ .cse6 c_main_~i~0 .cse7 c_main_~sum~0)) (< 0 .cse7)))))))) (exists ((aux_div_v_main_~i~0_14_38 Int)) (let ((.cse8 (* (- 2) aux_div_v_main_~i~0_14_38))) (and (< c_main_~i~0 (+ (div (+ c_main_~i~0 .cse8 c_main_~n~0) 2) 1 aux_div_v_main_~i~0_14_38)) (<= aux_div_v_main_~i~0_14_38 c_main_~i~0) (let ((.cse9 (* 3 aux_div_v_main_~i~0_14_38)) (.cse10 (* 2 (* c_main_~i~0 aux_div_v_main_~i~0_14_38))) (.cse12 (* c_main_~i~0 2)) (.cse13 (* (* aux_div_v_main_~i~0_14_38 aux_div_v_main_~i~0_14_38) 2))) (or (let ((.cse11 (div (+ c_main_~i~0 .cse8 1) (- 2)))) (and (<= (+ .cse9 .cse10 (* (* .cse11 .cse11) 2)) (+ .cse11 .cse12 .cse13 1 c_main_~sum~0)) (< 0 .cse11))) (let ((.cse14 (div (+ c_main_~i~0 2 .cse8) (- 2)))) (and (<= 0 .cse14) (= (mod c_main_~i~0 2) 0) (<= (+ .cse9 .cse10 (* (* .cse14 .cse14) 2) .cse14) (+ .cse12 .cse13 1 c_main_~sum~0)))))))))) is different from true [2022-04-14 20:16:56,733 WARN L232 SmtUtils]: Spent 57.67s on a formula simplification that was a NOOP. DAG size: 191 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)