/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.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:07:45,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:07:45,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:07:46,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:07:46,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:07:46,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:07:46,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:07:46,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:07:46,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:07:46,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:07:46,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:07:46,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:07:46,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:07:46,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:07:46,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:07:46,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:07:46,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:07:46,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:07:46,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:07:46,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:07:46,061 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:07:46,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:07:46,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:07:46,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:07:46,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:07:46,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:07:46,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:07:46,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:07:46,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:07:46,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:07:46,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:07:46,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:07:46,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:07:46,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:07:46,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:07:46,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:07:46,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:07:46,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:07:46,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:07:46,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:07:46,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:07:46,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:07:46,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:07:46,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:07:46,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:07:46,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:07:46,089 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:07:46,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:07:46,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:07:46,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:07:46,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:07:46,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:07:46,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:07:46,090 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:07:46,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:07:46,090 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:07:46,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:07:46,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:07:46,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:07:46,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:07:46,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:07:46,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:07:46,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:07:46,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:07:46,092 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:07:46,092 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-07 17:07:46,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:07:46,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:07:46,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:07:46,297 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:07:46,297 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:07:46,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.p+cfa-reducer.c [2022-04-07 17:07:46,346 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40b1863c6/428441023ae54d8ebba909d8da9441f8/FLAGf60a28a33 [2022-04-07 17:07:46,721 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:07:46,721 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.p+cfa-reducer.c [2022-04-07 17:07:46,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40b1863c6/428441023ae54d8ebba909d8da9441f8/FLAGf60a28a33 [2022-04-07 17:07:46,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40b1863c6/428441023ae54d8ebba909d8da9441f8 [2022-04-07 17:07:46,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:07:46,740 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:07:46,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:07:46,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:07:46,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:07:46,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:07:46" (1/1) ... [2022-04-07 17:07:46,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6502bc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:07:46, skipping insertion in model container [2022-04-07 17:07:46,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:07:46" (1/1) ... [2022-04-07 17:07:46,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:07:46,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:07:46,901 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.p+cfa-reducer.c[989,1002] [2022-04-07 17:07:46,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:07:46,909 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:07:46,921 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.p+cfa-reducer.c[989,1002] [2022-04-07 17:07:46,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:07:46,935 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:07:46,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:07:46 WrapperNode [2022-04-07 17:07:46,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:07:46,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:07:46,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:07:46,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:07:46,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:07:46" (1/1) ... [2022-04-07 17:07:46,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:07:46" (1/1) ... [2022-04-07 17:07:46,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:07:46" (1/1) ... [2022-04-07 17:07:46,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:07:46" (1/1) ... [2022-04-07 17:07:46,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:07:46" (1/1) ... [2022-04-07 17:07:46,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:07:46" (1/1) ... [2022-04-07 17:07:46,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:07:46" (1/1) ... [2022-04-07 17:07:46,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:07:46,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:07:46,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:07:46,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:07:46,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:07:46" (1/1) ... [2022-04-07 17:07:46,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:07:46,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:07:46,978 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-07 17:07:46,986 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-07 17:07:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:07:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:07:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:07:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 17:07:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:07:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:07:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:07:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:07:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:07:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 17:07:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:07:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:07:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:07:47,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:07:47,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:07:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:07:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:07:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:07:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:07:47,069 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:07:47,071 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:07:47,206 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:07:47,221 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:07:47,221 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-07 17:07:47,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:07:47 BoogieIcfgContainer [2022-04-07 17:07:47,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:07:47,223 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:07:47,223 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:07:47,227 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:07:47,246 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:07:47" (1/1) ... [2022-04-07 17:07:47,248 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:07:48,968 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-07 17:07:48,969 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-07 17:07:48,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:07:48 BasicIcfg [2022-04-07 17:07:48,974 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:07:48,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:07:48,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:07:48,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:07:48,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:07:46" (1/4) ... [2022-04-07 17:07:48,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe3c652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:07:48, skipping insertion in model container [2022-04-07 17:07:48,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:07:46" (2/4) ... [2022-04-07 17:07:48,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe3c652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:07:48, skipping insertion in model container [2022-04-07 17:07:48,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:07:47" (3/4) ... [2022-04-07 17:07:48,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe3c652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:07:48, skipping insertion in model container [2022-04-07 17:07:48,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:07:48" (4/4) ... [2022-04-07 17:07:48,981 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.p+cfa-reducer.cJordan [2022-04-07 17:07:48,984 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:07:48,984 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:07:49,014 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:07:49,018 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 17:07:49,018 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:07:49,028 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-07 17:07:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 17:07:49,032 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:07:49,032 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:07:49,033 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:07:49,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:07:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash 323261602, now seen corresponding path program 1 times [2022-04-07 17:07:49,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:07:49,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577793277] [2022-04-07 17:07:49,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:07:49,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:07:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:07:49,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:07:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:07:49,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_144~0)| ~__return_144~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 (= v_~__return_144~0_2 0) (= 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))) 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_144~0=v_~__return_144~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_144~0, #NULL.base] {19#true} is VALID [2022-04-07 17:07:49,177 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-07 17:07:49,178 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-07 17:07:49,179 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_144~0)| ~__return_144~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:07:49,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_144~0)| ~__return_144~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 (= v_~__return_144~0_2 0) (= 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))) 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_144~0=v_~__return_144~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_144~0, #NULL.base] {19#true} is VALID [2022-04-07 17:07:49,180 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-07 17:07:49,180 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-07 17:07:49,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-07 17:07:49,181 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-07 17:07:49,182 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-07 17:07:49,182 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-07 17:07:49,183 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-07 17:07:49,183 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-07 17:07:49,183 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-07 17:07:49,183 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-07 17:07:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:07:49,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577793277] [2022-04-07 17:07:49,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577793277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:07:49,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:07:49,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 17:07:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633309631] [2022-04-07 17:07:49,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:07:49,190 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-07 17:07:49,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:07:49,197 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-07 17:07:49,209 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-07 17:07:49,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 17:07:49,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:07:49,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 17:07:49,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 17:07:49,235 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-07 17:07:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:07:49,296 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-07 17:07:49,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 17:07:49,296 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-07 17:07:49,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:07:49,297 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-07 17:07:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-04-07 17:07:49,301 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-07 17:07:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-04-07 17:07:49,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2022-04-07 17:07:49,327 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-07 17:07:49,332 INFO L225 Difference]: With dead ends: 19 [2022-04-07 17:07:49,332 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 17:07:49,333 INFO L912 BasicCegarLoop]: 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-07 17:07:49,335 INFO L913 BasicCegarLoop]: 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-07 17:07:49,335 INFO L914 BasicCegarLoop]: 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-07 17:07:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 17:07:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-07 17:07:49,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:07:49,385 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-07 17:07:49,386 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-07 17:07:49,386 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-07 17:07:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:07:49,387 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 17:07:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 17:07:49,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:07:49,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:07:49,395 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-07 17:07:49,396 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-07 17:07:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:07:49,400 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 17:07:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 17:07:49,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:07:49,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:07:49,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:07:49,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:07:49,401 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-07 17:07:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-07 17:07:49,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-07 17:07:49,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:07:49,405 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-07 17:07:49,405 INFO L479 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-07 17:07:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 17:07:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 17:07:49,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:07:49,409 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:07:49,409 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:07:49,413 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:07:49,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:07:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1431144312, now seen corresponding path program 1 times [2022-04-07 17:07:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:07:49,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222072188] [2022-04-07 17:07:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:07:49,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:07:49,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 17:07:49,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909512565] [2022-04-07 17:07:49,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:07:49,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:07:49,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:07:49,447 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-07 17:07:49,448 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-07 17:07:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:07:49,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 17:07:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:07:49,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:10:08,123 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-07 17:10:08,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {88#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_144~0_2 0) (= 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))) 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_144~0=v_~__return_144~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_144~0, #NULL.base] {88#true} is VALID [2022-04-07 17:10:08,124 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-07 17:10:08,125 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-07 17:10:08,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {88#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-07 17:10:08,128 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-07 17:10:08,128 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-07 17:10:08,129 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-07 17:10:10,141 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-07 17:10:10,152 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-07 17:10:10,153 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-07 17:10:10,153 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-07 17:10:10,154 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-07 17:10:10,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:10:10,729 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-07 17:10:10,730 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-07 17:10:10,731 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-07 17:10:10,739 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-07 17:10:10,740 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-07 17:10:10,740 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-07 17:10:10,740 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-07 17:10:10,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {88#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-07 17:10:10,741 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-07 17:10:10,741 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-07 17:10:10,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {88#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_144~0_2 0) (= 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))) 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_144~0=v_~__return_144~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_144~0, #NULL.base] {88#true} is VALID [2022-04-07 17:10:10,742 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-07 17:10:10,742 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-07 17:10:10,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:10:10,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222072188] [2022-04-07 17:10:10,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 17:10:10,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909512565] [2022-04-07 17:10:10,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909512565] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:10:10,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:10:10,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-04-07 17:10:10,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289917672] [2022-04-07 17:10:10,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 17:10:10,756 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-07 17:10:10,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:10:10,756 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-07 17:10:12,811 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-07 17:10:12,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:10:12,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:10:12,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:10:12,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:10:12,813 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-07 17:10:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:10:12,841 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 17:10:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 17:10:12,841 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-07 17:10:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:10:12,841 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-07 17:10:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-07 17:10:12,842 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-07 17:10:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-07 17:10:12,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 16 transitions. [2022-04-07 17:10:14,904 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-07 17:10:14,905 INFO L225 Difference]: With dead ends: 15 [2022-04-07 17:10:14,905 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 17:10:14,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:10:14,906 INFO L913 BasicCegarLoop]: 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-07 17:10:14,907 INFO L914 BasicCegarLoop]: 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-07 17:10:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 17:10:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 17:10:14,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:10:14,908 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-07 17:10:14,908 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-07 17:10:14,909 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-07 17:10:14,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:10:14,909 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 17:10:14,909 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 17:10:14,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:10:14,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:10:14,910 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-07 17:10:14,910 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-07 17:10:14,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:10:14,911 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 17:10:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 17:10:14,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:10:14,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:10:14,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:10:14,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:10:14,911 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-07 17:10:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-07 17:10:14,912 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-07 17:10:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:10:14,915 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-07 17:10:14,915 INFO L479 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-07 17:10:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 17:10:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 17:10:14,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:10:14,916 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:10:14,921 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-07 17:10:15,120 WARN L460 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-07 17:10:15,120 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:10:15,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:10:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1415769954, now seen corresponding path program 2 times [2022-04-07 17:10:15,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:10:15,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428841442] [2022-04-07 17:10:15,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:10:15,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:10:15,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 17:10:15,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565686355] [2022-04-07 17:10:15,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 17:10:15,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:10:15,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:10:15,136 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-07 17:10:15,154 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-07 17:10:16,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 17:10:16,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:10:16,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 17:10:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:10:16,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:11:17,964 WARN L232 SmtUtils]: Spent 17.07s 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-07 17:16:53,334 WARN L232 SmtUtils]: Spent 18.10s on a formula simplification that was a NOOP. DAG size: 233 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 17:22:12,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {223#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:22:12,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_144~0_2 0) (= 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))) 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_144~0=v_~__return_144~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_144~0, #NULL.base] {223#true} is VALID [2022-04-07 17:22:12,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:22:12,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223#true} {223#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:22:12,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:22:12,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {223#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] {243#(= (+ main_~main__x~0 50) 0)} is VALID [2022-04-07 17:22:12,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#(= (+ 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[] {243#(= (+ main_~main__x~0 50) 0)} is VALID [2022-04-07 17:22:12,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#(= (+ 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[] {243#(= (+ main_~main__x~0 50) 0)} is VALID [2022-04-07 17:22:15,003 WARN L290 TraceCheckUtils]: 8: Hoare triple {243#(= (+ main_~main__x~0 50) 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] {253#(or (exists ((aux_div_v_main_~main__y~0_14_50 Int)) (and (= (+ (* 2 aux_div_v_main_~main__y~0_14_50) (* 2 (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50)) 2) (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50)) 2))) (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50)) 2) aux_div_v_main_~main__y~0_14_50) 4)) (+ (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50)) 2) (* 2 (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50)) 2) main_~main__y~0)) 51 main_~main__x~0 main_~main__y~0)) (= (+ (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50)) 2) 2) (* 2 aux_div_v_main_~main__y~0_14_50)) (+ main_~main____CPAchecker_TMP_0~0 main_~main__y~0 1)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_14_50) main_~main__y~0)) (< (+ (* (* v_itHalf_1 aux_div_v_main_~main__y~0_14_50) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 (* v_itHalf_1 main_~main__y~0)) (* v_itHalf_1 3) 50)) (not (<= 1 v_itHalf_1)))) (<= aux_div_v_main_~main__y~0_14_50 main_~main__y~0))) (and (exists ((aux_div_v_main_~main__y~0_14_85 Int)) (and (< 0 (div (+ (- 1) (* (- 1) main_~main____CPAchecker_TMP_0~0) (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0) (- 2))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (- 1) (* (- 1) main_~main____CPAchecker_TMP_0~0) (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0) (- 2)))) (not (<= 0 v_itHalf_1)) (< (+ v_itHalf_1 (* 2 (* v_itHalf_1 main_~main__y~0)) (* 2 (* v_itHalf_1 v_itHalf_1)) main_~main__y~0) (+ (* 2 aux_div_v_main_~main__y~0_14_85) (* (* v_itHalf_1 aux_div_v_main_~main__y~0_14_85) 4) 50)))) (= (+ (div (+ (- 1) (* (- 1) main_~main____CPAchecker_TMP_0~0) (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0) (- 2)) main_~main__x~0) (+ (* (* (div (+ (- 1) (* (- 1) main_~main____CPAchecker_TMP_0~0) (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0) (- 2)) (+ (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0)) 2) (- 50) (* (* (div (+ (- 1) (* (- 1) main_~main____CPAchecker_TMP_0~0) (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0) (- 2)) (div (+ (- 1) (* (- 1) main_~main____CPAchecker_TMP_0~0) (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0) (- 2))) 2))))) (< main_~main__y~0 (+ 3 main_~main____CPAchecker_TMP_0~0)) (<= (+ main_~main____CPAchecker_TMP_0~0 1) main_~main__y~0) (= (mod (+ main_~main____CPAchecker_TMP_0~0 main_~main__y~0 1) 2) 0)))} is UNKNOWN [2022-04-07 17:22:17,068 WARN L290 TraceCheckUtils]: 9: Hoare triple {253#(or (exists ((aux_div_v_main_~main__y~0_14_50 Int)) (and (= (+ (* 2 aux_div_v_main_~main__y~0_14_50) (* 2 (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50)) 2) (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50)) 2))) (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50)) 2) aux_div_v_main_~main__y~0_14_50) 4)) (+ (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50)) 2) (* 2 (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50)) 2) main_~main__y~0)) 51 main_~main__x~0 main_~main__y~0)) (= (+ (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50)) 2) 2) (* 2 aux_div_v_main_~main__y~0_14_50)) (+ main_~main____CPAchecker_TMP_0~0 main_~main__y~0 1)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_14_50) main_~main__y~0)) (< (+ (* (* v_itHalf_1 aux_div_v_main_~main__y~0_14_50) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 (* v_itHalf_1 main_~main__y~0)) (* v_itHalf_1 3) 50)) (not (<= 1 v_itHalf_1)))) (<= aux_div_v_main_~main__y~0_14_50 main_~main__y~0))) (and (exists ((aux_div_v_main_~main__y~0_14_85 Int)) (and (< 0 (div (+ (- 1) (* (- 1) main_~main____CPAchecker_TMP_0~0) (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0) (- 2))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (- 1) (* (- 1) main_~main____CPAchecker_TMP_0~0) (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0) (- 2)))) (not (<= 0 v_itHalf_1)) (< (+ v_itHalf_1 (* 2 (* v_itHalf_1 main_~main__y~0)) (* 2 (* v_itHalf_1 v_itHalf_1)) main_~main__y~0) (+ (* 2 aux_div_v_main_~main__y~0_14_85) (* (* v_itHalf_1 aux_div_v_main_~main__y~0_14_85) 4) 50)))) (= (+ (div (+ (- 1) (* (- 1) main_~main____CPAchecker_TMP_0~0) (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0) (- 2)) main_~main__x~0) (+ (* (* (div (+ (- 1) (* (- 1) main_~main____CPAchecker_TMP_0~0) (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0) (- 2)) (+ (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0)) 2) (- 50) (* (* (div (+ (- 1) (* (- 1) main_~main____CPAchecker_TMP_0~0) (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0) (- 2)) (div (+ (- 1) (* (- 1) main_~main____CPAchecker_TMP_0~0) (* (- 2) aux_div_v_main_~main__y~0_14_85) main_~main__y~0) (- 2))) 2))))) (< main_~main__y~0 (+ 3 main_~main____CPAchecker_TMP_0~0)) (<= (+ main_~main____CPAchecker_TMP_0~0 1) main_~main__y~0) (= (mod (+ main_~main____CPAchecker_TMP_0~0 main_~main__y~0 1) 2) 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] {257#(or (exists ((aux_div_v_main_~main__y~0_14_85 Int) (aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 Int)) (and (<= (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* 2 main_~main__y~0)) (= (+ (* (- 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) (* 2 aux_div_v_main_~main__y~0_14_85 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85) (- 50) (* (- 2) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) main_~main__y~0) main_~main__x~0) (< 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 main_~main__y~0) (+ (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) 2)) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (< (+ v_itHalf_1 (* 2 (* v_itHalf_1 main_~main__y~0)) (* 2 (* v_itHalf_1 v_itHalf_1)) main_~main__y~0) (+ (* 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 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))))) (<= (+ (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) 2) (* 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 (* 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_14_85 main_~main__y~0)) main_~main__y~0)))) (exists ((aux_div_v_main_~main__y~0_14_50 Int)) (and (= (+ (- 51) (* 3 aux_div_v_main_~main__y~0_14_50) (* 2 aux_div_v_main_~main__y~0_14_50 main_~main__y~0) (* (- 2) main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50)) main_~main__x~0) (<= (+ (* 2 main_~main__y~0) (* 2 (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50)) 51) (+ (* 2 (* aux_div_v_main_~main__y~0_14_50 main_~main__y~0)) (* 3 aux_div_v_main_~main__y~0_14_50))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_14_50) main_~main__y~0)) (< (+ (* (* v_itHalf_1 aux_div_v_main_~main__y~0_14_50) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 (* v_itHalf_1 main_~main__y~0)) (* v_itHalf_1 3) 50)) (not (<= 1 v_itHalf_1)))) (<= aux_div_v_main_~main__y~0_14_50 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_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)) (and (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 main_~main__y~0) (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 4) (* 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 (* 2 (* v_itHalf_1 main_~main__y~0)) (* (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) 4) (* 2 (* aux_div_v_main_~main__y~0_14_85 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) (* 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) (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) 2) (* 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)))) (<= (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* 2 aux_div_main_~main____CPAchecker_TMP_0~0_85))) (< (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) main_~main__y~0) (+ (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_14_85)) (= (+ (* (* (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) main_~main__y~0) aux_div_main_~main____CPAchecker_TMP_0~0_85) 2) (* (- 1) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* 2 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 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) (* (- 2) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) main_~main__y~0)) (* (- 2) aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85) (* 2 (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) main_~main__y~0) aux_div_v_main_~main__y~0_14_85) (- 50) (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) main_~main__y~0) (+ aux_div_main_~main____CPAchecker_TMP_0~0_85 main_~main__x~0)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63)) (< 0 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) (< (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* 2 aux_div_main_~main____CPAchecker_TMP_0~0_85)) (+ 2 (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113))) (< (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) 2) (< (+ (* 2 main_~main__y~0) (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 4)) (+ (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) 2 (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 4))) (< (+ (* 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_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) 4) (* 2 (* aux_div_v_main_~main__y~0_14_85 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) main_~main__y~0) (+ (* (* 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) (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) 2) (* 2 (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85)) (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) 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)) (<= (+ (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 4)) (+ (* 2 main_~main__y~0) (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 4))))) (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)) (and (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)) 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 (* v_itHalf_1 main_~main__y~0)) (* 2 (* aux_div_v_main_~main__y~0_14_50 main_~main__y~0)) (* 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 (* (* v_itHalf_1 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) 4) 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))))) (<= (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* 2 aux_div_main_~main____CPAchecker_TMP_0~0_85))) (<= 0 (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63)) (< 0 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) (< (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* 2 aux_div_main_~main____CPAchecker_TMP_0~0_85)) (+ 2 (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113))) (<= (+ (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) 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) main_~main__y~0)) (< (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) 2) (< (+ (* 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 (* aux_div_v_main_~main__y~0_14_50 main_~main__y~0)) (* 3 aux_div_v_main_~main__y~0_14_50) (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 4)) (+ (* 2 main_~main__y~0) (* 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 (* (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 aux_div_v_main_~main__y~0_14_50) 4))) (= (+ aux_div_main_~main____CPAchecker_TMP_0~0_85 main_~main__x~0) (+ (- 51) (* (* (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) main_~main__y~0) aux_div_main_~main____CPAchecker_TMP_0~0_85) 2) (* (- 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 (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) main_~main__y~0) aux_div_v_main_~main__y~0_14_50) (* 3 aux_div_v_main_~main__y~0_14_50) (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 4) (* (- 2) main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50))))) (exists ((aux_div_v_main_~main__y~0_15_50 Int) (aux_div_v_main_~main__y~0_14_50 Int)) (and (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_15_50) main_~main__y~0)) (not (<= 1 v_itHalf_1)) (< (+ (* 2 main_~main__y~0) (* (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_15_50) 4) (* 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)) 49 (* 2 (* v_itHalf_1 main_~main__y~0)) (* 2 (* aux_div_v_main_~main__y~0_14_50 main_~main__y~0)) (* aux_div_v_main_~main__y~0_15_50 4) (* v_itHalf_1 3))))) (< (+ (* 2 main_~main__y~0) (* (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_15_50) 4) 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)) 49 (* 2 (* aux_div_v_main_~main__y~0_14_50 main_~main__y~0)) (* aux_div_v_main_~main__y~0_15_50 4))) (= (+ (* 2 (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50)) (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) (* 2 aux_div_v_main_~main__y~0_15_50) (* 2 (* aux_div_v_main_~main__y~0_14_50 main_~main__y~0)) (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) main_~main__y~0) 2) main_~main__x~0 50) (+ (* (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_15_50) 4) aux_div_v_main_~main__y~0_14_50 (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) aux_div_v_main_~main__y~0_15_50) 4) (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2)) 2) main_~main__y~0)) (<= (+ aux_div_v_main_~main__y~0_14_50 main_~main__y~0 1) (* 2 aux_div_v_main_~main__y~0_15_50)) (<= aux_div_v_main_~main__y~0_15_50 main_~main__y~0))) (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)) (and (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_15_50) main_~main__y~0)) (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) (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) 2) 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 (* v_itHalf_1 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) (* 2 (* aux_div_v_main_~main__y~0_14_85 main_~main__y~0)) (* v_itHalf_1 3) (* 3 aux_div_v_main_~main__y~0_14_85) main_~main__y~0)))) (< (* aux_div_v_main_~main__y~0_15_50 4) (+ (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* 2 main_~main__y~0) 4)) (<= (+ (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* 2 main_~main__y~0) 2) (* aux_div_v_main_~main__y~0_15_50 4)) (<= aux_div_v_main_~main__y~0_15_50 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)) (* 2 aux_div_v_main_~main__y~0_15_50) (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) 2) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 (* (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_15_50) 4)) (+ 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) (* 2 (* aux_div_v_main_~main__y~0_14_85 main_~main__y~0)) (* 3 aux_div_v_main_~main__y~0_14_85) main_~main__y~0)) (= (+ (* 2 main_~main__y~0) (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) (* 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) 52 (* 2 (* aux_div_v_main_~main__y~0_14_85 main_~main__y~0)) (* 3 aux_div_v_main_~main__y~0_14_85) (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) main_~main__y~0) 2) main_~main__x~0) (+ (* 2 (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71)) (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) 2) (* aux_div_v_main_~main__y~0_15_50 4) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) aux_div_v_main_~main__y~0_15_50) 4) (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2)) 2) (* (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_15_50) 4))) (< (* 2 aux_div_v_main_~main__y~0_15_50) (+ aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_14_85 main_~main__y~0 1)))))} is UNKNOWN [2022-04-07 17:22:17,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {257#(or (exists ((aux_div_v_main_~main__y~0_14_85 Int) (aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 Int)) (and (<= (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* 2 main_~main__y~0)) (= (+ (* (- 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) (* 2 aux_div_v_main_~main__y~0_14_85 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85) (- 50) (* (- 2) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) main_~main__y~0) main_~main__x~0) (< 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 main_~main__y~0) (+ (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) 2)) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (< (+ v_itHalf_1 (* 2 (* v_itHalf_1 main_~main__y~0)) (* 2 (* v_itHalf_1 v_itHalf_1)) main_~main__y~0) (+ (* 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 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))))) (<= (+ (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) 2) (* 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 (* 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_14_85 main_~main__y~0)) main_~main__y~0)))) (exists ((aux_div_v_main_~main__y~0_14_50 Int)) (and (= (+ (- 51) (* 3 aux_div_v_main_~main__y~0_14_50) (* 2 aux_div_v_main_~main__y~0_14_50 main_~main__y~0) (* (- 2) main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50)) main_~main__x~0) (<= (+ (* 2 main_~main__y~0) (* 2 (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50)) 51) (+ (* 2 (* aux_div_v_main_~main__y~0_14_50 main_~main__y~0)) (* 3 aux_div_v_main_~main__y~0_14_50))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_14_50) main_~main__y~0)) (< (+ (* (* v_itHalf_1 aux_div_v_main_~main__y~0_14_50) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 (* v_itHalf_1 main_~main__y~0)) (* v_itHalf_1 3) 50)) (not (<= 1 v_itHalf_1)))) (<= aux_div_v_main_~main__y~0_14_50 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_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)) (and (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 main_~main__y~0) (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 4) (* 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 (* 2 (* v_itHalf_1 main_~main__y~0)) (* (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) 4) (* 2 (* aux_div_v_main_~main__y~0_14_85 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) (* 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) (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) 2) (* 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)))) (<= (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* 2 aux_div_main_~main____CPAchecker_TMP_0~0_85))) (< (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) main_~main__y~0) (+ (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_14_85)) (= (+ (* (* (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) main_~main__y~0) aux_div_main_~main____CPAchecker_TMP_0~0_85) 2) (* (- 1) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* 2 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 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) (* (- 2) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) main_~main__y~0)) (* (- 2) aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85) (* 2 (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) main_~main__y~0) aux_div_v_main_~main__y~0_14_85) (- 50) (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) main_~main__y~0) (+ aux_div_main_~main____CPAchecker_TMP_0~0_85 main_~main__x~0)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63)) (< 0 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) (< (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* 2 aux_div_main_~main____CPAchecker_TMP_0~0_85)) (+ 2 (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113))) (< (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) 2) (< (+ (* 2 main_~main__y~0) (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 4)) (+ (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) 2 (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 4))) (< (+ (* 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_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) 4) (* 2 (* aux_div_v_main_~main__y~0_14_85 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) main_~main__y~0) (+ (* (* 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) (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) 2) (* 2 (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_14_85)) (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) 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)) (<= (+ (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 4)) (+ (* 2 main_~main__y~0) (* aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63 4))))) (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)) (and (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)) 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 (* v_itHalf_1 main_~main__y~0)) (* 2 (* aux_div_v_main_~main__y~0_14_50 main_~main__y~0)) (* 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 (* (* v_itHalf_1 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) 4) 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))))) (<= (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* 2 aux_div_main_~main____CPAchecker_TMP_0~0_85))) (<= 0 (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63)) (< 0 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) (< (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* 2 aux_div_main_~main____CPAchecker_TMP_0~0_85)) (+ 2 (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113))) (<= (+ (* 2 aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) 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) main_~main__y~0)) (< (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) 2) (< (+ (* 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 (* aux_div_v_main_~main__y~0_14_50 main_~main__y~0)) (* 3 aux_div_v_main_~main__y~0_14_50) (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 4)) (+ (* 2 main_~main__y~0) (* 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 (* (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 aux_div_v_main_~main__y~0_14_50) 4))) (= (+ aux_div_main_~main____CPAchecker_TMP_0~0_85 main_~main__x~0) (+ (- 51) (* (* (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) main_~main__y~0) aux_div_main_~main____CPAchecker_TMP_0~0_85) 2) (* (- 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 (+ (* 2 aux_div_aux_mod_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113_63) (* (- 2) aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113) main_~main__y~0) aux_div_v_main_~main__y~0_14_50) (* 3 aux_div_v_main_~main__y~0_14_50) (* aux_div_aux_mod_main_~main____CPAchecker_TMP_0~0_85_113 4) (* (- 2) main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50))))) (exists ((aux_div_v_main_~main__y~0_15_50 Int) (aux_div_v_main_~main__y~0_14_50 Int)) (and (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_15_50) main_~main__y~0)) (not (<= 1 v_itHalf_1)) (< (+ (* 2 main_~main__y~0) (* (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_15_50) 4) (* 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)) 49 (* 2 (* v_itHalf_1 main_~main__y~0)) (* 2 (* aux_div_v_main_~main__y~0_14_50 main_~main__y~0)) (* aux_div_v_main_~main__y~0_15_50 4) (* v_itHalf_1 3))))) (< (+ (* 2 main_~main__y~0) (* (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_15_50) 4) 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)) 49 (* 2 (* aux_div_v_main_~main__y~0_14_50 main_~main__y~0)) (* aux_div_v_main_~main__y~0_15_50 4))) (= (+ (* 2 (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_14_50)) (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) (* 2 aux_div_v_main_~main__y~0_15_50) (* 2 (* aux_div_v_main_~main__y~0_14_50 main_~main__y~0)) (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) main_~main__y~0) 2) main_~main__x~0 50) (+ (* (* aux_div_v_main_~main__y~0_14_50 aux_div_v_main_~main__y~0_15_50) 4) aux_div_v_main_~main__y~0_14_50 (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) aux_div_v_main_~main__y~0_15_50) 4) (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2)) 2) main_~main__y~0)) (<= (+ aux_div_v_main_~main__y~0_14_50 main_~main__y~0 1) (* 2 aux_div_v_main_~main__y~0_15_50)) (<= aux_div_v_main_~main__y~0_15_50 main_~main__y~0))) (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)) (and (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~main__y~0_15_50) main_~main__y~0)) (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) (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) 2) 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 (* v_itHalf_1 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) (* 2 (* aux_div_v_main_~main__y~0_14_85 main_~main__y~0)) (* v_itHalf_1 3) (* 3 aux_div_v_main_~main__y~0_14_85) main_~main__y~0)))) (< (* aux_div_v_main_~main__y~0_15_50 4) (+ (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* 2 main_~main__y~0) 4)) (<= (+ (* 2 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71) (* 2 main_~main__y~0) 2) (* aux_div_v_main_~main__y~0_15_50 4)) (<= aux_div_v_main_~main__y~0_15_50 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)) (* 2 aux_div_v_main_~main__y~0_15_50) (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) 2) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 (* (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_15_50) 4)) (+ 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) (* 2 (* aux_div_v_main_~main__y~0_14_85 main_~main__y~0)) (* 3 aux_div_v_main_~main__y~0_14_85) main_~main__y~0)) (= (+ (* 2 main_~main__y~0) (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) (* 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) 52 (* 2 (* aux_div_v_main_~main__y~0_14_85 main_~main__y~0)) (* 3 aux_div_v_main_~main__y~0_14_85) (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) main_~main__y~0) 2) main_~main__x~0) (+ (* 2 (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71)) (* (* aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 main_~main__y~0) 2) (* aux_div_v_main_~main__y~0_15_50 4) aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) aux_div_v_main_~main__y~0_15_50) 4) (* (* (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2) (div (+ (* 2 main_~main__y~0) (* (- 2) aux_div_v_main_~main__y~0_15_50)) 2)) 2) (* (* aux_div_v_main_~main__y~0_14_85 aux_div_v_main_~main__y~0_15_50) 4))) (< (* 2 aux_div_v_main_~main__y~0_15_50) (+ aux_div_v_main_~main____CPAchecker_TMP_0~0_6_71 aux_div_v_main_~main__y~0_14_85 main_~main__y~0 1)))))} [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] {261#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-07 17:22:17,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {261#(<= 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[] {224#false} is VALID [2022-04-07 17:22:17,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#false} [56] L48-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#false} is VALID [2022-04-07 17:22:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:22:17,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:22:20,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#false} [56] L48-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#false} is VALID [2022-04-07 17:22:20,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {261#(<= 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[] {224#false} is VALID [2022-04-07 17:22:20,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {274#(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] {261#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-07 17:22:20,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#(or (< main_~main__x~0 0) (< 0 main_~main__y~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] {274#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-07 17:22:20,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#(or (< main_~main__x~0 0) (< 0 main_~main__y~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] {274#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-07 17:22:20,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#(or (< main_~main__x~0 0) (< 0 main_~main__y~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[] {274#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-07 17:22:20,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#(or (< main_~main__x~0 0) (< 0 main_~main__y~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[] {274#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-07 17:22:20,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {223#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] {274#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-07 17:22:20,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:22:20,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223#true} {223#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:22:20,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:22:20,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_144~0_2 0) (= 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))) 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_144~0=v_~__return_144~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_144~0, #NULL.base] {223#true} is VALID [2022-04-07 17:22:20,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {223#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:22:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 17:22:20,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:22:20,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428841442] [2022-04-07 17:22:20,379 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 17:22:20,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565686355] [2022-04-07 17:22:20,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565686355] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:22:20,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 17:22:20,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-04-07 17:22:20,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384705897] [2022-04-07 17:22:20,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:22:20,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-07 17:22:20,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:22:20,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-07 17:22:20,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:22:20,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 17:22:20,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:22:20,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 17:22:20,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=25, Unknown=3, NotChecked=0, Total=42 [2022-04-07 17:22:20,402 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-07 17:22:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:22:20,606 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-07 17:22:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 17:22:20,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-07 17:22:20,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:22:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-07 17:22:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-04-07 17:22:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-07 17:22:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-04-07 17:22:20,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 11 transitions. [2022-04-07 17:22:20,637 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-07 17:22:20,638 INFO L225 Difference]: With dead ends: 12 [2022-04-07 17:22:20,638 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:22:20,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=18, Invalid=35, Unknown=3, NotChecked=0, Total=56 [2022-04-07 17:22:20,639 INFO L913 BasicCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:22:20,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-07 17:22:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:22:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:22:20,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:22:20,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:22:20,640 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:22:20,640 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:22:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:22:20,640 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:22:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:22:20,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:22:20,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:22:20,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:22:20,641 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:22:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:22:20,641 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:22:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:22:20,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:22:20,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:22:20,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:22:20,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:22:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:22:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:22:20,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-07 17:22:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:22:20,641 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:22:20,642 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-07 17:22:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:22:20,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:22:20,644 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 17:22:20,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 17:22:20,854 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 17:22:20,856 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-07 17:22:20,857 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:22:20,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:22:20 BasicIcfg [2022-04-07 17:22:20,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:22:20,864 INFO L158 Benchmark]: Toolchain (without parser) took 874123.23ms. Allocated memory was 179.3MB in the beginning and 227.5MB in the end (delta: 48.2MB). Free memory was 121.8MB in the beginning and 155.7MB in the end (delta: -33.9MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2022-04-07 17:22:20,865 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:22:20,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.29ms. Allocated memory was 179.3MB in the beginning and 227.5MB in the end (delta: 48.2MB). Free memory was 121.6MB in the beginning and 199.1MB in the end (delta: -77.4MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-07 17:22:20,866 INFO L158 Benchmark]: Boogie Preprocessor took 18.13ms. Allocated memory is still 227.5MB. Free memory was 199.1MB in the beginning and 197.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:22:20,866 INFO L158 Benchmark]: RCFGBuilder took 267.07ms. Allocated memory is still 227.5MB. Free memory was 197.5MB in the beginning and 186.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 17:22:20,866 INFO L158 Benchmark]: IcfgTransformer took 1750.97ms. Allocated memory is still 227.5MB. Free memory was 186.5MB in the beginning and 143.5MB in the end (delta: 43.0MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2022-04-07 17:22:20,866 INFO L158 Benchmark]: TraceAbstraction took 871883.17ms. Allocated memory is still 227.5MB. Free memory was 143.0MB in the beginning and 155.7MB in the end (delta: -12.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:22:20,867 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.29ms. Allocated memory was 179.3MB in the beginning and 227.5MB in the end (delta: 48.2MB). Free memory was 121.6MB in the beginning and 199.1MB in the end (delta: -77.4MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.13ms. Allocated memory is still 227.5MB. Free memory was 199.1MB in the beginning and 197.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 267.07ms. Allocated memory is still 227.5MB. Free memory was 197.5MB in the beginning and 186.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 1750.97ms. Allocated memory is still 227.5MB. Free memory was 186.5MB in the beginning and 143.5MB in the end (delta: 43.0MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * TraceAbstraction took 871883.17ms. Allocated memory is still 227.5MB. Free memory was 143.0MB in the beginning and 155.7MB in the end (delta: -12.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 871.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 31 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 47.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 864.6s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 56 ConstructedInterpolants, 3 QuantifiedInterpolants, 1718 SizeOfPredicates, 11 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 17:22:21,085 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-07 17:22:21,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...