/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-new/gauss_sum.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:24:50,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:24:50,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:24:50,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:24:50,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:24:50,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:24:50,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:24:50,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:24:50,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:24:50,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:24:50,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:24:50,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:24:50,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:24:50,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:24:50,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:24:50,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:24:50,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:24:50,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:24:50,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:24:50,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:24:50,726 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:24:50,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:24:50,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:24:50,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:24:50,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:24:50,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:24:50,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:24:50,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:24:50,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:24:50,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:24:50,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:24:50,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:24:50,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:24:50,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:24:50,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:24:50,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:24:50,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:24:50,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:24:50,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:24:50,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:24:50,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:24:50,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:24:50,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:24:50,756 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:24:50,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:24:50,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:24:50,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:24:50,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:24:50,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:24:50,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:24:50,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:24:50,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:24:50,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:24:50,759 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:24:50,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:24:50,760 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:24:50,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:24:50,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:24:50,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:24:50,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:24:50,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:24:50,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:24:50,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:24:50,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:24:50,761 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:24:50,762 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:24:50,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:24:51,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:24:51,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:24:51,010 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:24:51,012 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:24:51,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2022-04-27 16:24:51,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/720299884/15ec111b59284f83a6f5a1a75feb0546/FLAG56d774c6b [2022-04-27 16:24:51,444 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:24:51,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2022-04-27 16:24:51,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/720299884/15ec111b59284f83a6f5a1a75feb0546/FLAG56d774c6b [2022-04-27 16:24:51,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/720299884/15ec111b59284f83a6f5a1a75feb0546 [2022-04-27 16:24:51,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:24:51,461 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:24:51,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:24:51,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:24:51,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:24:51,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:24:51" (1/1) ... [2022-04-27 16:24:51,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc1a57c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:24:51, skipping insertion in model container [2022-04-27 16:24:51,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:24:51" (1/1) ... [2022-04-27 16:24:51,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:24:51,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:24:51,620 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-new/gauss_sum.i.p+lhb-reducer.c[1444,1457] [2022-04-27 16:24:51,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:24:51,632 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:24:51,664 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-new/gauss_sum.i.p+lhb-reducer.c[1444,1457] [2022-04-27 16:24:51,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:24:51,678 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:24:51,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:24:51 WrapperNode [2022-04-27 16:24:51,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:24:51,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:24:51,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:24:51,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:24:51,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:24:51" (1/1) ... [2022-04-27 16:24:51,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:24:51" (1/1) ... [2022-04-27 16:24:51,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:24:51" (1/1) ... [2022-04-27 16:24:51,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:24:51" (1/1) ... [2022-04-27 16:24:51,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:24:51" (1/1) ... [2022-04-27 16:24:51,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:24:51" (1/1) ... [2022-04-27 16:24:51,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:24:51" (1/1) ... [2022-04-27 16:24:51,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:24:51,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:24:51,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:24:51,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:24:51,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:24:51" (1/1) ... [2022-04-27 16:24:51,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:24:51,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:24:51,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:24:51,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:24:51,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:24:51,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:24:51,777 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:24:51,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:24:51,777 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:24:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:24:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:24:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:24:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:24:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:24:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:24:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:24:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:24:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:24:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:24:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:24:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:24:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:24:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:24:51,826 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:24:51,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:24:51,994 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:24:52,001 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:24:52,001 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 16:24:52,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:24:52 BoogieIcfgContainer [2022-04-27 16:24:52,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:24:52,008 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:24:52,008 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:24:52,015 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:24:52,018 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:24:52" (1/1) ... [2022-04-27 16:24:52,019 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:24:52,568 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:24:52,569 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~main__sum~0_4 v_main_~main__i~0_4) v_main_~main__sum~0_3) (= (+ v_main_~main__i~0_4 1) v_main_~main__i~0_3) (<= v_main_~main__i~0_4 v_main_~main__n~0_2)) InVars {main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] to Formula: (let ((.cse1 (* (- 1) v_main_~main__i~0_4))) (or (let ((.cse0 (div (+ .cse1 v_main_~main__i~0_3) 2))) (and (= (mod (+ v_main_~main__i~0_4 v_main_~main__i~0_3) 2) 0) (= (+ (* (* .cse0 .cse0) 2) (* (* .cse0 v_main_~main__i~0_4) 2) v_main_~main__sum~0_4) (+ .cse0 v_main_~main__sum~0_3)) (<= .cse0 (+ (div (+ (- 1) .cse1 v_main_~main__n~0_2) 2) 1)) (< 0 .cse0))) (and (not (<= v_main_~main__i~0_4 v_main_~main__n~0_2)) (= v_main_~main__i~0_4 v_main_~main__i~0_3) (= v_main_~main__sum~0_4 v_main_~main__sum~0_3)) (let ((.cse2 (div (+ (- 1) .cse1 v_main_~main__i~0_3) 2))) (and (= (+ .cse2 v_main_~main__sum~0_4 (* 2 (* .cse2 .cse2)) (* 2 (* .cse2 v_main_~main__i~0_4)) v_main_~main__i~0_4) v_main_~main__sum~0_3) (<= 0 .cse2) (= (mod (+ v_main_~main__i~0_4 v_main_~main__i~0_3 1) 2) 0) (<= .cse2 (div (+ .cse1 v_main_~main__n~0_2) 2)))))) InVars {main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] [2022-04-27 16:24:52,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:24:52 BasicIcfg [2022-04-27 16:24:52,574 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:24:52,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:24:52,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:24:52,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:24:52,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:24:51" (1/4) ... [2022-04-27 16:24:52,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c61143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:24:52, skipping insertion in model container [2022-04-27 16:24:52,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:24:51" (2/4) ... [2022-04-27 16:24:52,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c61143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:24:52, skipping insertion in model container [2022-04-27 16:24:52,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:24:52" (3/4) ... [2022-04-27 16:24:52,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c61143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:24:52, skipping insertion in model container [2022-04-27 16:24:52,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:24:52" (4/4) ... [2022-04-27 16:24:52,581 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.p+lhb-reducer.cJordan [2022-04-27 16:24:52,593 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:24:52,593 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:24:52,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:24:52,631 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@791513bb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b25b35e [2022-04-27 16:24:52,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:24:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:24:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:24:52,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:24:52,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:24:52,643 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:24:52,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:24:52,647 INFO L85 PathProgramCache]: Analyzing trace with hash 456799944, now seen corresponding path program 1 times [2022-04-27 16:24:52,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:24:52,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379524947] [2022-04-27 16:24:52,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:24:52,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:24:52,737 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:24:52,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086140973] [2022-04-27 16:24:52,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:24:52,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:24:52,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:24:52,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:24:52,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:24:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:24:52,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 16:24:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:24:52,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:24:53,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:24:53,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= v_~__return_96~0_2 0) (= 0 v_~__return_main~0_9) (= (select |v_#length_1| 3) 12) (= (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{~__return_main~0=v_~__return_main~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_96~0=v_~__return_96~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_96~0, #NULL.base] {24#true} is VALID [2022-04-27 16:24:53,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:24:53,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:24:53,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:24:53,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [65] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__n~0_4) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_6, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {24#true} is VALID [2022-04-27 16:24:53,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [68] L19-->L25: Formula: (<= 1 v_main_~main__n~0_8) InVars {main_~main__n~0=v_main_~main__n~0_8} OutVars{main_~main__n~0=v_main_~main__n~0_8} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:24:53,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [71] L25-->L33: Formula: (and (<= v_main_~main__n~0_14 1000) (= v_main_~main__i~0_11 1) (= v_main_~main__sum~0_7 0)) InVars {main_~main__n~0=v_main_~main__n~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_14, main_~main__sum~0=v_main_~main__sum~0_7, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {50#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-27 16:24:53,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} [72] L33-->L37: Formula: (and (<= v_main_~main__i~0_14 v_main_~main__n~0_16) (= (+ v_main_~main__i~0_14 1) v_main_~main__i~0_13) (= v_main_~main__sum~0_8 (+ v_main_~main__sum~0_9 v_main_~main__i~0_14))) InVars {main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_9, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_8, main_~main__i~0=v_main_~main__i~0_13} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {54#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-27 16:24:53,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {54#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} [74] L37-->L41: Formula: (and (= (+ v_main_~main__i~0_16 v_main_~main__sum~0_11) v_main_~main__sum~0_10) (<= v_main_~main__i~0_16 v_main_~main__n~0_17) (= (+ v_main_~main__i~0_16 1) v_main_~main__i~0_15)) InVars {main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_11, main_~main__i~0=v_main_~main__i~0_16} OutVars{main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_10, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {58#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-27 16:24:53,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {58#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} [76] L41-->L45: Formula: (and (= (+ v_main_~main__i~0_18 1) v_main_~main__i~0_17) (<= v_main_~main__i~0_18 v_main_~main__n~0_18) (= (+ v_main_~main__i~0_18 v_main_~main__sum~0_13) v_main_~main__sum~0_12)) InVars {main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_13, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_12, main_~main__i~0=v_main_~main__i~0_17} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {62#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-27 16:24:53,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} [78] L45-->L49: Formula: (and (= (+ v_main_~main__i~0_20 v_main_~main__sum~0_15) v_main_~main__sum~0_14) (= (+ v_main_~main__i~0_20 1) v_main_~main__i~0_19) (<= v_main_~main__i~0_20 v_main_~main__n~0_19)) InVars {main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_15, main_~main__i~0=v_main_~main__i~0_20} OutVars{main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_14, main_~main__i~0=v_main_~main__i~0_19} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {66#(and (= (+ (- 1) main_~main__i~0) 4) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-27 16:24:53,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {66#(and (= (+ (- 1) main_~main__i~0) 4) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} [80] L49-->L58: Formula: (and (<= v_main_~main__i~0_2 v_main_~main__n~0_1) (= (+ v_main_~main__sum~0_2 v_main_~main__i~0_2) v_main_~main__sum~0_1) (= (+ v_main_~main__i~0_2 1) v_main_~main__i~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {70#(and (= (+ (- 9) main_~main__sum~0) 6) (<= 5 main_~main__n~0) (<= main_~main__i~0 6))} is VALID [2022-04-27 16:24:53,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {70#(and (= (+ (- 9) main_~main__sum~0) 6) (<= 5 main_~main__n~0) (<= main_~main__i~0 6))} [83] L58-->L67: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (<= v_main_~main__i~0_5 v_main_~main__n~0_3)) (= (ite (= (* 2 v_main_~main__sum~0_5) (* (+ v_main_~main__n~0_3 1) v_main_~main__n~0_3)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {74#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 16:24:53,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {74#(<= 1 main_~__VERIFIER_assert__cond~0)} [84] L67-->L69: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:24:53,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {25#false} [86] L69-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:24:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:24:53,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:24:53,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:24:53,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379524947] [2022-04-27 16:24:53,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 16:24:53,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086140973] [2022-04-27 16:24:53,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086140973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:24:53,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:24:53,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 16:24:53,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311659864] [2022-04-27 16:24:53,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:24:53,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 16:24:53,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:24:53,322 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), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:24:53,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:24:53,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 16:24:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:24:53,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 16:24:53,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:24:53,375 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:24:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:24:53,898 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 16:24:53,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:24:53,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 16:24:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:24:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:24:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2022-04-27 16:24:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:24:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2022-04-27 16:24:53,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2022-04-27 16:24:53,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:24:53,958 INFO L225 Difference]: With dead ends: 35 [2022-04-27 16:24:53,958 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 16:24:53,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-27 16:24:53,962 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 16:24:53,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 16:24:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 16:24:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 16:24:53,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:24:53,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:24:53,984 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:24:53,984 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:24:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:24:53,986 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 16:24:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 16:24:53,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:24:53,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:24:53,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 16:24:53,987 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 16:24:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:24:53,989 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 16:24:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 16:24:53,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:24:53,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:24:53,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:24:53,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:24:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:24:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-27 16:24:53,992 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-27 16:24:53,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:24:53,993 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-27 16:24:53,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:24:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 16:24:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:24:53,994 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:24:53,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:24:54,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:24:54,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 16:24:54,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:24:54,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:24:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1275865648, now seen corresponding path program 1 times [2022-04-27 16:24:54,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:24:54,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803037566] [2022-04-27 16:24:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:24:54,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:24:54,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:24:54,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796272280] [2022-04-27 16:24:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:24:54,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:24:54,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:24:54,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:24:54,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 16:24:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:24:55,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 16:24:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:24:55,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:24:59,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 16:24:59,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= v_~__return_96~0_2 0) (= 0 v_~__return_main~0_9) (= (select |v_#length_1| 3) 12) (= (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{~__return_main~0=v_~__return_main~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_96~0=v_~__return_96~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_96~0, #NULL.base] {171#true} is VALID [2022-04-27 16:24:59,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 16:24:59,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 16:24:59,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 16:24:59,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} [65] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__n~0_4) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_6, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {171#true} is VALID [2022-04-27 16:24:59,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {171#true} [68] L19-->L25: Formula: (<= 1 v_main_~main__n~0_8) InVars {main_~main__n~0=v_main_~main__n~0_8} OutVars{main_~main__n~0=v_main_~main__n~0_8} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 16:24:59,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {171#true} [71] L25-->L33: Formula: (and (<= v_main_~main__n~0_14 1000) (= v_main_~main__i~0_11 1) (= v_main_~main__sum~0_7 0)) InVars {main_~main__n~0=v_main_~main__n~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_14, main_~main__sum~0=v_main_~main__sum~0_7, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {197#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-27 16:24:59,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {197#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} [72] L33-->L37: Formula: (and (<= v_main_~main__i~0_14 v_main_~main__n~0_16) (= (+ v_main_~main__i~0_14 1) v_main_~main__i~0_13) (= v_main_~main__sum~0_8 (+ v_main_~main__sum~0_9 v_main_~main__i~0_14))) InVars {main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_9, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_8, main_~main__i~0=v_main_~main__i~0_13} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {201#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-27 16:24:59,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} [74] L37-->L41: Formula: (and (= (+ v_main_~main__i~0_16 v_main_~main__sum~0_11) v_main_~main__sum~0_10) (<= v_main_~main__i~0_16 v_main_~main__n~0_17) (= (+ v_main_~main__i~0_16 1) v_main_~main__i~0_15)) InVars {main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_11, main_~main__i~0=v_main_~main__i~0_16} OutVars{main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_10, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {205#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-27 16:24:59,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {205#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} [76] L41-->L45: Formula: (and (= (+ v_main_~main__i~0_18 1) v_main_~main__i~0_17) (<= v_main_~main__i~0_18 v_main_~main__n~0_18) (= (+ v_main_~main__i~0_18 v_main_~main__sum~0_13) v_main_~main__sum~0_12)) InVars {main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_13, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_12, main_~main__i~0=v_main_~main__i~0_17} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {209#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0))} is VALID [2022-04-27 16:24:59,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0))} [78] L45-->L49: Formula: (and (= (+ v_main_~main__i~0_20 v_main_~main__sum~0_15) v_main_~main__sum~0_14) (= (+ v_main_~main__i~0_20 1) v_main_~main__i~0_19) (<= v_main_~main__i~0_20 v_main_~main__n~0_19)) InVars {main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_15, main_~main__i~0=v_main_~main__i~0_20} OutVars{main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_14, main_~main__i~0=v_main_~main__i~0_19} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {213#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0))} is VALID [2022-04-27 16:24:59,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0))} [80] L49-->L58: Formula: (and (<= v_main_~main__i~0_2 v_main_~main__n~0_1) (= (+ v_main_~main__sum~0_2 v_main_~main__i~0_2) v_main_~main__sum~0_1) (= (+ v_main_~main__i~0_2 1) v_main_~main__i~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {217#(and (<= main_~main__i~0 (+ main_~main__n~0 1)) (= (+ (- 1) main_~main__i~0) 5) (= (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0))} is VALID [2022-04-27 16:24:59,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {217#(and (<= main_~main__i~0 (+ main_~main__n~0 1)) (= (+ (- 1) main_~main__i~0) 5) (= (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0))} [82] L58-->L58: Formula: (let ((.cse1 (* (- 1) v_main_~main__i~0_4))) (or (let ((.cse0 (div (+ .cse1 v_main_~main__i~0_3) 2))) (and (= (mod (+ v_main_~main__i~0_4 v_main_~main__i~0_3) 2) 0) (= (+ (* (* .cse0 .cse0) 2) (* (* .cse0 v_main_~main__i~0_4) 2) v_main_~main__sum~0_4) (+ .cse0 v_main_~main__sum~0_3)) (<= .cse0 (+ (div (+ (- 1) .cse1 v_main_~main__n~0_2) 2) 1)) (< 0 .cse0))) (and (not (<= v_main_~main__i~0_4 v_main_~main__n~0_2)) (= v_main_~main__i~0_4 v_main_~main__i~0_3) (= v_main_~main__sum~0_4 v_main_~main__sum~0_3)) (let ((.cse2 (div (+ (- 1) .cse1 v_main_~main__i~0_3) 2))) (and (= (+ .cse2 v_main_~main__sum~0_4 (* 2 (* .cse2 .cse2)) (* 2 (* .cse2 v_main_~main__i~0_4)) v_main_~main__i~0_4) v_main_~main__sum~0_3) (<= 0 .cse2) (= (mod (+ v_main_~main__i~0_4 v_main_~main__i~0_3 1) 2) 0) (<= .cse2 (div (+ .cse1 v_main_~main__n~0_2) 2)))))) InVars {main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {221#(and (<= 5 main_~main__n~0) (or (and (<= 0 (div (+ (- 7) main_~main__i~0) 2)) (<= (div (+ (- 7) main_~main__i~0) 2) (div (+ (- 6) main_~main__n~0) 2)) (= (mod (+ main_~main__i~0 1) 2) 0) (= main_~main__sum~0 (+ 21 (* (* (div (+ (- 7) main_~main__i~0) 2) (div (+ (- 7) main_~main__i~0) 2)) 2) (* (div (+ (- 7) main_~main__i~0) 2) 13)))) (and (<= (div (+ (- 6) main_~main__i~0) 2) (+ (div (+ (- 7) main_~main__n~0) 2) 1)) (= (mod main_~main__i~0 2) 0) (< 0 (div (+ (- 6) main_~main__i~0) 2)) (= (+ (* (div (+ (- 6) main_~main__i~0) 2) 12) (* (* (div (+ (- 6) main_~main__i~0) 2) (div (+ (- 6) main_~main__i~0) 2)) 2) 15) (+ main_~main__sum~0 (div (+ (- 6) main_~main__i~0) 2)))) (and (= 6 main_~main__i~0) (= main_~main__sum~0 15) (not (<= 6 main_~main__n~0)))))} is VALID [2022-04-27 16:24:59,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {221#(and (<= 5 main_~main__n~0) (or (and (<= 0 (div (+ (- 7) main_~main__i~0) 2)) (<= (div (+ (- 7) main_~main__i~0) 2) (div (+ (- 6) main_~main__n~0) 2)) (= (mod (+ main_~main__i~0 1) 2) 0) (= main_~main__sum~0 (+ 21 (* (* (div (+ (- 7) main_~main__i~0) 2) (div (+ (- 7) main_~main__i~0) 2)) 2) (* (div (+ (- 7) main_~main__i~0) 2) 13)))) (and (<= (div (+ (- 6) main_~main__i~0) 2) (+ (div (+ (- 7) main_~main__n~0) 2) 1)) (= (mod main_~main__i~0 2) 0) (< 0 (div (+ (- 6) main_~main__i~0) 2)) (= (+ (* (div (+ (- 6) main_~main__i~0) 2) 12) (* (* (div (+ (- 6) main_~main__i~0) 2) (div (+ (- 6) main_~main__i~0) 2)) 2) 15) (+ main_~main__sum~0 (div (+ (- 6) main_~main__i~0) 2)))) (and (= 6 main_~main__i~0) (= main_~main__sum~0 15) (not (<= 6 main_~main__n~0)))))} [83] L58-->L67: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (<= v_main_~main__i~0_5 v_main_~main__n~0_3)) (= (ite (= (* 2 v_main_~main__sum~0_5) (* (+ v_main_~main__n~0_3 1) v_main_~main__n~0_3)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {225#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 16:24:59,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {225#(<= 1 main_~__VERIFIER_assert__cond~0)} [84] L67-->L69: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-27 16:24:59,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {172#false} [86] L69-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-27 16:24:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:24:59,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:30:31,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((main_~main__n~0 Int)) (or (and (or (= (+ (* 2 c_main_~main__i~0) (* c_main_~main__sum~0 2)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 1 c_main_~main__i~0) main_~main__n~0)) (forall ((aux_div_v_main_~main__i~0_32_64 Int) (aux_div_aux_mod_v_main_~main__i~0_32_64_39 Int)) (let ((.cse1 (* 2 aux_div_v_main_~main__i~0_32_64)) (.cse0 (* aux_div_aux_mod_v_main_~main__i~0_32_64_39 2))) (or (<= 2 .cse0) (< (div (+ (- 1) (* (- 1) c_main_~main__i~0) main_~main__n~0) 2) (+ aux_div_aux_mod_v_main_~main__i~0_32_64_39 aux_div_v_main_~main__i~0_32_64)) (<= (+ .cse1 2 .cse0 c_main_~main__i~0) main_~main__n~0) (= (let ((.cse2 (div (+ .cse1 .cse0) 2))) (+ (* 2 .cse2) 2 (* (* .cse2 .cse2) 4) (* c_main_~main__sum~0 2) (* 4 (* (+ 1 c_main_~main__i~0) .cse2)) (* 4 c_main_~main__i~0))) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (< .cse0 0)))) (forall ((aux_div_v_main_~main__i~0_32_48 Int)) (let ((.cse3 (* 2 aux_div_v_main_~main__i~0_32_48))) (or (<= .cse3 (+ main_~main__n~0 1 c_main_~main__i~0)) (< (+ (div (+ (* (- 1) c_main_~main__i~0) (- 2) main_~main__n~0) 2) 2 c_main_~main__i~0) aux_div_v_main_~main__i~0_32_48) (let ((.cse4 (div (+ .cse3 (* (- 2) c_main_~main__i~0) (- 2)) 2))) (= (+ (* 2 c_main_~main__i~0) (* 4 (* .cse4 .cse4)) (* 4 (* (+ 1 c_main_~main__i~0) .cse4)) (* c_main_~main__sum~0 2)) (+ (* main_~main__n~0 main_~main__n~0) (* .cse4 2) main_~main__n~0))))))) (not (<= c_main_~main__i~0 main_~main__n~0)))) is different from false [2022-04-27 16:33:51,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((main_~main__n~0 Int)) (or (not (<= (+ 1 c_main_~main__i~0) main_~main__n~0)) (and (forall ((aux_div_v_main_~main__i~0_32_48 Int)) (let ((.cse1 (* 2 aux_div_v_main_~main__i~0_32_48))) (or (let ((.cse0 (div (+ .cse1 (* (- 2) c_main_~main__i~0) (- 4)) 2))) (= (+ (* .cse0 2) (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* (* .cse0 .cse0) 4) 2 (* (* .cse0 (+ 2 c_main_~main__i~0)) 4) (* c_main_~main__sum~0 2) (* 4 c_main_~main__i~0)))) (<= .cse1 (+ 2 main_~main__n~0 c_main_~main__i~0)) (< (+ 3 (div (+ (* (- 1) c_main_~main__i~0) (- 3) main_~main__n~0) 2) c_main_~main__i~0) aux_div_v_main_~main__i~0_32_48)))) (or (<= (+ 2 c_main_~main__i~0) main_~main__n~0) (= (+ 2 (* c_main_~main__sum~0 2) (* 4 c_main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0))) (forall ((aux_div_v_main_~main__i~0_32_64 Int) (aux_div_aux_mod_v_main_~main__i~0_32_64_39 Int)) (let ((.cse3 (* 2 aux_div_v_main_~main__i~0_32_64)) (.cse4 (* aux_div_aux_mod_v_main_~main__i~0_32_64_39 2))) (or (= (let ((.cse2 (div (+ .cse3 .cse4) 2))) (+ (* (* (+ 2 c_main_~main__i~0) .cse2) 4) (* 2 .cse2) (* 6 c_main_~main__i~0) 6 (* (* .cse2 .cse2) 4) (* c_main_~main__sum~0 2))) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= 2 .cse4) (< (div (+ (* (- 1) c_main_~main__i~0) (- 2) main_~main__n~0) 2) (+ aux_div_aux_mod_v_main_~main__i~0_32_64_39 aux_div_v_main_~main__i~0_32_64)) (<= (+ .cse3 3 .cse4 c_main_~main__i~0) main_~main__n~0) (< .cse4 0))))))) is different from false