/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 19:06:24,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 19:06:24,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 19:06:24,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 19:06:24,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 19:06:24,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 19:06:24,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 19:06:24,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 19:06:24,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 19:06:24,682 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 19:06:24,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 19:06:24,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 19:06:24,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 19:06:24,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 19:06:24,684 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 19:06:24,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 19:06:24,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 19:06:24,685 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 19:06:24,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 19:06:24,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 19:06:24,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 19:06:24,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 19:06:24,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 19:06:24,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 19:06:24,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 19:06:24,686 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 19:06:24,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 19:06:24,686 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 19:06:24,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 19:06:24,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 19:06:24,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 19:06:24,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 19:06:24,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 19:06:24,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 19:06:24,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 19:06:24,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 19:06:24,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 19:06:24,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 19:06:24,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 19:06:24,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 19:06:24,689 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 19:06:24,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 19:06:24,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 19:06:24,689 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 19:06:24,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 19:06:24,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 19:06:24,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 19:06:24,877 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 19:06:24,877 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 19:06:24,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2023-12-19 19:06:25,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 19:06:25,924 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 19:06:25,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2023-12-19 19:06:25,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914d9a03d/5fd94a07db2e4dbbb5f4b1a4969a4be3/FLAG603118b75 [2023-12-19 19:06:25,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914d9a03d/5fd94a07db2e4dbbb5f4b1a4969a4be3 [2023-12-19 19:06:25,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 19:06:25,941 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 19:06:25,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 19:06:25,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 19:06:25,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 19:06:25,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 07:06:25" (1/1) ... [2023-12-19 19:06:25,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@86c5201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:25, skipping insertion in model container [2023-12-19 19:06:25,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 07:06:25" (1/1) ... [2023-12-19 19:06:25,962 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 19:06:26,071 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2023-12-19 19:06:26,087 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 19:06:26,096 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 19:06:26,104 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2023-12-19 19:06:26,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 19:06:26,116 INFO L206 MainTranslator]: Completed translation [2023-12-19 19:06:26,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26 WrapperNode [2023-12-19 19:06:26,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 19:06:26,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 19:06:26,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 19:06:26,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 19:06:26,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (1/1) ... [2023-12-19 19:06:26,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (1/1) ... [2023-12-19 19:06:26,136 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-12-19 19:06:26,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 19:06:26,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 19:06:26,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 19:06:26,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 19:06:26,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (1/1) ... [2023-12-19 19:06:26,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (1/1) ... [2023-12-19 19:06:26,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (1/1) ... [2023-12-19 19:06:26,150 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 19:06:26,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (1/1) ... [2023-12-19 19:06:26,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (1/1) ... [2023-12-19 19:06:26,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (1/1) ... [2023-12-19 19:06:26,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (1/1) ... [2023-12-19 19:06:26,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (1/1) ... [2023-12-19 19:06:26,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (1/1) ... [2023-12-19 19:06:26,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 19:06:26,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 19:06:26,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 19:06:26,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 19:06:26,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (1/1) ... [2023-12-19 19:06:26,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 19:06:26,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 19:06:26,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 19:06:26,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 19:06:26,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 19:06:26,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 19:06:26,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 19:06:26,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 19:06:26,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-19 19:06:26,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-19 19:06:26,290 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 19:06:26,293 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 19:06:26,442 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 19:06:26,456 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 19:06:26,456 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 19:06:26,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 07:06:26 BoogieIcfgContainer [2023-12-19 19:06:26,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 19:06:26,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 19:06:26,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 19:06:26,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 19:06:26,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 07:06:25" (1/3) ... [2023-12-19 19:06:26,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eeab2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 07:06:26, skipping insertion in model container [2023-12-19 19:06:26,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:06:26" (2/3) ... [2023-12-19 19:06:26,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eeab2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 07:06:26, skipping insertion in model container [2023-12-19 19:06:26,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 07:06:26" (3/3) ... [2023-12-19 19:06:26,462 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2023-12-19 19:06:26,472 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 19:06:26,472 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 19:06:26,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 19:06:26,502 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=LoopHeads, 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;@442db337, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 19:06:26,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 19:06:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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-12-19 19:06:26,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-19 19:06:26,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 19:06:26,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-19 19:06:26,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 19:06:26,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 19:06:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2023-12-19 19:06:26,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 19:06:26,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524111595] [2023-12-19 19:06:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 19:06:26,575 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 19:06:26,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304296964] [2023-12-19 19:06:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:26,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:26,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 19:06:26,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 19:06:26,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 19:06:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 19:06:26,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-19 19:06:26,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 19:06:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 19:06:26,739 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 19:06:26,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 19:06:26,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524111595] [2023-12-19 19:06:26,739 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 19:06:26,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304296964] [2023-12-19 19:06:26,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304296964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 19:06:26,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 19:06:26,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 19:06:26,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048396514] [2023-12-19 19:06:26,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 19:06:26,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 19:06:26,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 19:06:26,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 19:06:26,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 19:06:26,760 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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.2) internal successors, (6), 4 states have internal predecessors, (6), 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-12-19 19:06:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 19:06:26,860 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2023-12-19 19:06:26,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 19:06:26,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2023-12-19 19:06:26,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 19:06:26,866 INFO L225 Difference]: With dead ends: 46 [2023-12-19 19:06:26,866 INFO L226 Difference]: Without dead ends: 24 [2023-12-19 19:06:26,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-19 19:06:26,871 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 19:06:26,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 19:06:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-19 19:06:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-12-19 19:06:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-12-19 19:06:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-12-19 19:06:26,894 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 7 [2023-12-19 19:06:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 19:06:26,894 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-12-19 19:06:26,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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-12-19 19:06:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-12-19 19:06:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-19 19:06:26,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 19:06:26,895 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 19:06:26,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 19:06:27,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-19 19:06:27,100 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 19:06:27,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 19:06:27,101 INFO L85 PathProgramCache]: Analyzing trace with hash -479331439, now seen corresponding path program 1 times [2023-12-19 19:06:27,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 19:06:27,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262006588] [2023-12-19 19:06:27,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:27,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 19:06:27,110 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 19:06:27,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [10553886] [2023-12-19 19:06:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:27,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:27,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 19:06:27,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 19:06:27,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 19:06:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 19:06:27,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-19 19:06:27,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 19:06:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 19:06:27,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 19:06:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-19 19:06:27,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 19:06:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262006588] [2023-12-19 19:06:27,389 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 19:06:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10553886] [2023-12-19 19:06:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10553886] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 19:06:27,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 19:06:27,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-12-19 19:06:27,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922453615] [2023-12-19 19:06:27,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 19:06:27,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 19:06:27,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 19:06:27,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 19:06:27,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-19 19:06:27,394 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-12-19 19:06:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 19:06:27,548 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-12-19 19:06:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 19:06:27,549 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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 17 [2023-12-19 19:06:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 19:06:27,551 INFO L225 Difference]: With dead ends: 40 [2023-12-19 19:06:27,551 INFO L226 Difference]: Without dead ends: 33 [2023-12-19 19:06:27,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-19 19:06:27,553 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 19:06:27,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 19:06:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-19 19:06:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-12-19 19:06:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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-12-19 19:06:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-12-19 19:06:27,567 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2023-12-19 19:06:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 19:06:27,568 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-12-19 19:06:27,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-12-19 19:06:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-12-19 19:06:27,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-19 19:06:27,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 19:06:27,569 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 19:06:27,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-19 19:06:27,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-19 19:06:27,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 19:06:27,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 19:06:27,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1366888132, now seen corresponding path program 1 times [2023-12-19 19:06:27,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 19:06:27,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250353557] [2023-12-19 19:06:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:27,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 19:06:27,794 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 19:06:27,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997417083] [2023-12-19 19:06:27,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:27,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:27,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 19:06:27,800 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 19:06:27,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 19:06:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 19:06:27,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-19 19:06:27,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 19:06:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 19:06:27,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 19:06:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 19:06:27,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 19:06:27,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250353557] [2023-12-19 19:06:27,916 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 19:06:27,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997417083] [2023-12-19 19:06:27,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997417083] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 19:06:27,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 19:06:27,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-19 19:06:27,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847805224] [2023-12-19 19:06:27,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 19:06:27,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 19:06:27,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 19:06:27,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 19:06:27,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-19 19:06:27,918 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-12-19 19:06:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 19:06:27,971 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2023-12-19 19:06:27,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 19:06:27,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 18 [2023-12-19 19:06:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 19:06:27,974 INFO L225 Difference]: With dead ends: 72 [2023-12-19 19:06:27,974 INFO L226 Difference]: Without dead ends: 66 [2023-12-19 19:06:27,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 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-12-19 19:06:27,976 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 19:06:27,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 93 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 19:06:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-19 19:06:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2023-12-19 19:06:27,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 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-12-19 19:06:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-12-19 19:06:27,996 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 18 [2023-12-19 19:06:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 19:06:27,996 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-12-19 19:06:27,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-12-19 19:06:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2023-12-19 19:06:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-19 19:06:27,997 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 19:06:27,997 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 19:06:28,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 19:06:28,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:28,204 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 19:06:28,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 19:06:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash -382706270, now seen corresponding path program 1 times [2023-12-19 19:06:28,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 19:06:28,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194951631] [2023-12-19 19:06:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 19:06:28,218 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 19:06:28,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205408236] [2023-12-19 19:06:28,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:28,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:28,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 19:06:28,220 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 19:06:28,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 19:06:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 19:06:28,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-19 19:06:28,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 19:06:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 19:06:28,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 19:06:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-19 19:06:28,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 19:06:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194951631] [2023-12-19 19:06:28,743 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 19:06:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205408236] [2023-12-19 19:06:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205408236] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 19:06:28,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 19:06:28,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-12-19 19:06:28,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905247934] [2023-12-19 19:06:28,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 19:06:28,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-19 19:06:28,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 19:06:28,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-19 19:06:28,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-12-19 19:06:28,746 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 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-12-19 19:06:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 19:06:29,206 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2023-12-19 19:06:29,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-19 19:06:29,207 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 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 24 [2023-12-19 19:06:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 19:06:29,207 INFO L225 Difference]: With dead ends: 64 [2023-12-19 19:06:29,207 INFO L226 Difference]: Without dead ends: 56 [2023-12-19 19:06:29,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-12-19 19:06:29,208 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 19:06:29,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 107 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 19:06:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-19 19:06:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2023-12-19 19:06:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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-12-19 19:06:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-12-19 19:06:29,216 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 24 [2023-12-19 19:06:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 19:06:29,216 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-12-19 19:06:29,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 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-12-19 19:06:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-12-19 19:06:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-19 19:06:29,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 19:06:29,217 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-12-19 19:06:29,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-19 19:06:29,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:29,423 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 19:06:29,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 19:06:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2080125809, now seen corresponding path program 1 times [2023-12-19 19:06:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 19:06:29,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287885607] [2023-12-19 19:06:29,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:29,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 19:06:29,430 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 19:06:29,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790698037] [2023-12-19 19:06:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:29,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:29,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 19:06:29,431 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 19:06:29,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 19:06:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 19:06:29,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-19 19:06:29,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 19:06:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 19:06:29,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 19:06:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-19 19:06:29,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 19:06:29,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287885607] [2023-12-19 19:06:29,586 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 19:06:29,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790698037] [2023-12-19 19:06:29,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790698037] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 19:06:29,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 19:06:29,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-19 19:06:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314534498] [2023-12-19 19:06:29,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 19:06:29,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 19:06:29,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 19:06:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 19:06:29,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-12-19 19:06:29,588 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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-12-19 19:06:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 19:06:29,697 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2023-12-19 19:06:29,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-19 19:06:29,697 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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 48 [2023-12-19 19:06:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 19:06:29,698 INFO L225 Difference]: With dead ends: 115 [2023-12-19 19:06:29,698 INFO L226 Difference]: Without dead ends: 109 [2023-12-19 19:06:29,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-12-19 19:06:29,699 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 19:06:29,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 124 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 19:06:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-19 19:06:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-19 19:06:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.1264367816091954) internal successors, (98), 87 states have internal predecessors, (98), 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-12-19 19:06:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2023-12-19 19:06:29,729 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 48 [2023-12-19 19:06:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 19:06:29,730 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2023-12-19 19:06:29,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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-12-19 19:06:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2023-12-19 19:06:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-19 19:06:29,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 19:06:29,735 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2023-12-19 19:06:29,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-19 19:06:29,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:29,940 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 19:06:29,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 19:06:29,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1893266719, now seen corresponding path program 2 times [2023-12-19 19:06:29,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 19:06:29,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710533996] [2023-12-19 19:06:29,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:29,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 19:06:29,950 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 19:06:29,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1835593531] [2023-12-19 19:06:29,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 19:06:29,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:29,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 19:06:29,951 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 19:06:29,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 19:06:30,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 19:06:30,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 19:06:30,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-19 19:06:30,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 19:06:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 19:06:30,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 19:06:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-19 19:06:30,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 19:06:30,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710533996] [2023-12-19 19:06:30,373 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 19:06:30,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835593531] [2023-12-19 19:06:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835593531] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 19:06:30,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 19:06:30,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-12-19 19:06:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139439749] [2023-12-19 19:06:30,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 19:06:30,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-19 19:06:30,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 19:06:30,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-19 19:06:30,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-12-19 19:06:30,376 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 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-12-19 19:06:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 19:06:30,678 INFO L93 Difference]: Finished difference Result 235 states and 268 transitions. [2023-12-19 19:06:30,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-19 19:06:30,679 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 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 108 [2023-12-19 19:06:30,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 19:06:30,681 INFO L225 Difference]: With dead ends: 235 [2023-12-19 19:06:30,681 INFO L226 Difference]: Without dead ends: 229 [2023-12-19 19:06:30,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-12-19 19:06:30,682 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 151 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 19:06:30,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 198 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 19:06:30,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-19 19:06:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2023-12-19 19:06:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 183 states have (on average 1.1256830601092895) internal successors, (206), 183 states have internal predecessors, (206), 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-12-19 19:06:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 251 transitions. [2023-12-19 19:06:30,705 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 251 transitions. Word has length 108 [2023-12-19 19:06:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 19:06:30,705 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 251 transitions. [2023-12-19 19:06:30,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 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-12-19 19:06:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 251 transitions. [2023-12-19 19:06:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-19 19:06:30,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 19:06:30,707 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2023-12-19 19:06:30,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 19:06:30,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:30,916 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 19:06:30,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 19:06:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1650934405, now seen corresponding path program 3 times [2023-12-19 19:06:30,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 19:06:30,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366409385] [2023-12-19 19:06:30,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:30,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 19:06:30,928 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 19:06:30,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [539478304] [2023-12-19 19:06:30,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 19:06:30,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:30,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 19:06:30,929 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 19:06:30,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 19:06:30,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-19 19:06:30,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 19:06:30,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-19 19:06:31,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 19:06:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-12-19 19:06:31,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 19:06:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-12-19 19:06:31,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 19:06:31,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366409385] [2023-12-19 19:06:31,490 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 19:06:31,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539478304] [2023-12-19 19:06:31,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539478304] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 19:06:31,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 19:06:31,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-12-19 19:06:31,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848568013] [2023-12-19 19:06:31,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 19:06:31,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-19 19:06:31,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 19:06:31,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-19 19:06:31,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-12-19 19:06:31,491 INFO L87 Difference]: Start difference. First operand 229 states and 251 transitions. Second operand has 18 states, 14 states have (on average 2.357142857142857) internal successors, (33), 17 states have internal predecessors, (33), 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-12-19 19:06:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 19:06:31,668 INFO L93 Difference]: Finished difference Result 448 states and 491 transitions. [2023-12-19 19:06:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 19:06:31,668 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.357142857142857) internal successors, (33), 17 states have internal predecessors, (33), 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 228 [2023-12-19 19:06:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 19:06:31,674 INFO L225 Difference]: With dead ends: 448 [2023-12-19 19:06:31,674 INFO L226 Difference]: Without dead ends: 442 [2023-12-19 19:06:31,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 437 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-12-19 19:06:31,675 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 19:06:31,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 69 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 19:06:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-12-19 19:06:31,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 439. [2023-12-19 19:06:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 351 states have (on average 1.1253561253561253) internal successors, (395), 351 states have internal predecessors, (395), 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-12-19 19:06:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 482 transitions. [2023-12-19 19:06:31,722 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 482 transitions. Word has length 228 [2023-12-19 19:06:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 19:06:31,723 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 482 transitions. [2023-12-19 19:06:31,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.357142857142857) internal successors, (33), 17 states have internal predecessors, (33), 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-12-19 19:06:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 482 transitions. [2023-12-19 19:06:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-19 19:06:31,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 19:06:31,725 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 19:06:31,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-19 19:06:31,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:31,929 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 19:06:31,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 19:06:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash -970876035, now seen corresponding path program 1 times [2023-12-19 19:06:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 19:06:31,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738418907] [2023-12-19 19:06:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:31,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 19:06:31,941 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 19:06:31,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846412170] [2023-12-19 19:06:31,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:31,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:31,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 19:06:31,942 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 19:06:31,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 19:06:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 19:06:32,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-19 19:06:32,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 19:06:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 19:06:32,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 19:06:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-19 19:06:33,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 19:06:33,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738418907] [2023-12-19 19:06:33,051 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 19:06:33,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846412170] [2023-12-19 19:06:33,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846412170] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 19:06:33,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 19:06:33,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-12-19 19:06:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794252580] [2023-12-19 19:06:33,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 19:06:33,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-19 19:06:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 19:06:33,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-19 19:06:33,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-12-19 19:06:33,054 INFO L87 Difference]: Start difference. First operand 439 states and 482 transitions. Second operand has 50 states, 50 states have (on average 5.98) internal successors, (299), 50 states have internal predecessors, (299), 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-12-19 19:06:34,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 19:06:34,193 INFO L93 Difference]: Finished difference Result 928 states and 1042 transitions. [2023-12-19 19:06:34,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-12-19 19:06:34,194 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.98) internal successors, (299), 50 states have internal predecessors, (299), 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 228 [2023-12-19 19:06:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 19:06:34,201 INFO L225 Difference]: With dead ends: 928 [2023-12-19 19:06:34,201 INFO L226 Difference]: Without dead ends: 922 [2023-12-19 19:06:34,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-12-19 19:06:34,205 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 353 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 19:06:34,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 384 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 19:06:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2023-12-19 19:06:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 919. [2023-12-19 19:06:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 735 states have (on average 1.125170068027211) internal successors, (827), 735 states have internal predecessors, (827), 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-12-19 19:06:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1010 transitions. [2023-12-19 19:06:34,275 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1010 transitions. Word has length 228 [2023-12-19 19:06:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 19:06:34,276 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 1010 transitions. [2023-12-19 19:06:34,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.98) internal successors, (299), 50 states have internal predecessors, (299), 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-12-19 19:06:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1010 transitions. [2023-12-19 19:06:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2023-12-19 19:06:34,281 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 19:06:34,281 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 19:06:34,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-19 19:06:34,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-19 19:06:34,500 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 19:06:34,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 19:06:34,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1917042635, now seen corresponding path program 2 times [2023-12-19 19:06:34,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 19:06:34,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602818030] [2023-12-19 19:06:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 19:06:34,539 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 19:06:34,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1952081762] [2023-12-19 19:06:34,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 19:06:34,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:34,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 19:06:34,558 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 19:06:34,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-19 19:06:34,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 19:06:34,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 19:06:34,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 95 conjunts are in the unsatisfiable core [2023-12-19 19:06:34,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 19:06:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 19:06:35,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 19:06:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-12-19 19:06:38,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 19:06:38,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602818030] [2023-12-19 19:06:38,507 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 19:06:38,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952081762] [2023-12-19 19:06:38,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952081762] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 19:06:38,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 19:06:38,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2023-12-19 19:06:38,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601348265] [2023-12-19 19:06:38,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 19:06:38,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-12-19 19:06:38,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 19:06:38,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-12-19 19:06:38,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2023-12-19 19:06:38,515 INFO L87 Difference]: Start difference. First operand 919 states and 1010 transitions. Second operand has 98 states, 98 states have (on average 6.23469387755102) internal successors, (611), 98 states have internal predecessors, (611), 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-12-19 19:06:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 19:06:43,063 INFO L93 Difference]: Finished difference Result 1888 states and 2122 transitions. [2023-12-19 19:06:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2023-12-19 19:06:43,064 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 6.23469387755102) internal successors, (611), 98 states have internal predecessors, (611), 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 468 [2023-12-19 19:06:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 19:06:43,070 INFO L225 Difference]: With dead ends: 1888 [2023-12-19 19:06:43,070 INFO L226 Difference]: Without dead ends: 1882 [2023-12-19 19:06:43,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1027 GetRequests, 838 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2023-12-19 19:06:43,077 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 902 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 19:06:43,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 712 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 19:06:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2023-12-19 19:06:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1879. [2023-12-19 19:06:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1503 states have (on average 1.1250831669993346) internal successors, (1691), 1503 states have internal predecessors, (1691), 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-12-19 19:06:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2066 transitions. [2023-12-19 19:06:43,233 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2066 transitions. Word has length 468 [2023-12-19 19:06:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 19:06:43,234 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 2066 transitions. [2023-12-19 19:06:43,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 6.23469387755102) internal successors, (611), 98 states have internal predecessors, (611), 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-12-19 19:06:43,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2066 transitions. [2023-12-19 19:06:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 949 [2023-12-19 19:06:43,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 19:06:43,258 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 94, 93, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 19:06:43,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-19 19:06:43,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:43,468 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 19:06:43,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 19:06:43,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1016211035, now seen corresponding path program 3 times [2023-12-19 19:06:43,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 19:06:43,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922826643] [2023-12-19 19:06:43,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 19:06:43,503 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 19:06:43,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482379362] [2023-12-19 19:06:43,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 19:06:43,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:43,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 19:06:43,520 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 19:06:43,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-19 19:06:44,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 95 check-sat command(s) [2023-12-19 19:06:44,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 19:06:44,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 2309 conjuncts, 191 conjunts are in the unsatisfiable core [2023-12-19 19:06:44,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 19:06:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 43898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 19:06:47,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 19:06:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 26414 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2023-12-19 19:06:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 19:06:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922826643] [2023-12-19 19:06:51,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 19:06:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482379362] [2023-12-19 19:06:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482379362] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 19:06:51,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 19:06:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2023-12-19 19:06:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872159353] [2023-12-19 19:06:51,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 19:06:51,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-12-19 19:06:51,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 19:06:51,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-12-19 19:06:51,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2023-12-19 19:06:51,341 INFO L87 Difference]: Start difference. First operand 1879 states and 2066 transitions. Second operand has 104 states, 104 states have (on average 7.605769230769231) internal successors, (791), 104 states have internal predecessors, (791), 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-12-19 19:06:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 19:06:55,650 INFO L93 Difference]: Finished difference Result 2008 states and 2212 transitions. [2023-12-19 19:06:55,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2023-12-19 19:06:55,651 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 7.605769230769231) internal successors, (791), 104 states have internal predecessors, (791), 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 948 [2023-12-19 19:06:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 19:06:55,657 INFO L225 Difference]: With dead ends: 2008 [2023-12-19 19:06:55,657 INFO L226 Difference]: Without dead ends: 2002 [2023-12-19 19:06:55,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1993 GetRequests, 1702 SyntacticMatches, 90 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9505 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2023-12-19 19:06:55,660 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 404 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 19:06:55,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 777 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 19:06:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2023-12-19 19:06:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1999. [2023-12-19 19:06:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1599 states have (on average 1.1250781738586617) internal successors, (1799), 1599 states have internal predecessors, (1799), 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-12-19 19:06:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2198 transitions. [2023-12-19 19:06:55,790 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2198 transitions. Word has length 948 [2023-12-19 19:06:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 19:06:55,791 INFO L495 AbstractCegarLoop]: Abstraction has 1999 states and 2198 transitions. [2023-12-19 19:06:55,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.605769230769231) internal successors, (791), 104 states have internal predecessors, (791), 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-12-19 19:06:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2198 transitions. [2023-12-19 19:06:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1009 [2023-12-19 19:06:55,800 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 19:06:55,801 INFO L195 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 19:06:55,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-19 19:06:56,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-19 19:06:56,010 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 19:06:56,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 19:06:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2091381843, now seen corresponding path program 4 times [2023-12-19 19:06:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 19:06:56,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379293850] [2023-12-19 19:06:56,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 19:06:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 19:06:56,061 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 19:06:56,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796436926] [2023-12-19 19:06:56,061 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-19 19:06:56,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 19:06:56,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 19:06:56,062 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 19:06:56,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-19 19:06:56,443 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-19 19:06:56,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-19 19:06:56,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 19:06:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 19:06:57,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 19:06:57,292 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 19:06:57,292 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 19:06:57,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-19 19:06:57,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-19 19:06:57,506 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2023-12-19 19:06:57,509 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 19:06:57,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 07:06:57 BoogieIcfgContainer [2023-12-19 19:06:57,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 19:06:57,626 INFO L158 Benchmark]: Toolchain (without parser) took 31684.28ms. Allocated memory was 285.2MB in the beginning and 494.9MB in the end (delta: 209.7MB). Free memory was 236.3MB in the beginning and 300.7MB in the end (delta: -64.3MB). Peak memory consumption was 146.4MB. Max. memory is 8.0GB. [2023-12-19 19:06:57,626 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 19:06:57,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.98ms. Allocated memory is still 285.2MB. Free memory was 236.0MB in the beginning and 224.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-19 19:06:57,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.02ms. Allocated memory is still 285.2MB. Free memory was 224.9MB in the beginning and 223.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 19:06:57,626 INFO L158 Benchmark]: Boogie Preprocessor took 19.06ms. Allocated memory is still 285.2MB. Free memory was 223.4MB in the beginning and 221.6MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-19 19:06:57,626 INFO L158 Benchmark]: RCFGBuilder took 300.28ms. Allocated memory is still 285.2MB. Free memory was 221.6MB in the beginning and 210.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-19 19:06:57,627 INFO L158 Benchmark]: TraceAbstraction took 31167.27ms. Allocated memory was 285.2MB in the beginning and 494.9MB in the end (delta: 209.7MB). Free memory was 209.8MB in the beginning and 300.7MB in the end (delta: -90.9MB). Peak memory consumption was 119.1MB. Max. memory is 8.0GB. [2023-12-19 19:06:57,628 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.09ms. Allocated memory is still 197.1MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.98ms. Allocated memory is still 285.2MB. Free memory was 236.0MB in the beginning and 224.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.02ms. Allocated memory is still 285.2MB. Free memory was 224.9MB in the beginning and 223.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.06ms. Allocated memory is still 285.2MB. Free memory was 223.4MB in the beginning and 221.6MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 300.28ms. Allocated memory is still 285.2MB. Free memory was 221.6MB in the beginning and 210.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 31167.27ms. Allocated memory was 285.2MB in the beginning and 494.9MB in the end (delta: 209.7MB). Free memory was 209.8MB in the beginning and 300.7MB in the end (delta: -90.9MB). Peak memory consumption was 119.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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; [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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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=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, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.0s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2001 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2000 mSDsluCounter, 2588 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2472 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1719 IncrementalHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 116 mSDtfsCounter, 1719 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4459 GetRequests, 3731 SyntacticMatches, 91 SemanticMatches, 637 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17005 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1999occurred 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: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 3102 NumberOfCodeBlocks, 2892 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 4162 ConstructedInterpolants, 1 QuantifiedInterpolants, 11300 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-12-19 19:06:57,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...