./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:03:01,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:03:01,837 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:03:01,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:03:01,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:03:01,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:03:01,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:03:01,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:03:01,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:03:01,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:03:01,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:03:01,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:03:01,876 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:03:01,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:03:01,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:03:01,878 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:03:01,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:03:01,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:03:01,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:03:01,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:03:01,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:03:01,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:03:01,889 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:03:01,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:03:01,895 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:03:01,896 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:03:01,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:03:01,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:03:01,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:01,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:03:01,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:03:01,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:03:01,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:03:01,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:03:01,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:03:01,901 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:03:01,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:03:01,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:03:01,902 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:03:01,902 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 [2023-11-06 23:03:02,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:03:02,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:03:02,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:03:02,277 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:03:02,277 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:03:02,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2023-11-06 23:03:05,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:03:05,771 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:03:05,771 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2023-11-06 23:03:05,780 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/data/46641627c/790ad3168c5d4b5aaef86b59fe99e864/FLAG09df6e71d [2023-11-06 23:03:05,799 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/data/46641627c/790ad3168c5d4b5aaef86b59fe99e864 [2023-11-06 23:03:05,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:03:05,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:03:05,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:05,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:03:05,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:03:05,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:05" (1/1) ... [2023-11-06 23:03:05,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d93f838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:05, skipping insertion in model container [2023-11-06 23:03:05,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:05" (1/1) ... [2023-11-06 23:03:05,851 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:03:05,992 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2023-11-06 23:03:06,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:06,021 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:03:06,034 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2023-11-06 23:03:06,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:06,057 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:03:06,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06 WrapperNode [2023-11-06 23:03:06,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:06,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:06,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:03:06,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:03:06,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06" (1/1) ... [2023-11-06 23:03:06,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06" (1/1) ... [2023-11-06 23:03:06,099 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-11-06 23:03:06,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:06,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:03:06,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:03:06,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:03:06,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06" (1/1) ... [2023-11-06 23:03:06,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06" (1/1) ... [2023-11-06 23:03:06,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06" (1/1) ... [2023-11-06 23:03:06,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06" (1/1) ... [2023-11-06 23:03:06,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06" (1/1) ... [2023-11-06 23:03:06,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06" (1/1) ... [2023-11-06 23:03:06,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06" (1/1) ... [2023-11-06 23:03:06,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06" (1/1) ... [2023-11-06 23:03:06,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:03:06,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:03:06,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:03:06,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:03:06,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06" (1/1) ... [2023-11-06 23:03:06,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:06,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:06,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:03:06,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:03:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:03:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:03:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:03:06,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:03:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 23:03:06,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 23:03:06,271 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:03:06,273 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:03:06,437 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:03:06,447 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:03:06,448 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:03:06,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:06 BoogieIcfgContainer [2023-11-06 23:03:06,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:03:06,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:03:06,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:03:06,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:03:06,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:03:05" (1/3) ... [2023-11-06 23:03:06,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f1c545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:06, skipping insertion in model container [2023-11-06 23:03:06,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:06" (2/3) ... [2023-11-06 23:03:06,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f1c545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:06, skipping insertion in model container [2023-11-06 23:03:06,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:06" (3/3) ... [2023-11-06 23:03:06,464 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2023-11-06 23:03:06,480 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:03:06,481 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:03:06,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:03:06,540 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4814c19b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:03:06,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:03:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 23:03:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 23:03:06,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:06,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:06,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:06,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2023-11-06 23:03:06,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:06,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185968984] [2023-11-06 23:03:06,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:06,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:06,678 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:03:06,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [64296603] [2023-11-06 23:03:06,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:06,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:06,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:06,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:06,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:03:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:06,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 23:03:06,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:07,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:07,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185968984] [2023-11-06 23:03:07,085 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:03:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64296603] [2023-11-06 23:03:07,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64296603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:07,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:07,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:03:07,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652062504] [2023-11-06 23:03:07,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:07,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:07,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:07,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:07,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:07,149 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:07,347 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2023-11-06 23:03:07,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:03:07,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 23:03:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:07,359 INFO L225 Difference]: With dead ends: 52 [2023-11-06 23:03:07,359 INFO L226 Difference]: Without dead ends: 25 [2023-11-06 23:03:07,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:03:07,368 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:07,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 62 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-06 23:03:07,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-11-06 23:03:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 23:03:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-11-06 23:03:07,408 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2023-11-06 23:03:07,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:07,408 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-11-06 23:03:07,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-11-06 23:03:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 23:03:07,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:07,410 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:07,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:07,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-06 23:03:07,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:07,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:07,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2023-11-06 23:03:07,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:07,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082963001] [2023-11-06 23:03:07,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:07,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:07,635 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:03:07,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1511870400] [2023-11-06 23:03:07,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:07,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:07,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:07,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:07,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:03:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:07,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 23:03:07,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:07,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:03:08,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:08,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082963001] [2023-11-06 23:03:08,130 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:03:08,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511870400] [2023-11-06 23:03:08,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511870400] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:08,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:03:08,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-11-06 23:03:08,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145595737] [2023-11-06 23:03:08,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:08,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 23:03:08,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:08,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 23:03:08,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:03:08,135 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 23:03:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:08,332 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-11-06 23:03:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:03:08,333 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-06 23:03:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:08,334 INFO L225 Difference]: With dead ends: 41 [2023-11-06 23:03:08,335 INFO L226 Difference]: Without dead ends: 34 [2023-11-06 23:03:08,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-11-06 23:03:08,340 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:08,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 70 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-06 23:03:08,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-11-06 23:03:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 23:03:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-11-06 23:03:08,360 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2023-11-06 23:03:08,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:08,361 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-06 23:03:08,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 23:03:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-11-06 23:03:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 23:03:08,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:08,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:08,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:08,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-06 23:03:08,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:08,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:08,572 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2023-11-06 23:03:08,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:08,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871915978] [2023-11-06 23:03:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:08,600 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:03:08,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [973972533] [2023-11-06 23:03:08,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:08,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:08,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:08,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:08,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:03:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:08,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:03:08,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:08,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:08,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:08,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871915978] [2023-11-06 23:03:08,775 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:03:08,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973972533] [2023-11-06 23:03:08,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973972533] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:08,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:03:08,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-11-06 23:03:08,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729337463] [2023-11-06 23:03:08,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:08,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:03:08,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:08,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:03:08,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:03:08,780 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 23:03:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:08,878 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-11-06 23:03:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:03:08,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-06 23:03:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:08,880 INFO L225 Difference]: With dead ends: 73 [2023-11-06 23:03:08,880 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 23:03:08,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:03:08,882 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:08,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 91 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 23:03:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-11-06 23:03:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 23:03:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-11-06 23:03:08,900 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2023-11-06 23:03:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:08,901 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-11-06 23:03:08,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 23:03:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-11-06 23:03:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 23:03:08,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:08,902 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:08,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 23:03:09,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:09,109 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:09,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2023-11-06 23:03:09,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:09,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264758495] [2023-11-06 23:03:09,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:09,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:09,123 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:03:09,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821941169] [2023-11-06 23:03:09,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:09,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:09,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:09,125 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:09,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 23:03:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:09,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-06 23:03:09,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 23:03:09,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:03:10,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:10,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264758495] [2023-11-06 23:03:10,047 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:03:10,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821941169] [2023-11-06 23:03:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821941169] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:10,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:03:10,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-11-06 23:03:10,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511084383] [2023-11-06 23:03:10,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:10,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 23:03:10,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:10,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 23:03:10,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-11-06 23:03:10,051 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 23:03:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:10,975 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2023-11-06 23:03:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 23:03:10,976 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2023-11-06 23:03:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:10,977 INFO L225 Difference]: With dead ends: 65 [2023-11-06 23:03:10,977 INFO L226 Difference]: Without dead ends: 57 [2023-11-06 23:03:10,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-11-06 23:03:10,980 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:10,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 135 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:03:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-06 23:03:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-11-06 23:03:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 23:03:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-11-06 23:03:10,997 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2023-11-06 23:03:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:10,998 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-11-06 23:03:10,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 23:03:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-11-06 23:03:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-06 23:03:11,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:11,000 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:11,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:11,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:11,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:11,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2023-11-06 23:03:11,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:11,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420097994] [2023-11-06 23:03:11,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:11,220 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:03:11,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630025915] [2023-11-06 23:03:11,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:11,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:11,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:11,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:11,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 23:03:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:11,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 23:03:11,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:11,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 23:03:11,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:11,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420097994] [2023-11-06 23:03:11,563 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:03:11,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630025915] [2023-11-06 23:03:11,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630025915] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:11,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:03:11,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-11-06 23:03:11,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511848847] [2023-11-06 23:03:11,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:11,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 23:03:11,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:11,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 23:03:11,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:03:11,571 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 23:03:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:11,785 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-11-06 23:03:11,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 23:03:11,786 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2023-11-06 23:03:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:11,793 INFO L225 Difference]: With dead ends: 116 [2023-11-06 23:03:11,793 INFO L226 Difference]: Without dead ends: 110 [2023-11-06 23:03:11,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-11-06 23:03:11,795 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:11,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 146 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-06 23:03:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-06 23:03:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.125) internal successors, (99), 88 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 23:03:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2023-11-06 23:03:11,855 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2023-11-06 23:03:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:11,855 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2023-11-06 23:03:11,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 23:03:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2023-11-06 23:03:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 23:03:11,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:11,864 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:11,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:12,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:12,065 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:12,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:12,066 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2023-11-06 23:03:12,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:12,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618931062] [2023-11-06 23:03:12,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:12,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:12,085 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:03:12,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1701714661] [2023-11-06 23:03:12,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:03:12,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:12,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:12,087 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:12,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 23:03:12,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:03:12,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:03:12,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 23:03:12,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:12,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 23:03:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618931062] [2023-11-06 23:03:12,825 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:03:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701714661] [2023-11-06 23:03:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701714661] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:12,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:03:12,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-11-06 23:03:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251318877] [2023-11-06 23:03:12,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:12,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 23:03:12,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:12,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 23:03:12,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-11-06 23:03:12,830 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 23:03:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:13,378 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2023-11-06 23:03:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-06 23:03:13,379 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 109 [2023-11-06 23:03:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:13,384 INFO L225 Difference]: With dead ends: 236 [2023-11-06 23:03:13,384 INFO L226 Difference]: Without dead ends: 230 [2023-11-06 23:03:13,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-11-06 23:03:13,387 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 166 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:13,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 215 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-06 23:03:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-11-06 23:03:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 1.125) internal successors, (207), 184 states have internal predecessors, (207), 23 states have call successors, (23), 23 states have call predecessors, (23), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 23:03:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2023-11-06 23:03:13,456 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2023-11-06 23:03:13,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:13,458 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2023-11-06 23:03:13,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 23:03:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2023-11-06 23:03:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-11-06 23:03:13,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:13,470 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:13,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:13,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:13,676 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:13,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:13,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2023-11-06 23:03:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:13,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375484195] [2023-11-06 23:03:13,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:13,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:13,702 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:03:13,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753462668] [2023-11-06 23:03:13,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:03:13,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:13,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:13,704 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:13,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 23:03:13,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 23:03:13,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:03:13,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 23:03:13,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-11-06 23:03:14,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-11-06 23:03:14,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:14,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375484195] [2023-11-06 23:03:14,620 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:03:14,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753462668] [2023-11-06 23:03:14,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753462668] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:14,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:03:14,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-06 23:03:14,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497074367] [2023-11-06 23:03:14,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:14,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 23:03:14,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:14,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 23:03:14,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-11-06 23:03:14,626 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 23:03:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:14,917 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2023-11-06 23:03:14,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:03:14,919 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 229 [2023-11-06 23:03:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:14,928 INFO L225 Difference]: With dead ends: 449 [2023-11-06 23:03:14,929 INFO L226 Difference]: Without dead ends: 443 [2023-11-06 23:03:14,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-11-06 23:03:14,931 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:14,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-11-06 23:03:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2023-11-06 23:03:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 352 states have (on average 1.125) internal successors, (396), 352 states have internal predecessors, (396), 44 states have call successors, (44), 44 states have call predecessors, (44), 43 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-11-06 23:03:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2023-11-06 23:03:15,038 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2023-11-06 23:03:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:15,040 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2023-11-06 23:03:15,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 23:03:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2023-11-06 23:03:15,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-11-06 23:03:15,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:15,047 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:15,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:15,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:15,254 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:15,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2023-11-06 23:03:15,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:15,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305578654] [2023-11-06 23:03:15,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:15,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:15,287 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:03:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050509795] [2023-11-06 23:03:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:15,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:15,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:15,289 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:15,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 23:03:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:15,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-06 23:03:15,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:16,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-06 23:03:17,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:17,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305578654] [2023-11-06 23:03:17,306 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:03:17,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050509795] [2023-11-06 23:03:17,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050509795] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:17,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:03:17,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-11-06 23:03:17,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105547092] [2023-11-06 23:03:17,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:17,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-06 23:03:17,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:17,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-06 23:03:17,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-11-06 23:03:17,313 INFO L87 Difference]: Start difference. First operand 440 states and 483 transitions. Second operand has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 23:03:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:19,246 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2023-11-06 23:03:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-11-06 23:03:19,247 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Word has length 229 [2023-11-06 23:03:19,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:19,259 INFO L225 Difference]: With dead ends: 929 [2023-11-06 23:03:19,259 INFO L226 Difference]: Without dead ends: 923 [2023-11-06 23:03:19,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-11-06 23:03:19,267 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 337 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:19,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 383 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:03:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2023-11-06 23:03:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2023-11-06 23:03:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 736 states have (on average 1.125) internal successors, (828), 736 states have internal predecessors, (828), 92 states have call successors, (92), 92 states have call predecessors, (92), 91 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2023-11-06 23:03:19,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2023-11-06 23:03:19,470 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2023-11-06 23:03:19,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:19,471 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2023-11-06 23:03:19,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 23:03:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2023-11-06 23:03:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2023-11-06 23:03:19,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:19,486 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:19,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:19,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 23:03:19,696 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:19,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2023-11-06 23:03:19,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:19,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733154678] [2023-11-06 23:03:19,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:19,739 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:03:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826267762] [2023-11-06 23:03:19,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:03:19,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:19,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:19,741 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:19,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 23:03:20,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:03:20,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:03:20,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-06 23:03:20,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:22,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-11-06 23:03:25,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:25,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733154678] [2023-11-06 23:03:25,654 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:03:25,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826267762] [2023-11-06 23:03:25,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826267762] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:25,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:03:25,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2023-11-06 23:03:25,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76909767] [2023-11-06 23:03:25,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:25,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-11-06 23:03:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-11-06 23:03:25,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2023-11-06 23:03:25,668 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2023-11-06 23:03:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:32,537 INFO L93 Difference]: Finished difference Result 1889 states and 2123 transitions. [2023-11-06 23:03:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2023-11-06 23:03:32,546 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Word has length 469 [2023-11-06 23:03:32,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:32,564 INFO L225 Difference]: With dead ends: 1889 [2023-11-06 23:03:32,565 INFO L226 Difference]: Without dead ends: 1883 [2023-11-06 23:03:32,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2023-11-06 23:03:32,579 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 857 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:32,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 720 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 23:03:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2023-11-06 23:03:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1880. [2023-11-06 23:03:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1504 states have (on average 1.125) internal successors, (1692), 1504 states have internal predecessors, (1692), 188 states have call successors, (188), 188 states have call predecessors, (188), 187 states have return successors, (187), 187 states have call predecessors, (187), 187 states have call successors, (187) [2023-11-06 23:03:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2067 transitions. [2023-11-06 23:03:32,880 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2067 transitions. Word has length 469 [2023-11-06 23:03:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:32,881 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 2067 transitions. [2023-11-06 23:03:32,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2023-11-06 23:03:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2067 transitions. [2023-11-06 23:03:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2023-11-06 23:03:32,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:32,929 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 94, 93, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:32,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:33,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:33,142 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:33,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:33,143 INFO L85 PathProgramCache]: Analyzing trace with hash 866618004, now seen corresponding path program 3 times [2023-11-06 23:03:33,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:33,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846464461] [2023-11-06 23:03:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:33,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:33,222 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:03:33,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [926693021] [2023-11-06 23:03:33,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:03:33,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:33,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:33,225 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:33,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 23:03:34,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 95 check-sat command(s) [2023-11-06 23:03:34,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:03:34,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 2309 conjuncts, 191 conjunts are in the unsatisfiable core [2023-11-06 23:03:34,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 43898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:40,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 26414 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2023-11-06 23:03:45,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:45,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846464461] [2023-11-06 23:03:45,558 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:03:45,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926693021] [2023-11-06 23:03:45,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926693021] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:45,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:03:45,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2023-11-06 23:03:45,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461682121] [2023-11-06 23:03:45,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:45,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-11-06 23:03:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:45,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-11-06 23:03:45,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2023-11-06 23:03:45,607 INFO L87 Difference]: Start difference. First operand 1880 states and 2067 transitions. Second operand has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2023-11-06 23:03:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:52,885 INFO L93 Difference]: Finished difference Result 2009 states and 2213 transitions. [2023-11-06 23:03:52,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2023-11-06 23:03:52,887 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) Word has length 949 [2023-11-06 23:03:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:52,914 INFO L225 Difference]: With dead ends: 2009 [2023-11-06 23:03:52,915 INFO L226 Difference]: Without dead ends: 2003 [2023-11-06 23:03:52,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1704 SyntacticMatches, 90 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9505 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2023-11-06 23:03:52,922 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 352 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:52,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 801 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 23:03:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2023-11-06 23:03:53,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 2000. [2023-11-06 23:03:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1600 states have (on average 1.125) internal successors, (1800), 1600 states have internal predecessors, (1800), 200 states have call successors, (200), 200 states have call predecessors, (200), 199 states have return successors, (199), 199 states have call predecessors, (199), 199 states have call successors, (199) [2023-11-06 23:03:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2199 transitions. [2023-11-06 23:03:53,330 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2199 transitions. Word has length 949 [2023-11-06 23:03:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:53,332 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2199 transitions. [2023-11-06 23:03:53,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2023-11-06 23:03:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2199 transitions. [2023-11-06 23:03:53,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2023-11-06 23:03:53,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:53,354 INFO L195 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:53,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:53,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 23:03:53,567 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:53,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:53,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1685422910, now seen corresponding path program 4 times [2023-11-06 23:03:53,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:53,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609180717] [2023-11-06 23:03:53,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:53,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:53,650 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:03:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856600212] [2023-11-06 23:03:53,652 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 23:03:53,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:53,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:53,653 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:53,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 23:03:54,374 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 23:03:54,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 23:03:54,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:03:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:03:55,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:03:55,931 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:03:55,932 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:03:55,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-06 23:03:56,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:56,154 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2023-11-06 23:03:56,161 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:03:56,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:03:56 BoogieIcfgContainer [2023-11-06 23:03:56,471 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:03:56,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:03:56,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:03:56,473 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:03:56,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:06" (3/4) ... [2023-11-06 23:03:56,474 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 23:03:56,781 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:03:56,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:03:56,782 INFO L158 Benchmark]: Toolchain (without parser) took 50971.57ms. Allocated memory was 142.6MB in the beginning and 522.2MB in the end (delta: 379.6MB). Free memory was 96.4MB in the beginning and 360.6MB in the end (delta: -264.2MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. [2023-11-06 23:03:56,782 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:03:56,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.94ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 85.3MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 23:03:56,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.90ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:03:56,783 INFO L158 Benchmark]: Boogie Preprocessor took 20.38ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:03:56,784 INFO L158 Benchmark]: RCFGBuilder took 331.31ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 70.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 23:03:56,784 INFO L158 Benchmark]: TraceAbstraction took 50016.03ms. Allocated memory was 142.6MB in the beginning and 522.2MB in the end (delta: 379.6MB). Free memory was 70.1MB in the beginning and 393.6MB in the end (delta: -323.5MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2023-11-06 23:03:56,785 INFO L158 Benchmark]: Witness Printer took 309.24ms. Allocated memory is still 522.2MB. Free memory was 393.6MB in the beginning and 360.6MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-06 23:03:56,787 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.94ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 85.3MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.90ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.38ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.31ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 70.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 50016.03ms. Allocated memory was 142.6MB in the beginning and 522.2MB in the end (delta: 379.6MB). Free memory was 70.1MB in the beginning and 393.6MB in the end (delta: -323.5MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * Witness Printer took 309.24ms. Allocated memory is still 522.2MB. Free memory was 393.6MB in the beginning and 360.6MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=2147483600, Y=10737418, counter=0, v=-2126008764, x=0, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=0, counter=1, v=-2126008764, x=0, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=1, v=-2126008764, x=0, x=0, x=0, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=1, v=-2126008764, x=0, x=0, x=0, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=1, v=-2126008764, x=0, x=0, x=0, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=1, v=-2104533928, x=0, x=0, x=0, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=1, v=-2104533928, x=0, x=0, x=1, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=1, counter=2, v=-2104533928, x=0, x=0, x=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=2, v=-2104533928, x=0, x=1, x=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=2, v=-2104533928, x=0, x=1, x=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=2, v=-2104533928, x=0, x=1, x=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=2, v=-2083059092, x=0, x=1, x=10737418, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=2, v=-2083059092, x=0, x=10737418, x=2, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=2, counter=3, v=-2083059092, x=0, x=10737418, x=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=3, v=-2083059092, x=0, x=2, x=21474836, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=3, v=-2083059092, x=0, x=2, x=21474836, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=3, v=-2083059092, x=0, x=2, x=21474836, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=3, v=-2061584256, x=0, x=2, x=21474836, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=3, v=-2061584256, x=0, x=21474836, x=3, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=3, counter=4, v=-2061584256, x=0, x=21474836, x=3, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=4, v=-2061584256, x=0, x=3, x=32212254, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=4, v=-2061584256, x=0, x=3, x=32212254, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=4, v=-2061584256, x=0, x=3, x=32212254, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=4, v=-2040109420, x=0, x=3, x=32212254, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=4, v=-2040109420, x=0, x=32212254, x=4, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=4, counter=5, v=-2040109420, x=0, x=32212254, x=4, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=5, v=-2040109420, x=0, x=4, x=42949672, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=5, v=-2040109420, x=0, x=4, x=42949672, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=5, v=-2040109420, x=0, x=4, x=42949672, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=5, v=-2018634584, x=0, x=4, x=42949672, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=5, v=-2018634584, x=0, x=42949672, x=5, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=5, counter=6, v=-2018634584, x=0, x=42949672, x=5, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=6, v=-2018634584, x=0, x=5, x=53687090, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=6, v=-2018634584, x=0, x=5, x=53687090, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=6, v=-2018634584, x=0, x=5, x=53687090, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=6, v=-1997159748, x=0, x=5, x=53687090, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=6, v=-1997159748, x=0, x=53687090, x=6, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=6, counter=7, v=-1997159748, x=0, x=53687090, x=6, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=7, v=-1997159748, x=0, x=6, x=64424508, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=7, v=-1997159748, x=0, x=6, x=64424508, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=7, v=-1997159748, x=0, x=6, x=64424508, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=7, v=-1975684912, x=0, x=6, x=64424508, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=7, v=-1975684912, x=0, x=64424508, x=7, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=7, counter=8, v=-1975684912, x=0, x=64424508, x=7, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=8, v=-1975684912, x=0, x=7, x=75161926, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=8, v=-1975684912, x=0, x=7, x=75161926, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=8, v=-1975684912, x=0, x=7, x=75161926, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=8, v=-1954210076, x=0, x=7, x=75161926, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=8, v=-1954210076, x=0, x=75161926, x=8, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=8, counter=9, v=-1954210076, x=0, x=75161926, x=8, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=9, v=-1954210076, x=0, x=8, x=85899344, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=9, v=-1954210076, x=0, x=8, x=85899344, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=9, v=-1954210076, x=0, x=8, x=85899344, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=9, v=-1932735240, x=0, x=8, x=85899344, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=9, v=-1932735240, x=0, x=85899344, x=9, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=9, counter=10, v=-1932735240, x=0, x=85899344, x=9, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=10, v=-1932735240, x=0, x=9, x=96636762, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=10, v=-1932735240, x=0, x=9, x=96636762, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=10, v=-1932735240, x=0, x=9, x=96636762, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=10, v=-1911260404, x=0, x=9, x=96636762, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=10, v=-1911260404, x=0, x=10, x=96636762, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=10, counter=11, v=-1911260404, x=0, x=10, x=96636762, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=11, v=-1911260404, x=0, x=10, x=107374180, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=11, v=-1911260404, x=0, x=10, x=107374180, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=11, v=-1911260404, x=0, x=10, x=107374180, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=11, v=-1889785568, x=0, x=10, x=107374180, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=11, v=-1889785568, x=0, x=107374180, x=11, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=11, counter=12, v=-1889785568, x=0, x=107374180, x=11, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=12, v=-1889785568, x=0, x=11, x=118111598, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=12, v=-1889785568, x=0, x=11, x=118111598, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=12, v=-1889785568, x=0, x=11, x=118111598, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=12, v=-1868310732, x=0, x=11, x=118111598, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=12, v=-1868310732, x=0, x=118111598, x=12, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=12, counter=13, v=-1868310732, x=0, x=118111598, x=12, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=13, v=-1868310732, x=0, x=12, x=128849016, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=13, v=-1868310732, x=0, x=12, x=128849016, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=13, v=-1868310732, x=0, x=12, x=128849016, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=13, v=-1846835896, x=0, x=12, x=128849016, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=13, v=-1846835896, x=0, x=128849016, x=13, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=13, counter=14, v=-1846835896, x=0, x=128849016, x=13, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=14, v=-1846835896, x=0, x=13, x=139586434, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=14, v=-1846835896, x=0, x=13, x=139586434, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=14, v=-1846835896, x=0, x=13, x=139586434, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=14, v=-1825361060, x=0, x=13, x=139586434, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=14, v=-1825361060, x=0, x=139586434, x=14, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=14, counter=15, v=-1825361060, x=0, x=139586434, x=14, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=15, v=-1825361060, x=0, x=14, x=150323852, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=15, v=-1825361060, x=0, x=14, x=150323852, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=15, v=-1825361060, x=0, x=14, x=150323852, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=15, v=-1803886224, x=0, x=14, x=150323852, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=15, v=-1803886224, x=0, x=15, x=150323852, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=15, counter=16, v=-1803886224, x=0, x=15, x=150323852, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=16, v=-1803886224, x=0, x=15, x=161061270, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=16, v=-1803886224, x=0, x=15, x=161061270, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=16, v=-1803886224, x=0, x=15, x=161061270, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=16, v=-1782411388, x=0, x=15, x=161061270, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=16, v=-1782411388, x=0, x=16, x=161061270, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=16, counter=17, v=-1782411388, x=0, x=16, x=161061270, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=17, v=-1782411388, x=0, x=16, x=171798688, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=17, v=-1782411388, x=0, x=16, x=171798688, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=17, v=-1782411388, x=0, x=16, x=171798688, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=17, v=-1760936552, x=0, x=16, x=171798688, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=17, v=-1760936552, x=0, x=17, x=171798688, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=17, counter=18, v=-1760936552, x=0, x=17, x=171798688, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=18, v=-1760936552, x=0, x=17, x=182536106, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=18, v=-1760936552, x=0, x=17, x=182536106, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=18, v=-1760936552, x=0, x=17, x=182536106, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=18, v=-1739461716, x=0, x=17, x=182536106, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=18, v=-1739461716, x=0, x=18, x=182536106, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=18, counter=19, v=-1739461716, x=0, x=18, x=182536106, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=19, v=-1739461716, x=0, x=18, x=193273524, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=19, v=-1739461716, x=0, x=18, x=193273524, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=19, v=-1739461716, x=0, x=18, x=193273524, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=19, v=-1717986880, x=0, x=18, x=193273524, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=19, v=-1717986880, x=0, x=19, x=193273524, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=19, counter=20, v=-1717986880, x=0, x=19, x=193273524, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=20, v=-1717986880, x=0, x=19, x=204010942, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=20, v=-1717986880, x=0, x=19, x=204010942, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=20, v=-1717986880, x=0, x=19, x=204010942, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=20, v=-1696512044, x=0, x=19, x=204010942, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=20, v=-1696512044, x=0, x=20, x=204010942, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=20, counter=21, v=-1696512044, x=0, x=20, x=204010942, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=21, v=-1696512044, x=0, x=20, x=214748360, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=21, v=-1696512044, x=0, x=20, x=214748360, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=21, v=-1696512044, x=0, x=20, x=214748360, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=21, v=-1675037208, x=0, x=20, x=214748360, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=21, v=-1675037208, x=0, x=21, x=214748360, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=21, counter=22, v=-1675037208, x=0, x=21, x=214748360, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=22, v=-1675037208, x=0, x=21, x=225485778, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=22, v=-1675037208, x=0, x=21, x=225485778, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=22, v=-1675037208, x=0, x=21, x=225485778, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=22, v=-1653562372, x=0, x=21, x=225485778, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=22, v=-1653562372, x=0, x=22, x=225485778, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=22, counter=23, v=-1653562372, x=0, x=22, x=225485778, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=23, v=-1653562372, x=0, x=22, x=236223196, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=23, v=-1653562372, x=0, x=22, x=236223196, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=23, v=-1653562372, x=0, x=22, x=236223196, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=23, v=-1632087536, x=0, x=22, x=236223196, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=23, v=-1632087536, x=0, x=23, x=236223196, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=23, counter=24, v=-1632087536, x=0, x=23, x=236223196, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=24, v=-1632087536, x=0, x=23, x=246960614, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=24, v=-1632087536, x=0, x=23, x=246960614, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=24, v=-1632087536, x=0, x=23, x=246960614, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=24, v=-1610612700, x=0, x=23, x=246960614, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=24, v=-1610612700, x=0, x=24, x=246960614, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=24, counter=25, v=-1610612700, x=0, x=24, x=246960614, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=25, v=-1610612700, x=0, x=24, x=257698032, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=25, v=-1610612700, x=0, x=24, x=257698032, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=25, v=-1610612700, x=0, x=24, x=257698032, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=25, v=-1589137864, x=0, x=24, x=257698032, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=25, v=-1589137864, x=0, x=25, x=257698032, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=25, counter=26, v=-1589137864, x=0, x=25, x=257698032, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=26, v=-1589137864, x=0, x=25, x=268435450, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=26, v=-1589137864, x=0, x=25, x=268435450, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=26, v=-1589137864, x=0, x=25, x=268435450, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=26, v=-1567663028, x=0, x=25, x=268435450, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=26, v=-1567663028, x=0, x=26, x=268435450, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=26, counter=27, v=-1567663028, x=0, x=26, x=268435450, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=27, v=-1567663028, x=0, x=26, x=279172868, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=27, v=-1567663028, x=0, x=26, x=279172868, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=27, v=-1567663028, x=0, x=26, x=279172868, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=27, v=-1546188192, x=0, x=26, x=279172868, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=27, v=-1546188192, x=0, x=27, x=279172868, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=27, counter=28, v=-1546188192, x=0, x=27, x=279172868, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=28, v=-1546188192, x=0, x=27, x=289910286, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=28, v=-1546188192, x=0, x=27, x=289910286, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=28, v=-1546188192, x=0, x=27, x=289910286, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=28, v=-1524713356, x=0, x=27, x=289910286, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=28, v=-1524713356, x=0, x=28, x=289910286, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=28, counter=29, v=-1524713356, x=0, x=28, x=289910286, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=29, v=-1524713356, x=0, x=28, x=300647704, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=29, v=-1524713356, x=0, x=28, x=300647704, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=29, v=-1524713356, x=0, x=28, x=300647704, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=29, v=-1503238520, x=0, x=28, x=300647704, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=29, v=-1503238520, x=0, x=29, x=300647704, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=29, counter=30, v=-1503238520, x=0, x=29, x=300647704, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=30, v=-1503238520, x=0, x=29, x=311385122, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=30, v=-1503238520, x=0, x=29, x=311385122, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=30, v=-1503238520, x=0, x=29, x=311385122, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=30, v=-1481763684, x=0, x=29, x=311385122, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=30, v=-1481763684, x=0, x=30, x=311385122, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=30, counter=31, v=-1481763684, x=0, x=30, x=311385122, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=31, v=-1481763684, x=0, x=30, x=322122540, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=31, v=-1481763684, x=0, x=30, x=322122540, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=31, v=-1481763684, x=0, x=30, x=322122540, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=31, v=-1460288848, x=0, x=30, x=322122540, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=31, v=-1460288848, x=0, x=31, x=322122540, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=31, counter=32, v=-1460288848, x=0, x=31, x=322122540, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=32, v=-1460288848, x=0, x=31, x=332859958, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=32, v=-1460288848, x=0, x=31, x=332859958, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=32, v=-1460288848, x=0, x=31, x=332859958, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=32, v=-1438814012, x=0, x=31, x=332859958, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=32, v=-1438814012, x=0, x=32, x=332859958, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=32, counter=33, v=-1438814012, x=0, x=32, x=332859958, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=33, v=-1438814012, x=0, x=32, x=343597376, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=33, v=-1438814012, x=0, x=32, x=343597376, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=33, v=-1438814012, x=0, x=32, x=343597376, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=33, v=-1417339176, x=0, x=32, x=343597376, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=33, v=-1417339176, x=0, x=33, x=343597376, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=33, counter=34, v=-1417339176, x=0, x=33, x=343597376, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=34, v=-1417339176, x=0, x=33, x=354334794, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=34, v=-1417339176, x=0, x=33, x=354334794, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=34, v=-1417339176, x=0, x=33, x=354334794, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=34, v=-1395864340, x=0, x=33, x=354334794, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=34, v=-1395864340, x=0, x=34, x=354334794, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=34, counter=35, v=-1395864340, x=0, x=34, x=354334794, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=35, v=-1395864340, x=0, x=34, x=365072212, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=35, v=-1395864340, x=0, x=34, x=365072212, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=35, v=-1395864340, x=0, x=34, x=365072212, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=35, v=-1374389504, x=0, x=34, x=365072212, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=35, v=-1374389504, x=0, x=35, x=365072212, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=35, counter=36, v=-1374389504, x=0, x=35, x=365072212, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=36, v=-1374389504, x=0, x=35, x=375809630, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=36, v=-1374389504, x=0, x=35, x=375809630, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=36, v=-1374389504, x=0, x=35, x=375809630, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=36, v=-1352914668, x=0, x=35, x=375809630, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=36, v=-1352914668, x=0, x=36, x=375809630, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=36, counter=37, v=-1352914668, x=0, x=36, x=375809630, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=37, v=-1352914668, x=0, x=36, x=386547048, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=37, v=-1352914668, x=0, x=36, x=386547048, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=37, v=-1352914668, x=0, x=36, x=386547048, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=37, v=-1331439832, x=0, x=36, x=386547048, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=37, v=-1331439832, x=0, x=37, x=386547048, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=37, counter=38, v=-1331439832, x=0, x=37, x=386547048, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=38, v=-1331439832, x=0, x=37, x=397284466, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=38, v=-1331439832, x=0, x=37, x=397284466, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=38, v=-1331439832, x=0, x=37, x=397284466, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=38, v=-1309964996, x=0, x=37, x=397284466, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=38, v=-1309964996, x=0, x=38, x=397284466, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=38, counter=39, v=-1309964996, x=0, x=38, x=397284466, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=39, v=-1309964996, x=0, x=38, x=408021884, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=39, v=-1309964996, x=0, x=38, x=408021884, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=39, v=-1309964996, x=0, x=38, x=408021884, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=39, v=-1288490160, x=0, x=38, x=408021884, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=39, v=-1288490160, x=0, x=39, x=408021884, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=39, counter=40, v=-1288490160, x=0, x=39, x=408021884, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=40, v=-1288490160, x=0, x=39, x=418759302, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=40, v=-1288490160, x=0, x=39, x=418759302, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=40, v=-1288490160, x=0, x=39, x=418759302, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=40, v=-1267015324, x=0, x=39, x=418759302, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=40, v=-1267015324, x=0, x=40, x=418759302, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=40, counter=41, v=-1267015324, x=0, x=40, x=418759302, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=41, v=-1267015324, x=0, x=40, x=429496720, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=41, v=-1267015324, x=0, x=40, x=429496720, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=41, v=-1267015324, x=0, x=40, x=429496720, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=41, v=-1245540488, x=0, x=40, x=429496720, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=41, v=-1245540488, x=0, x=41, x=429496720, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=41, counter=42, v=-1245540488, x=0, x=41, x=429496720, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=42, v=-1245540488, x=0, x=41, x=440234138, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=42, v=-1245540488, x=0, x=41, x=440234138, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=42, v=-1245540488, x=0, x=41, x=440234138, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=42, v=-1224065652, x=0, x=41, x=440234138, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=42, v=-1224065652, x=0, x=42, x=440234138, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=42, counter=43, v=-1224065652, x=0, x=42, x=440234138, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=43, v=-1224065652, x=0, x=42, x=450971556, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=43, v=-1224065652, x=0, x=42, x=450971556, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=43, v=-1224065652, x=0, x=42, x=450971556, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=43, v=-1202590816, x=0, x=42, x=450971556, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=43, v=-1202590816, x=0, x=43, x=450971556, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=43, counter=44, v=-1202590816, x=0, x=43, x=450971556, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=44, v=-1202590816, x=0, x=43, x=461708974, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=44, v=-1202590816, x=0, x=43, x=461708974, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=44, v=-1202590816, x=0, x=43, x=461708974, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=44, v=-1181115980, x=0, x=43, x=461708974, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=44, v=-1181115980, x=0, x=44, x=461708974, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=44, counter=45, v=-1181115980, x=0, x=44, x=461708974, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=45, v=-1181115980, x=0, x=44, x=472446392, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=45, v=-1181115980, x=0, x=44, x=472446392, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=45, v=-1181115980, x=0, x=44, x=472446392, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=45, v=-1159641144, x=0, x=44, x=472446392, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=45, v=-1159641144, x=0, x=45, x=472446392, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=45, counter=46, v=-1159641144, x=0, x=45, x=472446392, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=46, v=-1159641144, x=0, x=45, x=483183810, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=46, v=-1159641144, x=0, x=45, x=483183810, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=46, v=-1159641144, x=0, x=45, x=483183810, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=46, v=-1138166308, x=0, x=45, x=483183810, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=46, v=-1138166308, x=0, x=46, x=483183810, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=46, counter=47, v=-1138166308, x=0, x=46, x=483183810, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=47, v=-1138166308, x=0, x=46, x=493921228, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=47, v=-1138166308, x=0, x=46, x=493921228, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=47, v=-1138166308, x=0, x=46, x=493921228, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=47, v=-1116691472, x=0, x=46, x=493921228, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=47, v=-1116691472, x=0, x=47, x=493921228, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=47, counter=48, v=-1116691472, x=0, x=47, x=493921228, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=48, v=-1116691472, x=0, x=47, x=504658646, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=48, v=-1116691472, x=0, x=47, x=504658646, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=48, v=-1116691472, x=0, x=47, x=504658646, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=48, v=-1095216636, x=0, x=47, x=504658646, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=48, v=-1095216636, x=0, x=48, x=504658646, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=48, counter=49, v=-1095216636, x=0, x=48, x=504658646, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=49, v=-1095216636, x=0, x=48, x=515396064, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=49, v=-1095216636, x=0, x=48, x=515396064, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=49, v=-1095216636, x=0, x=48, x=515396064, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=49, v=-1073741800, x=0, x=48, x=515396064, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=49, v=-1073741800, x=0, x=49, x=515396064, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=49, counter=50, v=-1073741800, x=0, x=49, x=515396064, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=50, v=-1073741800, x=0, x=49, x=526133482, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=50, v=-1073741800, x=0, x=49, x=526133482, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=50, v=-1073741800, x=0, x=49, x=526133482, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=50, v=-1052266964, x=0, x=49, x=526133482, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=50, v=-1052266964, x=0, x=50, x=526133482, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=50, counter=51, v=-1052266964, x=0, x=50, x=526133482, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=51, v=-1052266964, x=0, x=50, x=536870900, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=51] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=51, v=-1052266964, x=0, x=50, x=536870900, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=51, v=-1052266964, x=0, x=50, x=536870900, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=51, v=-1030792128, x=0, x=50, x=536870900, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=51, v=-1030792128, x=0, x=51, x=536870900, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=51, counter=52, v=-1030792128, x=0, x=51, x=536870900, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=52, v=-1030792128, x=0, x=51, x=547608318, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=52] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=52, v=-1030792128, x=0, x=51, x=547608318, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=52, v=-1030792128, x=0, x=51, x=547608318, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=52, v=-1009317292, x=0, x=51, x=547608318, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=52, v=-1009317292, x=0, x=52, x=547608318, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=52, counter=53, v=-1009317292, x=0, x=52, x=547608318, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=53, v=-1009317292, x=0, x=52, x=558345736, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=53] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=53, v=-1009317292, x=0, x=52, x=558345736, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=53, v=-1009317292, x=0, x=52, x=558345736, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=53, v=-987842456, x=0, x=52, x=558345736, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=53, v=-987842456, x=0, x=53, x=558345736, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=53, counter=54, v=-987842456, x=0, x=53, x=558345736, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=54, v=-987842456, x=0, x=53, x=569083154, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=54] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=54, v=-987842456, x=0, x=53, x=569083154, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=54, v=-987842456, x=0, x=53, x=569083154, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=54, v=-966367620, x=0, x=53, x=569083154, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=54, v=-966367620, x=0, x=54, x=569083154, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=54, counter=55, v=-966367620, x=0, x=54, x=569083154, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=55, v=-966367620, x=0, x=54, x=579820572, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=55] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=55, v=-966367620, x=0, x=54, x=579820572, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=55, v=-966367620, x=0, x=54, x=579820572, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=55, v=-944892784, x=0, x=54, x=579820572, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=55, v=-944892784, x=0, x=55, x=579820572, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=55, counter=56, v=-944892784, x=0, x=55, x=579820572, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=56, v=-944892784, x=0, x=55, x=590557990, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=56] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=56, v=-944892784, x=0, x=55, x=590557990, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=56, v=-944892784, x=0, x=55, x=590557990, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=56, v=-923417948, x=0, x=55, x=590557990, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=56, v=-923417948, x=0, x=56, x=590557990, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=56, counter=57, v=-923417948, x=0, x=56, x=590557990, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=57, v=-923417948, x=0, x=56, x=601295408, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=57] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=57, v=-923417948, x=0, x=56, x=601295408, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=57, v=-923417948, x=0, x=56, x=601295408, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=57, v=-901943112, x=0, x=56, x=601295408, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=57, v=-901943112, x=0, x=57, x=601295408, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=57, counter=58, v=-901943112, x=0, x=57, x=601295408, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=58, v=-901943112, x=0, x=57, x=612032826, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=58] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=58, v=-901943112, x=0, x=57, x=612032826, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=58, v=-901943112, x=0, x=57, x=612032826, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=58, v=-880468276, x=0, x=57, x=612032826, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=58, v=-880468276, x=0, x=58, x=612032826, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=58, counter=59, v=-880468276, x=0, x=58, x=612032826, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=59, v=-880468276, x=0, x=58, x=622770244, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=59] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=59, v=-880468276, x=0, x=58, x=622770244, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=59, v=-880468276, x=0, x=58, x=622770244, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=59, v=-858993440, x=0, x=58, x=622770244, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=59, v=-858993440, x=0, x=59, x=622770244, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=59, counter=60, v=-858993440, x=0, x=59, x=622770244, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=60, v=-858993440, x=0, x=59, x=633507662, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=60] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=60, v=-858993440, x=0, x=59, x=633507662, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=60, v=-858993440, x=0, x=59, x=633507662, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=60, v=-837518604, x=0, x=59, x=633507662, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=60, v=-837518604, x=0, x=60, x=633507662, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=60, counter=61, v=-837518604, x=0, x=60, x=633507662, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=61, v=-837518604, x=0, x=60, x=644245080, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=61] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=61, v=-837518604, x=0, x=60, x=644245080, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=61, v=-837518604, x=0, x=60, x=644245080, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=61, v=-816043768, x=0, x=60, x=644245080, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=61, v=-816043768, x=0, x=61, x=644245080, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=61, counter=62, v=-816043768, x=0, x=61, x=644245080, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=62, v=-816043768, x=0, x=61, x=654982498, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=62] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=62, v=-816043768, x=0, x=61, x=654982498, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=62, v=-816043768, x=0, x=61, x=654982498, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=62, v=-794568932, x=0, x=61, x=654982498, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=62, v=-794568932, x=0, x=62, x=654982498, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=62, counter=63, v=-794568932, x=0, x=62, x=654982498, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=63, v=-794568932, x=0, x=62, x=665719916, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=63] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=63, v=-794568932, x=0, x=62, x=665719916, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=63, v=-794568932, x=0, x=62, x=665719916, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=63, v=-773094096, x=0, x=62, x=665719916, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=63, v=-773094096, x=0, x=63, x=665719916, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=63, counter=64, v=-773094096, x=0, x=63, x=665719916, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=64, v=-773094096, x=0, x=63, x=676457334, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=64] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=64, v=-773094096, x=0, x=63, x=676457334, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=64, v=-773094096, x=0, x=63, x=676457334, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=64, v=-751619260, x=0, x=63, x=676457334, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=64, v=-751619260, x=0, x=64, x=676457334, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=64, counter=65, v=-751619260, x=0, x=64, x=676457334, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=65, v=-751619260, x=0, x=64, x=687194752, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=65] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=65, v=-751619260, x=0, x=64, x=687194752, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=65, v=-751619260, x=0, x=64, x=687194752, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=65, v=-730144424, x=0, x=64, x=687194752, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=65, v=-730144424, x=0, x=65, x=687194752, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=65, counter=66, v=-730144424, x=0, x=65, x=687194752, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=66, v=-730144424, x=0, x=65, x=697932170, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=66] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=66, v=-730144424, x=0, x=65, x=697932170, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=66, v=-730144424, x=0, x=65, x=697932170, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=66, v=-708669588, x=0, x=65, x=697932170, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=66, v=-708669588, x=0, x=66, x=697932170, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=66, counter=67, v=-708669588, x=0, x=66, x=697932170, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=67, v=-708669588, x=0, x=66, x=708669588, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=67] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=67, v=-708669588, x=0, x=66, x=708669588, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=67, v=-708669588, x=0, x=66, x=708669588, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=67, v=-687194752, x=0, x=66, x=708669588, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=67, v=-687194752, x=0, x=67, x=708669588, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=67, counter=68, v=-687194752, x=0, x=67, x=708669588, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=68, v=-687194752, x=0, x=67, x=719407006, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=68] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=68, v=-687194752, x=0, x=67, x=719407006, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=68, v=-687194752, x=0, x=67, x=719407006, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=68, v=-665719916, x=0, x=67, x=719407006, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=68, v=-665719916, x=0, x=68, x=719407006, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=68, counter=69, v=-665719916, x=0, x=68, x=719407006, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=69, v=-665719916, x=0, x=68, x=730144424, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=69] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=69, v=-665719916, x=0, x=68, x=730144424, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=69, v=-665719916, x=0, x=68, x=730144424, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=69, v=-644245080, x=0, x=68, x=730144424, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=69, v=-644245080, x=0, x=69, x=730144424, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=69, counter=70, v=-644245080, x=0, x=69, x=730144424, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=70, v=-644245080, x=0, x=69, x=740881842, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=70] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=70, v=-644245080, x=0, x=69, x=740881842, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=70, v=-644245080, x=0, x=69, x=740881842, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=70, v=-622770244, x=0, x=69, x=740881842, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=70, v=-622770244, x=0, x=70, x=740881842, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=70, counter=71, v=-622770244, x=0, x=70, x=740881842, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=71, v=-622770244, x=0, x=70, x=751619260, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=71] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=71, v=-622770244, x=0, x=70, x=751619260, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=71, v=-622770244, x=0, x=70, x=751619260, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=71, v=-601295408, x=0, x=70, x=751619260, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=71, v=-601295408, x=0, x=71, x=751619260, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=71, counter=72, v=-601295408, x=0, x=71, x=751619260, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=72, v=-601295408, x=0, x=71, x=762356678, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=72] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=72, v=-601295408, x=0, x=71, x=762356678, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=72, v=-601295408, x=0, x=71, x=762356678, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=72, v=-579820572, x=0, x=71, x=762356678, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=72, v=-579820572, x=0, x=72, x=762356678, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=72, counter=73, v=-579820572, x=0, x=72, x=762356678, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=73, v=-579820572, x=0, x=72, x=773094096, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=73] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=73, v=-579820572, x=0, x=72, x=773094096, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=73, v=-579820572, x=0, x=72, x=773094096, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=73, v=-558345736, x=0, x=72, x=773094096, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=73, v=-558345736, x=0, x=73, x=773094096, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=73, counter=74, v=-558345736, x=0, x=73, x=773094096, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=74, v=-558345736, x=0, x=73, x=783831514, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=74] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=74, v=-558345736, x=0, x=73, x=783831514, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=74, v=-558345736, x=0, x=73, x=783831514, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=74, v=-536870900, x=0, x=73, x=783831514, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=74, v=-536870900, x=0, x=74, x=783831514, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=74, counter=75, v=-536870900, x=0, x=74, x=783831514, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=75, v=-536870900, x=0, x=74, x=794568932, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=75] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=75, v=-536870900, x=0, x=74, x=794568932, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=75, v=-536870900, x=0, x=74, x=794568932, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=75, v=-515396064, x=0, x=74, x=794568932, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=75, v=-515396064, x=0, x=75, x=794568932, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=75, counter=76, v=-515396064, x=0, x=75, x=794568932, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=76, v=-515396064, x=0, x=75, x=805306350, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=76] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=76, v=-515396064, x=0, x=75, x=805306350, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=76, v=-515396064, x=0, x=75, x=805306350, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=76, v=-493921228, x=0, x=75, x=805306350, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=76, v=-493921228, x=0, x=76, x=805306350, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=76, counter=77, v=-493921228, x=0, x=76, x=805306350, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=77, v=-493921228, x=0, x=76, x=816043768, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=77] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=77, v=-493921228, x=0, x=76, x=816043768, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=77, v=-493921228, x=0, x=76, x=816043768, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=77, v=-472446392, x=0, x=76, x=816043768, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=77, v=-472446392, x=0, x=77, x=816043768, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=77, counter=78, v=-472446392, x=0, x=77, x=816043768, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=78, v=-472446392, x=0, x=77, x=826781186, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=78] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=78, v=-472446392, x=0, x=77, x=826781186, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=78, v=-472446392, x=0, x=77, x=826781186, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=78, v=-450971556, x=0, x=77, x=826781186, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=78, v=-450971556, x=0, x=78, x=826781186, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=78, counter=79, v=-450971556, x=0, x=78, x=826781186, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=79, v=-450971556, x=0, x=78, x=837518604, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=79] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=79, v=-450971556, x=0, x=78, x=837518604, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=79, v=-450971556, x=0, x=78, x=837518604, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=79, v=-429496720, x=0, x=78, x=837518604, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=79, v=-429496720, x=0, x=79, x=837518604, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=79, counter=80, v=-429496720, x=0, x=79, x=837518604, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=80, v=-429496720, x=0, x=79, x=848256022, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=80] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=80, v=-429496720, x=0, x=79, x=848256022, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=80, v=-429496720, x=0, x=79, x=848256022, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=80, v=-408021884, x=0, x=79, x=848256022, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=80, v=-408021884, x=0, x=80, x=848256022, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=80, counter=81, v=-408021884, x=0, x=80, x=848256022, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=81, v=-408021884, x=0, x=80, x=858993440, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=81] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=81, v=-408021884, x=0, x=80, x=858993440, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=81, v=-408021884, x=0, x=80, x=858993440, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=81, v=-386547048, x=0, x=80, x=858993440, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=81, v=-386547048, x=0, x=81, x=858993440, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=81, counter=82, v=-386547048, x=0, x=81, x=858993440, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=82, v=-386547048, x=0, x=81, x=869730858, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=82] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=82, v=-386547048, x=0, x=81, x=869730858, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=82, v=-386547048, x=0, x=81, x=869730858, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=82, v=-365072212, x=0, x=81, x=869730858, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=82, v=-365072212, x=0, x=82, x=869730858, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=82, counter=83, v=-365072212, x=0, x=82, x=869730858, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=83, v=-365072212, x=0, x=82, x=880468276, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=83] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=83, v=-365072212, x=0, x=82, x=880468276, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=83, v=-365072212, x=0, x=82, x=880468276, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=83, v=-343597376, x=0, x=82, x=880468276, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=83, v=-343597376, x=0, x=83, x=880468276, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=83, counter=84, v=-343597376, x=0, x=83, x=880468276, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=84, v=-343597376, x=0, x=83, x=891205694, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=84] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=84, v=-343597376, x=0, x=83, x=891205694, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=84, v=-343597376, x=0, x=83, x=891205694, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=84, v=-322122540, x=0, x=83, x=891205694, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=84, v=-322122540, x=0, x=84, x=891205694, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=84, counter=85, v=-322122540, x=0, x=84, x=891205694, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=85, v=-322122540, x=0, x=84, x=901943112, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=85] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=85, v=-322122540, x=0, x=84, x=901943112, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=85, v=-322122540, x=0, x=84, x=901943112, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=85, v=-300647704, x=0, x=84, x=901943112, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=85, v=-300647704, x=0, x=85, x=901943112, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=85, counter=86, v=-300647704, x=0, x=85, x=901943112, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=86, v=-300647704, x=0, x=85, x=912680530, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=86] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=86, v=-300647704, x=0, x=85, x=912680530, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=86, v=-300647704, x=0, x=85, x=912680530, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=86, v=-279172868, x=0, x=85, x=912680530, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=86, v=-279172868, x=0, x=86, x=912680530, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=86, counter=87, v=-279172868, x=0, x=86, x=912680530, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=87, v=-279172868, x=0, x=86, x=923417948, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=87] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=87, v=-279172868, x=0, x=86, x=923417948, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=87, v=-279172868, x=0, x=86, x=923417948, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=87, v=-257698032, x=0, x=86, x=923417948, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=87, v=-257698032, x=0, x=87, x=923417948, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=87, counter=88, v=-257698032, x=0, x=87, x=923417948, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=88, v=-257698032, x=0, x=87, x=934155366, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=88] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=88, v=-257698032, x=0, x=87, x=934155366, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=88, v=-257698032, x=0, x=87, x=934155366, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=88, v=-236223196, x=0, x=87, x=934155366, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=88, v=-236223196, x=0, x=88, x=934155366, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=88, counter=89, v=-236223196, x=0, x=88, x=934155366, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=89, v=-236223196, x=0, x=88, x=944892784, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=89] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=89, v=-236223196, x=0, x=88, x=944892784, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=89, v=-236223196, x=0, x=88, x=944892784, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=89, v=-214748360, x=0, x=88, x=944892784, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=89, v=-214748360, x=0, x=89, x=944892784, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=89, counter=90, v=-214748360, x=0, x=89, x=944892784, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=90, v=-214748360, x=0, x=89, x=955630202, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=90] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=90, v=-214748360, x=0, x=89, x=955630202, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=90, v=-214748360, x=0, x=89, x=955630202, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=90, v=-193273524, x=0, x=89, x=955630202, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=90, v=-193273524, x=0, x=90, x=955630202, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=90, counter=91, v=-193273524, x=0, x=90, x=955630202, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=91, v=-193273524, x=0, x=90, x=966367620, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=91] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=91, v=-193273524, x=0, x=90, x=966367620, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=91, v=-193273524, x=0, x=90, x=966367620, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=91, v=-171798688, x=0, x=90, x=966367620, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=91, v=-171798688, x=0, x=91, x=966367620, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=91, counter=92, v=-171798688, x=0, x=91, x=966367620, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=92, v=-171798688, x=0, x=91, x=977105038, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=92] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=92, v=-171798688, x=0, x=91, x=977105038, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=92, v=-171798688, x=0, x=91, x=977105038, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=92, v=-150323852, x=0, x=91, x=977105038, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=92, v=-150323852, x=0, x=92, x=977105038, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=92, counter=93, v=-150323852, x=0, x=92, x=977105038, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=93, v=-150323852, x=0, x=92, x=987842456, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=93] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=93, v=-150323852, x=0, x=92, x=987842456, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=93, v=-150323852, x=0, x=92, x=987842456, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=93, v=-128849016, x=0, x=92, x=987842456, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=93, v=-128849016, x=0, x=93, x=987842456, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=93, counter=94, v=-128849016, x=0, x=93, x=987842456, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=94, v=-128849016, x=0, x=93, x=998579874, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=94] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=94, v=-128849016, x=0, x=93, x=998579874, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=94, v=-128849016, x=0, x=93, x=998579874, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=94, v=-107374180, x=0, x=93, x=998579874, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=94, v=-107374180, x=0, x=94, x=998579874, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=94, counter=95, v=-107374180, x=0, x=94, x=998579874, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=95, v=-107374180, x=0, x=1009317292, x=94, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=95] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=95, v=-107374180, x=0, x=1009317292, x=94, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=95, v=-107374180, x=0, x=1009317292, x=94, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=95, v=-85899344, x=0, x=1009317292, x=94, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=95, v=-85899344, x=0, x=1009317292, x=95, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=95, counter=96, v=-85899344, x=0, x=1009317292, x=95, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=96, v=-85899344, x=0, x=1020054710, x=95, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=96] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=96, v=-85899344, x=0, x=1020054710, x=95, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=96, v=-85899344, x=0, x=1020054710, x=95, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=96, v=-64424508, x=0, x=1020054710, x=95, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=96, v=-64424508, x=0, x=1020054710, x=96, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=96, counter=97, v=-64424508, x=0, x=1020054710, x=96, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=97, v=-64424508, x=0, x=1030792128, x=96, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=97] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=97, v=-64424508, x=0, x=1030792128, x=96, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=97, v=-64424508, x=0, x=1030792128, x=96, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=97, v=-42949672, x=0, x=1030792128, x=96, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=97, v=-42949672, x=0, x=1030792128, x=97, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=97, counter=98, v=-42949672, x=0, x=1030792128, x=97, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=98, v=-42949672, x=0, x=1041529546, x=97, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=98] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=98, v=-42949672, x=0, x=1041529546, x=97, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=98, v=-42949672, x=0, x=1041529546, x=97, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=98, v=-21474836, x=0, x=1041529546, x=97, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=98, v=-21474836, x=0, x=1041529546, x=98, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=98, counter=99, v=-21474836, x=0, x=1041529546, x=98, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=99, v=-21474836, x=0, x=1052266964, x=98, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=99] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=99, v=-21474836, x=0, x=1052266964, x=98, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=99, v=-21474836, x=0, x=1052266964, x=98, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483600, Y=10737418, counter=99, v=0, x=0, x=1052266964, x=98, y=0] [L45] x++ VAL [X=2147483600, Y=10737418, counter=99, v=0, x=0, x=1052266964, x=99, y=0] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=99, counter=100, v=0, x=0, x=1052266964, x=99, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483600, Y=10737418, counter=100, v=0, x=0, x=1063004382, x=99, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=100] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483600, Y=10737418, counter=100, v=0, x=0, x=1063004382, x=99, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483600, Y=10737418, counter=100, v=0, x=0, x=1063004382, x=99, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=2147483600, Y=10737418, counter=100, v=-4273492364, x=0, x=1063004382, x=99, y=1] [L45] x++ VAL [X=2147483600, Y=10737418, counter=100, v=-4273492364, x=0, x=100, x=1063004382, y=1] [L31] EXPR counter++ VAL [X=2147483600, Y=10737418, counter++=100, counter=101, v=-4273492364, x=0, x=100, x=1063004382, y=1] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=2147483600, Y=10737418, counter=101, v=-4273492364, x=100, x=100, x=1073741800, y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=101] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.6s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1903 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1902 mSDsluCounter, 2709 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2570 mSDsCounter, 242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1718 IncrementalHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 242 mSolverCounterUnsat, 139 mSDtfsCounter, 1718 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4478 GetRequests, 3750 SyntacticMatches, 91 SemanticMatches, 637 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17005 ImplicationChecksByTransitivity, 26.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2000occurred in iteration=10, InterpolantAutomatonStates: 620, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 3113 NumberOfCodeBlocks, 2903 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 4181 ConstructedInterpolants, 1 QuantifiedInterpolants, 11343 SizeOfPredicates, 201 NumberOfNonLiveVariables, 4854 ConjunctsInSsa, 467 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 28149/120006 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-06 23:03:56,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52682bad-3ec7-40a3-b9c2-f10e7265dfc1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE