/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-lit/gsv2008.c.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:20:21,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:20:21,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:20:21,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:20:21,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:20:21,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:20:21,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:20:21,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:20:21,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:20:21,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:20:21,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:20:21,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:20:21,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:20:21,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:20:21,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:20:21,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:20:21,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:20:21,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:20:21,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:20:21,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:20:21,510 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:20:21,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:20:21,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:20:21,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:20:21,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:20:21,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:20:21,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:20:21,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:20:21,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:20:21,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:20:21,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:20:21,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:20:21,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:20:21,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:20:21,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:20:21,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:20:21,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:20:21,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:20:21,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:20:21,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:20:21,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:20:21,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:20:21,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:20:21,538 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:20:21,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:20:21,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:20:21,539 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:20:21,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:20:21,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:20:21,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:20:21,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:20:21,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:20:21,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:20:21,540 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:20:21,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:20:21,540 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:20:21,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:20:21,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:20:21,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:20:21,541 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:20:21,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:20:21,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:20:21,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:20:21,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:20:21,542 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:20:21,542 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:20:21,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:20:21,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:20:21,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:20:21,761 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:20:21,762 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:20:21,762 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+cfa-reducer.c [2022-04-27 16:20:21,826 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefc5da94/a8fcccb400c84f45b817220b48d6fbc0/FLAGe46a0c1ec [2022-04-27 16:20:22,164 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:20:22,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+cfa-reducer.c [2022-04-27 16:20:22,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefc5da94/a8fcccb400c84f45b817220b48d6fbc0/FLAGe46a0c1ec [2022-04-27 16:20:22,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefc5da94/a8fcccb400c84f45b817220b48d6fbc0 [2022-04-27 16:20:22,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:20:22,178 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:20:22,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:20:22,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:20:22,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:20:22,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:20:22" (1/1) ... [2022-04-27 16:20:22,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad63a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:20:22, skipping insertion in model container [2022-04-27 16:20:22,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:20:22" (1/1) ... [2022-04-27 16:20:22,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:20:22,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:20:22,326 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-lit/gsv2008.c.i.v+cfa-reducer.c[986,999] [2022-04-27 16:20:22,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:20:22,339 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:20:22,349 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-lit/gsv2008.c.i.v+cfa-reducer.c[986,999] [2022-04-27 16:20:22,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:20:22,359 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:20:22,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:20:22 WrapperNode [2022-04-27 16:20:22,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:20:22,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:20:22,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:20:22,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:20:22,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:20:22" (1/1) ... [2022-04-27 16:20:22,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:20:22" (1/1) ... [2022-04-27 16:20:22,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:20:22" (1/1) ... [2022-04-27 16:20:22,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:20:22" (1/1) ... [2022-04-27 16:20:22,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:20:22" (1/1) ... [2022-04-27 16:20:22,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:20:22" (1/1) ... [2022-04-27 16:20:22,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:20:22" (1/1) ... [2022-04-27 16:20:22,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:20:22,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:20:22,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:20:22,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:20:22,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:20:22" (1/1) ... [2022-04-27 16:20:22,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:20:22,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:20:22,412 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:20:22,413 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:20:22,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:20:22,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:20:22,433 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:20:22,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:20:22,433 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:20:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:20:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:20:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:20:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:20:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:20:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:20:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:20:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:20:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:20:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:20:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:20:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:20:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:20:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:20:22,478 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:20:22,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:20:22,585 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:20:22,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:20:22,589 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 16:20:22,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:20:22 BoogieIcfgContainer [2022-04-27 16:20:22,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:20:22,591 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:20:22,591 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:20:22,593 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:20:22,596 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:20:22" (1/1) ... [2022-04-27 16:20:22,597 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:20:24,179 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-27 16:20:24,180 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__y~0_4) (= (+ v_main_~main__y~0_4 1) v_main_~main__y~0_3) (< v_main_~main__x~0_2 0) (= (+ v_main_~main__x~0_2 v_main_~main__y~0_4) v_main_~main__x~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_4} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_3} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main__x~0, main_~main__y~0] to Formula: (let ((.cse1 (< v_main_~main__x~0_2 0))) (or (let ((.cse0 (div (+ (- 1) (* (- 1) v_main_~main__y~0_4) v_main_~main__y~0_3) 2))) (and (= (+ (* 2 (* .cse0 v_main_~main__y~0_4)) (* 2 (* .cse0 .cse0)) .cse0 v_main_~main__x~0_2 v_main_~main__y~0_4) v_main_~main__x~0_1) (= (mod (+ v_main_~main__y~0_4 v_main_~main__y~0_3 1) 2) 0) (= v_main_~main____CPAchecker_TMP_0~0_1 (+ (* 2 .cse0) v_main_~main__y~0_4)) (<= 0 .cse0) .cse1 (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) (* (- 1) v_main_~main__y~0_4) v_main_~main__y~0_3) 2))) (< (+ (* 2 (* v_itHalf_1 v_main_~main__y~0_4)) (* 2 (* v_itHalf_1 v_itHalf_1)) v_main_~main__x~0_2) v_itHalf_1) (not (<= 1 v_itHalf_1)))))) (let ((.cse2 (div (+ (- 1) (* v_main_~main____CPAchecker_TMP_0~0_1 (- 1)) v_main_~main__y~0_4) (- 2)))) (and (= (+ (* 2 .cse2) v_main_~main__y~0_4) v_main_~main__y~0_3) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (- 1) (* v_main_~main____CPAchecker_TMP_0~0_1 (- 1)) v_main_~main__y~0_4) (- 2)))) (< (+ v_itHalf_1 (* 2 (* v_itHalf_1 v_main_~main__y~0_4)) (* 2 (* v_itHalf_1 v_itHalf_1)) v_main_~main__x~0_2 v_main_~main__y~0_4) 0))) .cse1 (< 0 .cse2) (= (+ (* (* .cse2 v_main_~main__y~0_4) 2) (* 2 (* .cse2 .cse2)) v_main_~main__x~0_2) (+ .cse2 v_main_~main__x~0_1)) (= (mod (+ v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__y~0_4 1) 2) 0))) (and (= v_main_~main__y~0_4 v_main_~main__y~0_3) (= v_main_~main____CPAchecker_TMP_0~0_2 v_main_~main____CPAchecker_TMP_0~0_1) (= v_main_~main__x~0_2 v_main_~main__x~0_1) (<= 0 v_main_~main__x~0_2)))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_4} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_3} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main__x~0, main_~main__y~0] [2022-04-27 16:20:24,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:20:24 BasicIcfg [2022-04-27 16:20:24,186 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:20:24,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:20:24,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:20:24,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:20:24,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:20:22" (1/4) ... [2022-04-27 16:20:24,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7170e008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:20:24, skipping insertion in model container [2022-04-27 16:20:24,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:20:22" (2/4) ... [2022-04-27 16:20:24,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7170e008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:20:24, skipping insertion in model container [2022-04-27 16:20:24,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:20:22" (3/4) ... [2022-04-27 16:20:24,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7170e008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:20:24, skipping insertion in model container [2022-04-27 16:20:24,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:20:24" (4/4) ... [2022-04-27 16:20:24,191 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.v+cfa-reducer.cJordan [2022-04-27 16:20:24,199 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:20:24,199 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:20:24,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:20:24,226 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@6a514bab, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35eb2509 [2022-04-27 16:20:24,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:20:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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:20:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:20:24,235 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:20:24,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:20:24,236 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:20:24,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:20:24,245 INFO L85 PathProgramCache]: Analyzing trace with hash 323261602, now seen corresponding path program 1 times [2022-04-27 16:20:24,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:20:24,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890858971] [2022-04-27 16:20:24,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:20:24,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:20:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:20:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:20:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:20:24,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] 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) (= 0 v_~__return_main~0_4) (= (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) (= v_~__return_65~0_2 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_4, #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_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {19#true} is VALID [2022-04-27 16:20:24,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 16:20:24,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19#true} {19#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 16:20:24,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {19#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:20:24,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] 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) (= 0 v_~__return_main~0_4) (= (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) (= v_~__return_65~0_2 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_4, #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_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {19#true} is VALID [2022-04-27 16:20:24,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 16:20:24,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 16:20:24,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 16:20:24,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#true} [45] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= (- 50) v_main_~main__x~0_4) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__y~0_6)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_4, main_~main__y~0=v_main_~main__y~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {24#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-27 16:20:24,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} [48] L19-->L25: Formula: (< 0 (+ 1000 v_main_~main__y~0_10)) InVars {main_~main__y~0=v_main_~main__y~0_10} OutVars{main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[] {24#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-27 16:20:24,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} [51] L25-->L37: Formula: (< v_main_~main__y~0_2 1000000) InVars {main_~main__y~0=v_main_~main__y~0_2} OutVars{main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[] {24#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-27 16:20:24,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} [53] L37-->L46: Formula: (and (not (< v_main_~main__x~0_3 0)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (< 0 v_main_~main__y~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {20#false} is VALID [2022-04-27 16:20:24,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} [54] L46-->L48: 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[] {20#false} is VALID [2022-04-27 16:20:24,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {20#false} [56] L48-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#false} is VALID [2022-04-27 16:20:24,389 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:20:24,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:20:24,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890858971] [2022-04-27 16:20:24,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890858971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:20:24,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:20:24,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:20:24,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280380619] [2022-04-27 16:20:24,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:20:24,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 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) Word has length 11 [2022-04-27 16:20:24,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:20:24,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 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:20:24,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:20:24,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:20:24,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:20:24,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:20:24,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:20:24,431 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 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:20:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:20:24,492 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 16:20:24,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:20:24,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 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) Word has length 11 [2022-04-27 16:20:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:20:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 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:20:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-04-27 16:20:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 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:20:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-04-27 16:20:24,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2022-04-27 16:20:24,521 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-27 16:20:24,526 INFO L225 Difference]: With dead ends: 19 [2022-04-27 16:20:24,526 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 16:20:24,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:20:24,530 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:20:24,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-27 16:20:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 16:20:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 16:20:24,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:20:24,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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:20:24,547 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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:20:24,547 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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:20:24,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:20:24,549 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:20:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:20:24,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:20:24,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:20:24,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 13 states. [2022-04-27 16:20:24,550 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 13 states. [2022-04-27 16:20:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:20:24,551 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:20:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:20:24,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:20:24,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:20:24,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:20:24,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:20:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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:20:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 16:20:24,553 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 16:20:24,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:20:24,553 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 16:20:24,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 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:20:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:20:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:20:24,554 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:20:24,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:20:24,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:20:24,554 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:20:24,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:20:24,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1431144312, now seen corresponding path program 1 times [2022-04-27 16:20:24,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:20:24,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880749440] [2022-04-27 16:20:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:20:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:20:24,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:20:24,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799575273] [2022-04-27 16:20:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:20:24,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:20:24,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:20:24,575 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:20:24,576 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:20:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:20:24,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 16:20:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:20:24,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:22:50,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {88#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:22:50,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {88#true} [43] 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) (= 0 v_~__return_main~0_4) (= (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) (= v_~__return_65~0_2 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_4, #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_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {88#true} is VALID [2022-04-27 16:22:50,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {88#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:22:50,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88#true} {88#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:22:50,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {88#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:22:50,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {88#true} [45] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= (- 50) v_main_~main__x~0_4) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__y~0_6)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_4, main_~main__y~0=v_main_~main__y~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {108#(= (- 50) main_~main__x~0)} is VALID [2022-04-27 16:22:50,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {108#(= (- 50) main_~main__x~0)} [48] L19-->L25: Formula: (< 0 (+ 1000 v_main_~main__y~0_10)) InVars {main_~main__y~0=v_main_~main__y~0_10} OutVars{main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[] {108#(= (- 50) main_~main__x~0)} is VALID [2022-04-27 16:22:50,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {108#(= (- 50) main_~main__x~0)} [51] L25-->L37: Formula: (< v_main_~main__y~0_2 1000000) InVars {main_~main__y~0=v_main_~main__y~0_2} OutVars{main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[] {108#(= (- 50) main_~main__x~0)} is VALID [2022-04-27 16:22:52,520 WARN L290 TraceCheckUtils]: 8: Hoare triple {108#(= (- 50) main_~main__x~0)} [52] L37-->L37: Formula: (let ((.cse1 (< v_main_~main__x~0_2 0))) (or (let ((.cse0 (div (+ (- 1) (* (- 1) v_main_~main__y~0_4) v_main_~main__y~0_3) 2))) (and (= (+ (* 2 (* .cse0 v_main_~main__y~0_4)) (* 2 (* .cse0 .cse0)) .cse0 v_main_~main__x~0_2 v_main_~main__y~0_4) v_main_~main__x~0_1) (= (mod (+ v_main_~main__y~0_4 v_main_~main__y~0_3 1) 2) 0) (= v_main_~main____CPAchecker_TMP_0~0_1 (+ (* 2 .cse0) v_main_~main__y~0_4)) (<= 0 .cse0) .cse1 (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) (* (- 1) v_main_~main__y~0_4) v_main_~main__y~0_3) 2))) (< (+ (* 2 (* v_itHalf_1 v_main_~main__y~0_4)) (* 2 (* v_itHalf_1 v_itHalf_1)) v_main_~main__x~0_2) v_itHalf_1) (not (<= 1 v_itHalf_1)))))) (let ((.cse2 (div (+ (- 1) (* v_main_~main____CPAchecker_TMP_0~0_1 (- 1)) v_main_~main__y~0_4) (- 2)))) (and (= (+ (* 2 .cse2) v_main_~main__y~0_4) v_main_~main__y~0_3) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (- 1) (* v_main_~main____CPAchecker_TMP_0~0_1 (- 1)) v_main_~main__y~0_4) (- 2)))) (< (+ v_itHalf_1 (* 2 (* v_itHalf_1 v_main_~main__y~0_4)) (* 2 (* v_itHalf_1 v_itHalf_1)) v_main_~main__x~0_2 v_main_~main__y~0_4) 0))) .cse1 (< 0 .cse2) (= (+ (* (* .cse2 v_main_~main__y~0_4) 2) (* 2 (* .cse2 .cse2)) v_main_~main__x~0_2) (+ .cse2 v_main_~main__x~0_1)) (= (mod (+ v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__y~0_4 1) 2) 0))) (and (= v_main_~main__y~0_4 v_main_~main__y~0_3) (= v_main_~main____CPAchecker_TMP_0~0_2 v_main_~main____CPAchecker_TMP_0~0_1) (= v_main_~main__x~0_2 v_main_~main__x~0_1) (<= 0 v_main_~main__x~0_2)))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_4} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_3} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main__x~0, main_~main__y~0] {118#(or (exists ((aux_div_aux_mod_v_main_~main__y~0_11_64_39 Int) (aux_div_v_main_~main__y~0_11_64 Int)) (and (<= 0 (+ aux_div_v_main_~main__y~0_11_64 aux_div_aux_mod_v_main_~main__y~0_11_64_39)) (< (* 2 aux_div_aux_mod_v_main_~main__y~0_11_64_39) 2) (forall ((v_itHalf_1 Int)) (or (< (+ (* 2 (* v_itHalf_1 main_~main__y~0)) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 4 (* v_itHalf_1 aux_div_v_main_~main__y~0_11_64)) (* (* v_itHalf_1 aux_div_aux_mod_v_main_~main__y~0_11_64_39) 4) (* v_itHalf_1 3) 50)) (not (<= 1 v_itHalf_1)) (not (<= v_itHalf_1 (+ aux_div_v_main_~main__y~0_11_64 aux_div_aux_mod_v_main_~main__y~0_11_64_39))))) (<= 0 (* 2 aux_div_aux_mod_v_main_~main__y~0_11_64_39)) (= (+ (* 2 (* aux_div_v_main_~main__y~0_11_64 main_~main__y~0)) main_~main__y~0) (+ (* 3 aux_div_v_main_~main__y~0_11_64) 51 (* 2 (* aux_div_v_main_~main__y~0_11_64 aux_div_v_main_~main__y~0_11_64)) (* 2 aux_div_aux_mod_v_main_~main__y~0_11_64_39) main_~main__x~0 (* (* aux_div_v_main_~main__y~0_11_64 aux_div_aux_mod_v_main_~main__y~0_11_64_39) 4))))) (exists ((aux_div_v_main_~main__y~0_11_67 Int)) (and (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_11_67 1) main_~main__y~0)) (not (<= 0 v_itHalf_1)) (< (+ v_itHalf_1 (* 2 aux_div_v_main_~main__y~0_11_67) (* 2 (* v_itHalf_1 v_itHalf_1)) (* (* v_itHalf_1 aux_div_v_main_~main__y~0_11_67) 4)) (+ (* 2 (* v_itHalf_1 main_~main__y~0)) main_~main__y~0 50)))) (< aux_div_v_main_~main__y~0_11_67 main_~main__y~0) (= (+ (* 2 (* (+ (- 1) main_~main__y~0) (div (+ (* 2 aux_div_v_main_~main__y~0_11_67) (* (- 2) main_~main__y~0)) (- 2)))) (* 3 (div (+ (* 2 aux_div_v_main_~main__y~0_11_67) (* (- 2) main_~main__y~0)) (- 2))) main_~main__x~0 50) (+ (* (* (div (+ (* 2 aux_div_v_main_~main__y~0_11_67) (* (- 2) main_~main__y~0)) (- 2)) aux_div_v_main_~main__y~0_11_67) 4) (* 2 (* (div (+ (* 2 aux_div_v_main_~main__y~0_11_67) (* (- 2) main_~main__y~0)) (- 2)) (div (+ (* 2 aux_div_v_main_~main__y~0_11_67) (* (- 2) main_~main__y~0)) (- 2)))))))))} is UNKNOWN [2022-04-27 16:22:52,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {118#(or (exists ((aux_div_aux_mod_v_main_~main__y~0_11_64_39 Int) (aux_div_v_main_~main__y~0_11_64 Int)) (and (<= 0 (+ aux_div_v_main_~main__y~0_11_64 aux_div_aux_mod_v_main_~main__y~0_11_64_39)) (< (* 2 aux_div_aux_mod_v_main_~main__y~0_11_64_39) 2) (forall ((v_itHalf_1 Int)) (or (< (+ (* 2 (* v_itHalf_1 main_~main__y~0)) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 4 (* v_itHalf_1 aux_div_v_main_~main__y~0_11_64)) (* (* v_itHalf_1 aux_div_aux_mod_v_main_~main__y~0_11_64_39) 4) (* v_itHalf_1 3) 50)) (not (<= 1 v_itHalf_1)) (not (<= v_itHalf_1 (+ aux_div_v_main_~main__y~0_11_64 aux_div_aux_mod_v_main_~main__y~0_11_64_39))))) (<= 0 (* 2 aux_div_aux_mod_v_main_~main__y~0_11_64_39)) (= (+ (* 2 (* aux_div_v_main_~main__y~0_11_64 main_~main__y~0)) main_~main__y~0) (+ (* 3 aux_div_v_main_~main__y~0_11_64) 51 (* 2 (* aux_div_v_main_~main__y~0_11_64 aux_div_v_main_~main__y~0_11_64)) (* 2 aux_div_aux_mod_v_main_~main__y~0_11_64_39) main_~main__x~0 (* (* aux_div_v_main_~main__y~0_11_64 aux_div_aux_mod_v_main_~main__y~0_11_64_39) 4))))) (exists ((aux_div_v_main_~main__y~0_11_67 Int)) (and (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_11_67 1) main_~main__y~0)) (not (<= 0 v_itHalf_1)) (< (+ v_itHalf_1 (* 2 aux_div_v_main_~main__y~0_11_67) (* 2 (* v_itHalf_1 v_itHalf_1)) (* (* v_itHalf_1 aux_div_v_main_~main__y~0_11_67) 4)) (+ (* 2 (* v_itHalf_1 main_~main__y~0)) main_~main__y~0 50)))) (< aux_div_v_main_~main__y~0_11_67 main_~main__y~0) (= (+ (* 2 (* (+ (- 1) main_~main__y~0) (div (+ (* 2 aux_div_v_main_~main__y~0_11_67) (* (- 2) main_~main__y~0)) (- 2)))) (* 3 (div (+ (* 2 aux_div_v_main_~main__y~0_11_67) (* (- 2) main_~main__y~0)) (- 2))) main_~main__x~0 50) (+ (* (* (div (+ (* 2 aux_div_v_main_~main__y~0_11_67) (* (- 2) main_~main__y~0)) (- 2)) aux_div_v_main_~main__y~0_11_67) 4) (* 2 (* (div (+ (* 2 aux_div_v_main_~main__y~0_11_67) (* (- 2) main_~main__y~0)) (- 2)) (div (+ (* 2 aux_div_v_main_~main__y~0_11_67) (* (- 2) main_~main__y~0)) (- 2)))))))))} [53] L37-->L46: Formula: (and (not (< v_main_~main__x~0_3 0)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (< 0 v_main_~main__y~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {122#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 16:22:52,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {122#(<= 1 main_~__VERIFIER_assert__cond~0)} [54] L46-->L48: 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[] {89#false} is VALID [2022-04-27 16:22:52,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {89#false} [56] L48-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#false} is VALID [2022-04-27 16:22:52,531 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:22:52,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:24:49,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {89#false} [56] L48-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#false} is VALID [2022-04-27 16:24:49,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {122#(<= 1 main_~__VERIFIER_assert__cond~0)} [54] L46-->L48: 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[] {89#false} is VALID [2022-04-27 16:24:49,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {135#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} [53] L37-->L46: Formula: (and (not (< v_main_~main__x~0_3 0)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (< 0 v_main_~main__y~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {122#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 16:24:49,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {139#(< main_~main__x~0 0)} [52] L37-->L37: Formula: (let ((.cse1 (< v_main_~main__x~0_2 0))) (or (let ((.cse0 (div (+ (- 1) (* (- 1) v_main_~main__y~0_4) v_main_~main__y~0_3) 2))) (and (= (+ (* 2 (* .cse0 v_main_~main__y~0_4)) (* 2 (* .cse0 .cse0)) .cse0 v_main_~main__x~0_2 v_main_~main__y~0_4) v_main_~main__x~0_1) (= (mod (+ v_main_~main__y~0_4 v_main_~main__y~0_3 1) 2) 0) (= v_main_~main____CPAchecker_TMP_0~0_1 (+ (* 2 .cse0) v_main_~main__y~0_4)) (<= 0 .cse0) .cse1 (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) (* (- 1) v_main_~main__y~0_4) v_main_~main__y~0_3) 2))) (< (+ (* 2 (* v_itHalf_1 v_main_~main__y~0_4)) (* 2 (* v_itHalf_1 v_itHalf_1)) v_main_~main__x~0_2) v_itHalf_1) (not (<= 1 v_itHalf_1)))))) (let ((.cse2 (div (+ (- 1) (* v_main_~main____CPAchecker_TMP_0~0_1 (- 1)) v_main_~main__y~0_4) (- 2)))) (and (= (+ (* 2 .cse2) v_main_~main__y~0_4) v_main_~main__y~0_3) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (- 1) (* v_main_~main____CPAchecker_TMP_0~0_1 (- 1)) v_main_~main__y~0_4) (- 2)))) (< (+ v_itHalf_1 (* 2 (* v_itHalf_1 v_main_~main__y~0_4)) (* 2 (* v_itHalf_1 v_itHalf_1)) v_main_~main__x~0_2 v_main_~main__y~0_4) 0))) .cse1 (< 0 .cse2) (= (+ (* (* .cse2 v_main_~main__y~0_4) 2) (* 2 (* .cse2 .cse2)) v_main_~main__x~0_2) (+ .cse2 v_main_~main__x~0_1)) (= (mod (+ v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__y~0_4 1) 2) 0))) (and (= v_main_~main__y~0_4 v_main_~main__y~0_3) (= v_main_~main____CPAchecker_TMP_0~0_2 v_main_~main____CPAchecker_TMP_0~0_1) (= v_main_~main__x~0_2 v_main_~main__x~0_1) (<= 0 v_main_~main__x~0_2)))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_4} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_3} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main__x~0, main_~main__y~0] {135#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-27 16:24:49,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {139#(< main_~main__x~0 0)} [51] L25-->L37: Formula: (< v_main_~main__y~0_2 1000000) InVars {main_~main__y~0=v_main_~main__y~0_2} OutVars{main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[] {139#(< main_~main__x~0 0)} is VALID [2022-04-27 16:24:49,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {139#(< main_~main__x~0 0)} [48] L19-->L25: Formula: (< 0 (+ 1000 v_main_~main__y~0_10)) InVars {main_~main__y~0=v_main_~main__y~0_10} OutVars{main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[] {139#(< main_~main__x~0 0)} is VALID [2022-04-27 16:24:49,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {88#true} [45] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= (- 50) v_main_~main__x~0_4) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__y~0_6)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_4, main_~main__y~0=v_main_~main__y~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {139#(< main_~main__x~0 0)} is VALID [2022-04-27 16:24:49,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {88#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:24:49,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88#true} {88#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:24:49,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {88#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:24:49,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {88#true} [43] 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) (= 0 v_~__return_main~0_4) (= (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) (= v_~__return_65~0_2 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_4, #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_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {88#true} is VALID [2022-04-27 16:24:49,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {88#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:24:49,991 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:49,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:24:49,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880749440] [2022-04-27 16:24:49,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 16:24:49,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799575273] [2022-04-27 16:24:49,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799575273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:24:49,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 16:24:49,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-04-27 16:24:49,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021495889] [2022-04-27 16:24:49,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 16:24:49,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 12 [2022-04-27 16:24:49,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:24:49,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:52,038 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-27 16:24:52,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:24:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:24:52,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:24:52,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:24:52,039 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:52,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:24:52,063 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 16:24:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:24:52,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 12 [2022-04-27 16:24:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:24:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-27 16:24:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-27 16:24:52,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 16 transitions. [2022-04-27 16:24:54,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 16:24:54,109 INFO L225 Difference]: With dead ends: 15 [2022-04-27 16:24:54,109 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 16:24:54,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:24:54,110 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:24:54,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-04-27 16:24:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 16:24:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 16:24:54,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:24:54,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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:54,113 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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:54,113 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:24:54,114 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:24:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:24:54,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:24:54,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:24:54,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 14 states. [2022-04-27 16:24:54,115 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 14 states. [2022-04-27 16:24:54,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:24:54,116 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:24:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:24:54,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:24:54,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:24:54,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:24:54,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:24:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 16:24:54,117 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 16:24:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:24:54,117 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 16:24:54,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:24:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:24:54,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:24:54,118 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:24:54,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 16:24:54,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:24:54,321 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:24:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:24:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1415769954, now seen corresponding path program 2 times [2022-04-27 16:24:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:24:54,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610583066] [2022-04-27 16:24:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:24:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:24:54,339 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:24:54,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457063185] [2022-04-27 16:24:54,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:24:54,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:24:54,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:24:54,341 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,359 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,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 16:24:55,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:24:55,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 16:24:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:24:55,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:26:12,949 WARN L232 SmtUtils]: Spent 21.54s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:32:47,700 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aux_div_v_main_~main__y~0_14_85 Int) (aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 Int)) (let ((.cse1 (* 2 c_main_~main__y~0)) (.cse0 (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71))) (and (<= (+ (* 2 (* c_main_~main__y~0 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71)) (* 2 (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85)) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_14_85 50) (+ (* 2 (* c_main_~main__y~0 aux_div_v_main_~main__y~0_14_85)) (* 2 (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71)) c_main_~main__y~0)) (<= .cse0 .cse1) (< c_main_~main__y~0 (+ aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_14_85)) (= (+ (* (- 2) c_main_~main__y~0 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* (- 1) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* (- 1) aux_div_v_main_~main__y~0_14_85) c_main_~main__y~0 (* (- 2) aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85) (* 2 c_main_~main__y~0 aux_div_v_main_~main__y~0_14_85) (- 50)) c_main_~main__x~0) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (< (+ (* 2 (* v_itHalf_1 c_main_~main__y~0)) v_itHalf_1 c_main_~main__y~0 (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 aux_div_v_main_~main__y~0_14_85) (* (* v_itHalf_1 aux_div_v_main_~main__y~0_14_85) 4) 50)) (not (<= (+ v_itHalf_1 c_main_~main__y~0 1) (+ aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_14_85))))) (< .cse1 (+ .cse0 2))))) (exists ((aux_div_main_~main____CPAchecker_TMP_0~0_85 Int) (aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 Int) (aux_div_v_main_~main__y~0_14_85 Int) (aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 Int) (aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 Int)) (let ((.cse4 (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63))) (let ((.cse3 (+ .cse4 (* 2 aux_div_main_~main____CPAchecker_TMP_0~0_85))) (.cse9 (+ (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 4) (* 2 c_main_~main__y~0))) (.cse7 (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71)) (.cse8 (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 4)) (.cse2 (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113))) (and (<= .cse2 .cse3) (forall ((v_itHalf_1 Int)) (or (< (+ (* 4 (* v_itHalf_1 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63)) (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 4) (* 2 (* c_main_~main__y~0 aux_div_v_main_~main__y~0_14_85)) (* 2 (* v_itHalf_1 c_main_~main__y~0)) (* 2 (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71)) v_itHalf_1 (* (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) 4) (* (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 aux_div_v_main_~main__y~0_14_85) 4) (* 2 c_main_~main__y~0) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) 4) (* 2 (* c_main_~main__y~0 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71)) (* 2 (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85)) (* (* v_itHalf_1 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) 4) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_14_85 (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 4) (* 4 (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 aux_div_v_main_~main__y~0_14_85)) 50)) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 1) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113)))) (<= 0 .cse4) (< 0 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) (= (+ aux_div_main_~main____CPAchecker_TMP_0~0_85 c_main_~main__x~0) (let ((.cse6 (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113))) (let ((.cse5 (+ .cse4 c_main_~main__y~0 .cse6))) (+ (* (- 1) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) .cse4 (* (* aux_div_main_~main____CPAchecker_TMP_0~0_85 aux_div_main_~main____CPAchecker_TMP_0~0_85) 2) (* 2 .cse5 aux_div_v_main_~main__y~0_14_85) (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* (- 1) aux_div_v_main_~main__y~0_14_85) c_main_~main__y~0 (* (- 2) .cse5 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* (- 2) aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85) (- 50) .cse6 (* (* .cse5 aux_div_main_~main____CPAchecker_TMP_0~0_85) 2))))) (< (+ .cse4 c_main_~main__y~0) (+ .cse2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_14_85)) (< .cse3 (+ 2 .cse2)) (<= (+ .cse7 .cse8) .cse9) (< .cse9 (+ .cse7 2 .cse8)) (< (+ (* 2 (* c_main_~main__y~0 aux_div_v_main_~main__y~0_14_85)) (* 2 (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71)) .cse4 (* (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) 4) c_main_~main__y~0 (* (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 aux_div_v_main_~main__y~0_14_85) 4)) (+ (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) 4) (* 2 (* c_main_~main__y~0 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71)) (* 2 (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85)) .cse2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_14_85 (* 4 (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 aux_div_v_main_~main__y~0_14_85)) 50)) (< .cse4 2))))) (exists ((aux_div_v_main_~main__y~0_15_50 Int) (aux_div_v_main_~main__y~0_14_85 Int) (aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 Int)) (let ((.cse11 (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71)) (.cse10 (* aux_div_v_main_~main__y~0_15_50 4)) (.cse12 (* 2 c_main_~main__y~0)) (.cse18 (* 2 (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71))) (.cse21 (* 2 aux_div_v_main_~main__y~0_15_50)) (.cse19 (* 2 (* c_main_~main__y~0 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71))) (.cse20 (* (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_15_50) 4)) (.cse13 (* 2 (* c_main_~main__y~0 aux_div_v_main_~main__y~0_14_85))) (.cse15 (* 2 (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85))) (.cse16 (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_15_50) 4)) (.cse17 (* 3 aux_div_v_main_~main__y~0_14_85))) (and (< .cse10 (+ .cse11 .cse12 4)) (<= (+ .cse11 2 .cse12) .cse10) (let ((.cse14 (div (+ (* (- 2) aux_div_v_main_~main__y~0_15_50) .cse12) 2))) (= (+ .cse13 (* (* .cse14 c_main_~main__y~0) 2) .cse14 .cse15 .cse16 52 .cse12 .cse17 c_main_~main__x~0) (+ (* 2 (* .cse14 .cse14)) .cse18 .cse19 (* (* .cse14 aux_div_v_main_~main__y~0_15_50) 4) .cse10 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 .cse20))) (forall ((v_itHalf_1 Int)) (or (not (<= 1 v_itHalf_1)) (< (+ (* 2 (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71)) (* 2 aux_div_v_main_~main__y~0_15_50) (* 2 (* c_main_~main__y~0 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71)) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 (* 4 (* v_itHalf_1 aux_div_v_main_~main__y~0_15_50)) (* 2 (* v_itHalf_1 v_itHalf_1)) (* (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_15_50) 4)) (+ (* 2 (* c_main_~main__y~0 aux_div_v_main_~main__y~0_14_85)) (* 2 (* v_itHalf_1 c_main_~main__y~0)) 51 (* 2 (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85)) (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_15_50) 4) c_main_~main__y~0 (* v_itHalf_1 3) (* 3 aux_div_v_main_~main__y~0_14_85))) (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_15_50) c_main_~main__y~0)))) (<= aux_div_v_main_~main__y~0_15_50 c_main_~main__y~0) (< .cse21 (+ c_main_~main__y~0 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_14_85 1)) (< (+ .cse18 .cse21 .cse19 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 .cse20) (+ .cse13 51 .cse15 .cse16 c_main_~main__y~0 .cse17))))) (exists ((aux_div_v_main_~main__y~0_15_50 Int) (aux_div_v_main_~main__y~0_14_50 Int)) (let ((.cse22 (* 2 aux_div_v_main_~main__y~0_15_50)) (.cse26 (* (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_15_50) 4)) (.cse27 (* 2 c_main_~main__y~0)) (.cse23 (* 2 (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50))) (.cse25 (* 2 (* c_main_~main__y~0 aux_div_v_main_~main__y~0_14_50)))) (and (<= (+ c_main_~main__y~0 aux_div_v_main_~main__y~0_14_50 1) .cse22) (let ((.cse24 (div (+ (* (- 2) aux_div_v_main_~main__y~0_15_50) .cse27) 2))) (= (+ .cse23 (* (* .cse24 c_main_~main__y~0) 2) .cse22 .cse24 .cse25 c_main_~main__x~0 50) (+ .cse26 (* 2 (* .cse24 .cse24)) (* (* .cse24 aux_div_v_main_~main__y~0_15_50) 4) c_main_~main__y~0 aux_div_v_main_~main__y~0_14_50))) (forall ((v_itHalf_1 Int)) (or (not (<= 1 v_itHalf_1)) (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_15_50) c_main_~main__y~0)) (< (+ (* (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_15_50) 4) (* 2 c_main_~main__y~0) (* 4 (* v_itHalf_1 aux_div_v_main_~main__y~0_15_50)) aux_div_v_main_~main__y~0_14_50 (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50)) (* 2 (* v_itHalf_1 c_main_~main__y~0)) 49 (* 2 (* c_main_~main__y~0 aux_div_v_main_~main__y~0_14_50)) (* aux_div_v_main_~main__y~0_15_50 4) (* v_itHalf_1 3))))) (< (+ .cse26 .cse27 aux_div_v_main_~main__y~0_14_50) (+ .cse23 49 .cse25 (* aux_div_v_main_~main__y~0_15_50 4))) (<= aux_div_v_main_~main__y~0_15_50 c_main_~main__y~0)))) (exists ((aux_div_v_main_~main__y~0_14_50 Int)) (let ((.cse28 (* 3 aux_div_v_main_~main__y~0_14_50))) (and (<= (+ (* 2 (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50)) 51 (* 2 c_main_~main__y~0)) (+ (* 2 (* c_main_~main__y~0 aux_div_v_main_~main__y~0_14_50)) .cse28)) (= (+ (- 51) (* (- 2) c_main_~main__y~0) .cse28 (* 2 c_main_~main__y~0 aux_div_v_main_~main__y~0_14_50) (* (- 2) aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50)) c_main_~main__x~0) (<= aux_div_v_main_~main__y~0_14_50 c_main_~main__y~0) (forall ((v_itHalf_1 Int)) (or (not (<= 1 v_itHalf_1)) (< (+ (* (* v_itHalf_1 aux_div_v_main_~main__y~0_14_50) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 (* v_itHalf_1 c_main_~main__y~0)) (* v_itHalf_1 3) 50)) (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_14_50) c_main_~main__y~0))))))) (exists ((aux_div_main_~main____CPAchecker_TMP_0~0_85 Int) (aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 Int) (aux_div_v_main_~main__y~0_14_50 Int) (aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 Int)) (let ((.cse34 (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63))) (let ((.cse30 (+ .cse34 (* 2 aux_div_main_~main____CPAchecker_TMP_0~0_85))) (.cse29 (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113)) (.cse31 (* 3 aux_div_v_main_~main__y~0_14_50)) (.cse33 (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 4))) (and (<= .cse29 .cse30) (= (+ aux_div_main_~main____CPAchecker_TMP_0~0_85 c_main_~main__x~0) (let ((.cse32 (+ .cse34 c_main_~main__y~0 (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113)))) (+ (- 51) (* (- 4) aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (* aux_div_main_~main____CPAchecker_TMP_0~0_85 aux_div_main_~main____CPAchecker_TMP_0~0_85) 2) (* (- 2) c_main_~main__y~0) .cse31 (* 2 .cse32 aux_div_v_main_~main__y~0_14_50) .cse33 (* (* .cse32 aux_div_main_~main____CPAchecker_TMP_0~0_85) 2) (* (- 2) aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50)))) (<= (+ .cse29 aux_div_v_main_~main__y~0_14_50) (+ .cse34 c_main_~main__y~0)) (<= 0 .cse34) (< 0 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) (< .cse30 (+ 2 .cse29)) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 1) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113)) (< (+ (* 4 (* v_itHalf_1 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63)) (* 2 (* v_itHalf_1 c_main_~main__y~0)) v_itHalf_1 (* 4 (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 aux_div_v_main_~main__y~0_14_50)) (* 2 (* c_main_~main__y~0 aux_div_v_main_~main__y~0_14_50)) (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) (* 3 aux_div_v_main_~main__y~0_14_50) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50)) (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) 51 c_main_~main__y~0 (* (* v_itHalf_1 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) 4) (* (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 aux_div_v_main_~main__y~0_14_50) 4))))) (< (+ (* 4 (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 aux_div_v_main_~main__y~0_14_50)) (* 2 (* c_main_~main__y~0 aux_div_v_main_~main__y~0_14_50)) .cse31 .cse33) (+ (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 4) (* 2 (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50)) 51 (* 2 c_main_~main__y~0) (* (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 aux_div_v_main_~main__y~0_14_50) 4))) (< .cse34 2)))))) is different from true