./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 23:31:39,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 23:31:39,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 23:31:39,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 23:31:39,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 23:31:39,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 23:31:39,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 23:31:39,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 23:31:39,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 23:31:39,943 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 23:31:39,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 23:31:39,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 23:31:39,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 23:31:39,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 23:31:39,945 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 23:31:39,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 23:31:39,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 23:31:39,947 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 23:31:39,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 23:31:39,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 23:31:39,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 23:31:39,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 23:31:39,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 23:31:39,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 23:31:39,952 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 23:31:39,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 23:31:39,953 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 23:31:39,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 23:31:39,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 23:31:39,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 23:31:39,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 23:31:39,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:31:39,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 23:31:39,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 23:31:39,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 23:31:39,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 23:31:39,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 23:31:39,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 23:31:39,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 23:31:39,960 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 23:31:39,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 23:31:39,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 23:31:39,961 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 23:31:40,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 23:31:40,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 23:31:40,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 23:31:40,196 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 23:31:40,197 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 23:31:40,198 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-11-22 23:31:41,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 23:31:41,599 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 23:31:41,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2023-11-22 23:31:41,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14969a8e7/5703d0ac3aa145cf9ede5d034bfc4e41/FLAG5b973fad1 [2023-11-22 23:31:41,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14969a8e7/5703d0ac3aa145cf9ede5d034bfc4e41 [2023-11-22 23:31:41,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 23:31:41,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 23:31:41,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 23:31:41,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 23:31:41,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 23:31:41,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce382fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41, skipping insertion in model container [2023-11-22 23:31:41,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,654 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 23:31:41,802 WARN L240 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-11-22 23:31:41,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:31:41,829 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 23:31:41,839 WARN L240 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-11-22 23:31:41,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:31:41,858 INFO L206 MainTranslator]: Completed translation [2023-11-22 23:31:41,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41 WrapperNode [2023-11-22 23:31:41,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 23:31:41,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 23:31:41,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 23:31:41,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 23:31:41,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,884 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-11-22 23:31:41,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 23:31:41,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 23:31:41,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 23:31:41,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 23:31:41,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 23:31:41,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 23:31:41,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 23:31:41,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 23:31:41,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41" (1/1) ... [2023-11-22 23:31:41,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:31:41,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:41,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 23:31:41,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 23:31:42,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 23:31:42,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 23:31:42,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 23:31:42,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 23:31:42,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-22 23:31:42,004 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-22 23:31:42,067 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 23:31:42,069 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 23:31:42,254 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 23:31:42,275 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 23:31:42,275 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 23:31:42,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:31:42 BoogieIcfgContainer [2023-11-22 23:31:42,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 23:31:42,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 23:31:42,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 23:31:42,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 23:31:42,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:31:41" (1/3) ... [2023-11-22 23:31:42,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee1de4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:31:42, skipping insertion in model container [2023-11-22 23:31:42,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:31:41" (2/3) ... [2023-11-22 23:31:42,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee1de4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:31:42, skipping insertion in model container [2023-11-22 23:31:42,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:31:42" (3/3) ... [2023-11-22 23:31:42,284 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2023-11-22 23:31:42,301 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 23:31:42,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 23:31:42,340 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 23:31:42,346 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;@524c4a66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 23:31:42,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 23:31:42,349 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-11-22 23:31:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 23:31:42,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:42,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:42,356 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:42,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:42,361 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2023-11-22 23:31:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:42,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812094660] [2023-11-22 23:31:42,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:42,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:42,461 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:42,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1575807755] [2023-11-22 23:31:42,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:42,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:42,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:42,468 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-11-22 23:31:42,474 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-11-22 23:31:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:31:42,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-22 23:31:42,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:31:42,688 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:31:42,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:31:42,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812094660] [2023-11-22 23:31:42,689 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:31:42,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575807755] [2023-11-22 23:31:42,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575807755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:31:42,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:31:42,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 23:31:42,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739075372] [2023-11-22 23:31:42,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:31:42,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 23:31:42,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:31:42,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 23:31:42,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 23:31:42,723 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-11-22 23:31:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:31:42,863 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2023-11-22 23:31:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:31:42,866 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-11-22 23:31:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:31:42,870 INFO L225 Difference]: With dead ends: 46 [2023-11-22 23:31:42,870 INFO L226 Difference]: Without dead ends: 24 [2023-11-22 23:31:42,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 23:31:42,876 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-11-22 23:31:42,877 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-11-22 23:31:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-22 23:31:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-11-22 23:31:42,907 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-11-22 23:31:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-11-22 23:31:42,910 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 7 [2023-11-22 23:31:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:31:42,910 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-11-22 23:31:42,911 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-11-22 23:31:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-11-22 23:31:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 23:31:42,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:42,912 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:42,931 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-11-22 23:31:43,126 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-11-22 23:31:43,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:43,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash -479331439, now seen corresponding path program 1 times [2023-11-22 23:31:43,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:43,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555342588] [2023-11-22 23:31:43,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:43,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:43,139 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:43,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840008414] [2023-11-22 23:31:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:43,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:43,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:43,143 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-11-22 23:31:43,156 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-11-22 23:31:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:31:43,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-22 23:31:43,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:31:43,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:31:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 23:31:43,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:31:43,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555342588] [2023-11-22 23:31:43,482 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:31:43,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840008414] [2023-11-22 23:31:43,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840008414] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:31:43,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:31:43,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2023-11-22 23:31:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340060109] [2023-11-22 23:31:43,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:31:43,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 23:31:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:31:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 23:31:43,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:31:43,501 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:31:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:31:43,713 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-11-22 23:31:43,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 23:31:43,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 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-11-22 23:31:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:31:43,715 INFO L225 Difference]: With dead ends: 40 [2023-11-22 23:31:43,715 INFO L226 Difference]: Without dead ends: 33 [2023-11-22 23:31:43,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-22 23:31:43,717 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:31:43,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 70 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:31:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-22 23:31:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-22 23:31:43,729 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-11-22 23:31:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-11-22 23:31:43,730 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2023-11-22 23:31:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:31:43,731 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-22 23:31:43,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:31:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-11-22 23:31:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 23:31:43,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:43,733 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:43,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 23:31:43,947 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-11-22 23:31:43,947 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:43,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:43,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1366888132, now seen corresponding path program 1 times [2023-11-22 23:31:43,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:43,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833361661] [2023-11-22 23:31:43,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:43,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:43,959 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:43,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1057888334] [2023-11-22 23:31:43,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:43,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:43,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:43,961 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-11-22 23:31:43,978 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-11-22 23:31:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:31:44,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 23:31:44,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:31:44,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:31:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:31:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:31:44,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833361661] [2023-11-22 23:31:44,089 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:31:44,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057888334] [2023-11-22 23:31:44,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057888334] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:31:44,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:31:44,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-11-22 23:31:44,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242817527] [2023-11-22 23:31:44,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:31:44,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 23:31:44,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:31:44,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 23:31:44,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-22 23:31:44,093 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-11-22 23:31:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:31:44,155 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2023-11-22 23:31:44,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 23:31:44,155 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-11-22 23:31:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:31:44,158 INFO L225 Difference]: With dead ends: 72 [2023-11-22 23:31:44,158 INFO L226 Difference]: Without dead ends: 66 [2023-11-22 23:31:44,159 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-11-22 23:31:44,162 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:31:44,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 74 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:31:44,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-22 23:31:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2023-11-22 23:31:44,183 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-11-22 23:31:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-11-22 23:31:44,184 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 18 [2023-11-22 23:31:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:31:44,185 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-11-22 23:31:44,185 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-11-22 23:31:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2023-11-22 23:31:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-22 23:31:44,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:44,186 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:44,204 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-11-22 23:31:44,401 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-11-22 23:31:44,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:44,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash -382706270, now seen corresponding path program 1 times [2023-11-22 23:31:44,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:44,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446909168] [2023-11-22 23:31:44,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:44,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:44,418 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:44,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419778115] [2023-11-22 23:31:44,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:44,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:44,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:44,420 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-11-22 23:31:44,443 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-11-22 23:31:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:31:44,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-22 23:31:44,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 23:31:44,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:31:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 23:31:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:31:45,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446909168] [2023-11-22 23:31:45,323 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:31:45,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419778115] [2023-11-22 23:31:45,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419778115] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:31:45,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:31:45,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2023-11-22 23:31:45,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922036084] [2023-11-22 23:31:45,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:31:45,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-22 23:31:45,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:31:45,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-22 23:31:45,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2023-11-22 23:31:45,326 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 21 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 23:31:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:31:46,363 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2023-11-22 23:31:46,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-22 23:31:46,363 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 2 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-11-22 23:31:46,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:31:46,364 INFO L225 Difference]: With dead ends: 83 [2023-11-22 23:31:46,364 INFO L226 Difference]: Without dead ends: 75 [2023-11-22 23:31:46,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2023-11-22 23:31:46,366 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 23:31:46,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 110 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 23:31:46,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-22 23:31:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2023-11-22 23:31:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-22 23:31:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2023-11-22 23:31:46,395 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 24 [2023-11-22 23:31:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:31:46,396 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2023-11-22 23:31:46,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 23:31:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2023-11-22 23:31:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 23:31:46,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:46,398 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:46,416 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-11-22 23:31:46,612 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-11-22 23:31:46,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:46,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:46,613 INFO L85 PathProgramCache]: Analyzing trace with hash 506464861, now seen corresponding path program 1 times [2023-11-22 23:31:46,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:46,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279497222] [2023-11-22 23:31:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:46,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:46,621 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:46,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1407894633] [2023-11-22 23:31:46,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:46,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:46,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:46,623 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-11-22 23:31:46,642 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-11-22 23:31:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:31:46,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-22 23:31:46,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-22 23:31:46,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:31:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-22 23:31:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:31:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279497222] [2023-11-22 23:31:46,926 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:31:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407894633] [2023-11-22 23:31:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407894633] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:31:46,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:31:46,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2023-11-22 23:31:46,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772747457] [2023-11-22 23:31:46,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:31:46,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-22 23:31:46,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:31:46,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-22 23:31:46,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-22 23:31:46,929 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 23:31:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:31:47,078 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2023-11-22 23:31:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 23:31:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 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 34 [2023-11-22 23:31:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:31:47,080 INFO L225 Difference]: With dead ends: 90 [2023-11-22 23:31:47,080 INFO L226 Difference]: Without dead ends: 84 [2023-11-22 23:31:47,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2023-11-22 23:31:47,081 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:31:47,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 75 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:31:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-22 23:31:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2023-11-22 23:31:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 23:31:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2023-11-22 23:31:47,099 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 34 [2023-11-22 23:31:47,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:31:47,100 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2023-11-22 23:31:47,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 23:31:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2023-11-22 23:31:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-22 23:31:47,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:47,102 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:47,123 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-11-22 23:31:47,317 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-11-22 23:31:47,317 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:47,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:47,318 INFO L85 PathProgramCache]: Analyzing trace with hash -598180516, now seen corresponding path program 1 times [2023-11-22 23:31:47,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:47,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136788821] [2023-11-22 23:31:47,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:47,327 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:47,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1660274497] [2023-11-22 23:31:47,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:47,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:47,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:47,328 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-11-22 23:31:47,332 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-11-22 23:31:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:31:47,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-22 23:31:47,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-22 23:31:47,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:31:48,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:31:48,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136788821] [2023-11-22 23:31:48,395 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:31:48,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660274497] [2023-11-22 23:31:48,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660274497] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:31:48,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-22 23:31:48,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-11-22 23:31:48,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504489183] [2023-11-22 23:31:48,396 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-22 23:31:48,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 23:31:48,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:31:48,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 23:31:48,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-11-22 23:31:48,398 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 23:31:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:31:48,939 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2023-11-22 23:31:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 23:31:48,939 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2023-11-22 23:31:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:31:48,940 INFO L225 Difference]: With dead ends: 118 [2023-11-22 23:31:48,940 INFO L226 Difference]: Without dead ends: 94 [2023-11-22 23:31:48,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2023-11-22 23:31:48,941 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 23:31:48,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 23:31:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-22 23:31:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2023-11-22 23:31:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 72 states have internal predecessors, (83), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 23:31:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2023-11-22 23:31:48,972 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 44 [2023-11-22 23:31:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:31:48,974 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2023-11-22 23:31:48,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 23:31:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2023-11-22 23:31:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-22 23:31:48,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:48,976 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:48,994 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-11-22 23:31:49,191 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-11-22 23:31:49,192 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:49,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1582734628, now seen corresponding path program 2 times [2023-11-22 23:31:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:49,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662808868] [2023-11-22 23:31:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:49,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:49,202 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:49,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1393559080] [2023-11-22 23:31:49,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 23:31:49,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:49,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:49,221 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-11-22 23:31:49,240 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-11-22 23:31:49,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 23:31:49,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:31:49,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 23:31:49,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-22 23:31:49,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:31:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 23:31:49,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:31:49,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662808868] [2023-11-22 23:31:49,368 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:31:49,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393559080] [2023-11-22 23:31:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393559080] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:31:49,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:31:49,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-11-22 23:31:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812537588] [2023-11-22 23:31:49,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:31:49,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 23:31:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:31:49,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 23:31:49,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 23:31:49,372 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-22 23:31:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:31:49,441 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2023-11-22 23:31:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:31:49,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2023-11-22 23:31:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:31:49,445 INFO L225 Difference]: With dead ends: 123 [2023-11-22 23:31:49,445 INFO L226 Difference]: Without dead ends: 99 [2023-11-22 23:31:49,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-22 23:31:49,446 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:31:49,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:31:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-22 23:31:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-11-22 23:31:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 79 states have internal predecessors, (91), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-22 23:31:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2023-11-22 23:31:49,470 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 44 [2023-11-22 23:31:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:31:49,471 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2023-11-22 23:31:49,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-22 23:31:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2023-11-22 23:31:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-22 23:31:49,472 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:49,472 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:49,490 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-11-22 23:31:49,687 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-11-22 23:31:49,688 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:49,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:49,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1442186018, now seen corresponding path program 3 times [2023-11-22 23:31:49,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:49,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318822009] [2023-11-22 23:31:49,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:49,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:49,697 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:49,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928902116] [2023-11-22 23:31:49,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 23:31:49,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:49,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:49,698 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-11-22 23:31:49,716 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-11-22 23:31:49,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-22 23:31:49,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:31:49,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-22 23:31:49,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-22 23:31:49,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:31:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-22 23:31:50,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:31:50,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318822009] [2023-11-22 23:31:50,053 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:31:50,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928902116] [2023-11-22 23:31:50,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928902116] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:31:50,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:31:50,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2023-11-22 23:31:50,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038347585] [2023-11-22 23:31:50,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:31:50,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-22 23:31:50,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:31:50,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-22 23:31:50,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-11-22 23:31:50,055 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 18 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 23:31:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:31:50,333 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2023-11-22 23:31:50,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-22 23:31:50,334 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 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 44 [2023-11-22 23:31:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:31:50,334 INFO L225 Difference]: With dead ends: 104 [2023-11-22 23:31:50,334 INFO L226 Difference]: Without dead ends: 98 [2023-11-22 23:31:50,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2023-11-22 23:31:50,336 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:31:50,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 69 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:31:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-22 23:31:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2023-11-22 23:31:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 23:31:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2023-11-22 23:31:50,359 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 44 [2023-11-22 23:31:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:31:50,359 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2023-11-22 23:31:50,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 23:31:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2023-11-22 23:31:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-22 23:31:50,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:50,362 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:50,372 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-11-22 23:31:50,568 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-11-22 23:31:50,568 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:50,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2080125809, now seen corresponding path program 1 times [2023-11-22 23:31:50,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:50,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980754481] [2023-11-22 23:31:50,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:50,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:50,581 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:50,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794036871] [2023-11-22 23:31:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:50,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:50,582 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-11-22 23:31:50,600 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-11-22 23:31:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:31:50,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-22 23:31:50,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:31:50,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:31:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 23:31:50,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:31:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980754481] [2023-11-22 23:31:50,813 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:31:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794036871] [2023-11-22 23:31:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794036871] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:31:50,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:31:50,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-11-22 23:31:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550897634] [2023-11-22 23:31:50,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:31:50,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 23:31:50,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:31:50,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 23:31:50,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-11-22 23:31:50,815 INFO L87 Difference]: Start difference. First operand 83 states and 93 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-11-22 23:31:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:31:50,962 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2023-11-22 23:31:50,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-22 23:31:50,963 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-11-22 23:31:50,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:31:50,964 INFO L225 Difference]: With dead ends: 149 [2023-11-22 23:31:50,964 INFO L226 Difference]: Without dead ends: 143 [2023-11-22 23:31:50,965 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-11-22 23:31:50,965 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 59 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:31:50,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 109 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:31:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-22 23:31:50,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2023-11-22 23:31:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 115 states have (on average 1.1130434782608696) internal successors, (128), 115 states have internal predecessors, (128), 16 states have call successors, (16), 12 states have call predecessors, (16), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-22 23:31:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2023-11-22 23:31:50,990 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 48 [2023-11-22 23:31:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:31:50,990 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2023-11-22 23:31:50,991 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-11-22 23:31:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2023-11-22 23:31:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-22 23:31:50,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:50,992 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:51,007 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-11-22 23:31:51,207 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-11-22 23:31:51,207 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:51,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1893266719, now seen corresponding path program 2 times [2023-11-22 23:31:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201717231] [2023-11-22 23:31:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:51,216 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:51,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [908201683] [2023-11-22 23:31:51,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 23:31:51,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:51,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:51,218 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-11-22 23:31:51,231 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-11-22 23:31:51,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 23:31:51,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:31:51,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-22 23:31:51,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:31:51,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:31:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-22 23:31:51,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:31:51,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201717231] [2023-11-22 23:31:51,756 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:31:51,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908201683] [2023-11-22 23:31:51,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908201683] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:31:51,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:31:51,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-11-22 23:31:51,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352667407] [2023-11-22 23:31:51,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:31:51,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-22 23:31:51,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:31:51,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-22 23:31:51,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-11-22 23:31:51,759 INFO L87 Difference]: Start difference. First operand 143 states and 159 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-11-22 23:31:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:31:52,177 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2023-11-22 23:31:52,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-22 23:31:52,178 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-11-22 23:31:52,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:31:52,180 INFO L225 Difference]: With dead ends: 269 [2023-11-22 23:31:52,180 INFO L226 Difference]: Without dead ends: 263 [2023-11-22 23:31:52,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-11-22 23:31:52,182 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 126 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:31:52,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 208 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:31:52,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-11-22 23:31:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2023-11-22 23:31:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 211 states have (on average 1.1184834123222749) internal successors, (236), 211 states have internal predecessors, (236), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-22 23:31:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2023-11-22 23:31:52,223 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 108 [2023-11-22 23:31:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:31:52,224 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2023-11-22 23:31:52,224 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-11-22 23:31:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2023-11-22 23:31:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-11-22 23:31:52,226 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:52,226 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:52,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-22 23:31:52,440 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-11-22 23:31:52,440 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:52,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:52,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1650934405, now seen corresponding path program 3 times [2023-11-22 23:31:52,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:52,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067110690] [2023-11-22 23:31:52,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:52,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:52,466 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:52,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [591132510] [2023-11-22 23:31:52,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 23:31:52,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:52,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:52,469 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-11-22 23:31:52,493 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-11-22 23:31:52,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-22 23:31:52,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:31:52,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-22 23:31:52,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-11-22 23:31:52,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:31:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-11-22 23:31:53,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:31:53,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067110690] [2023-11-22 23:31:53,084 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:31:53,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591132510] [2023-11-22 23:31:53,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591132510] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:31:53,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:31:53,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2023-11-22 23:31:53,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661978368] [2023-11-22 23:31:53,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:31:53,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-22 23:31:53,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:31:53,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-22 23:31:53,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-22 23:31:53,087 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 23:31:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:31:53,325 INFO L93 Difference]: Finished difference Result 466 states and 512 transitions. [2023-11-22 23:31:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 23:31:53,325 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (5), 2 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-11-22 23:31:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:31:53,328 INFO L225 Difference]: With dead ends: 466 [2023-11-22 23:31:53,328 INFO L226 Difference]: Without dead ends: 460 [2023-11-22 23:31:53,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 436 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2023-11-22 23:31:53,329 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:31:53,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 70 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:31:53,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-11-22 23:31:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 457. [2023-11-22 23:31:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 366 states have (on average 1.1202185792349726) internal successors, (410), 366 states have internal predecessors, (410), 47 states have call successors, (47), 44 states have call predecessors, (47), 43 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-22 23:31:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 503 transitions. [2023-11-22 23:31:53,402 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 503 transitions. Word has length 228 [2023-11-22 23:31:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:31:53,403 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 503 transitions. [2023-11-22 23:31:53,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 23:31:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 503 transitions. [2023-11-22 23:31:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-11-22 23:31:53,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:53,406 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:53,415 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-11-22 23:31:53,611 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-11-22 23:31:53,611 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:53,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:53,612 INFO L85 PathProgramCache]: Analyzing trace with hash -970876035, now seen corresponding path program 1 times [2023-11-22 23:31:53,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:53,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871664348] [2023-11-22 23:31:53,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:53,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:53,626 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:53,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006889537] [2023-11-22 23:31:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:53,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:53,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:53,628 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:31:53,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-22 23:31:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:31:53,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-22 23:31:53,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:31:54,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:31:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-22 23:31:55,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:31:55,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871664348] [2023-11-22 23:31:55,058 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:31:55,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006889537] [2023-11-22 23:31:55,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006889537] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:31:55,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:31:55,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-11-22 23:31:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231891693] [2023-11-22 23:31:55,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:31:55,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-22 23:31:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:31:55,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-22 23:31:55,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-11-22 23:31:55,063 INFO L87 Difference]: Start difference. First operand 457 states and 503 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-11-22 23:31:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:31:56,357 INFO L93 Difference]: Finished difference Result 946 states and 1063 transitions. [2023-11-22 23:31:56,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-11-22 23:31:56,358 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-11-22 23:31:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:31:56,362 INFO L225 Difference]: With dead ends: 946 [2023-11-22 23:31:56,362 INFO L226 Difference]: Without dead ends: 940 [2023-11-22 23:31:56,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-11-22 23:31:56,365 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 300 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 23:31:56,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 389 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 23:31:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2023-11-22 23:31:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 937. [2023-11-22 23:31:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 750 states have (on average 1.1226666666666667) internal successors, (842), 750 states have internal predecessors, (842), 95 states have call successors, (95), 92 states have call predecessors, (95), 91 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2023-11-22 23:31:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1031 transitions. [2023-11-22 23:31:56,517 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1031 transitions. Word has length 228 [2023-11-22 23:31:56,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:31:56,517 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1031 transitions. [2023-11-22 23:31:56,518 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-11-22 23:31:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1031 transitions. [2023-11-22 23:31:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2023-11-22 23:31:56,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:31:56,526 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:31:56,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-22 23:31:56,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-22 23:31:56,741 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:31:56,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:31:56,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1917042635, now seen corresponding path program 2 times [2023-11-22 23:31:56,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:31:56,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544320263] [2023-11-22 23:31:56,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:31:56,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:31:56,772 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:31:56,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1067750199] [2023-11-22 23:31:56,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 23:31:56,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:31:56,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:31:56,775 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:31:56,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-22 23:31:56,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 23:31:56,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:31:56,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-22 23:31:57,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:31:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:31:58,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:32:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-11-22 23:32:01,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:32:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544320263] [2023-11-22 23:32:01,036 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:32:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067750199] [2023-11-22 23:32:01,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067750199] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:32:01,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:32:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2023-11-22 23:32:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197405868] [2023-11-22 23:32:01,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:32:01,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-11-22 23:32:01,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:32:01,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-11-22 23:32:01,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2023-11-22 23:32:01,049 INFO L87 Difference]: Start difference. First operand 937 states and 1031 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-11-22 23:32:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:32:06,090 INFO L93 Difference]: Finished difference Result 1906 states and 2143 transitions. [2023-11-22 23:32:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2023-11-22 23:32:06,090 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-11-22 23:32:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:32:06,097 INFO L225 Difference]: With dead ends: 1906 [2023-11-22 23:32:06,097 INFO L226 Difference]: Without dead ends: 1900 [2023-11-22 23:32:06,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1027 GetRequests, 838 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2023-11-22 23:32:06,105 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 748 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 23:32:06,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 730 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 23:32:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2023-11-22 23:32:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1897. [2023-11-22 23:32:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1518 states have (on average 1.1238471673254282) internal successors, (1706), 1518 states have internal predecessors, (1706), 191 states have call successors, (191), 188 states have call predecessors, (191), 187 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2023-11-22 23:32:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2087 transitions. [2023-11-22 23:32:06,362 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2087 transitions. Word has length 468 [2023-11-22 23:32:06,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:32:06,363 INFO L495 AbstractCegarLoop]: Abstraction has 1897 states and 2087 transitions. [2023-11-22 23:32:06,363 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-11-22 23:32:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2087 transitions. [2023-11-22 23:32:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 949 [2023-11-22 23:32:06,389 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:32:06,389 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 94, 93, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:32:06,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-22 23:32:06,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-22 23:32:06,608 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:32:06,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:32:06,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1016211035, now seen corresponding path program 3 times [2023-11-22 23:32:06,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:32:06,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975061157] [2023-11-22 23:32:06,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:32:06,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:32:06,644 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:32:06,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347918181] [2023-11-22 23:32:06,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 23:32:06,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:32:06,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:32:06,646 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:32:06,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-22 23:32:07,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 95 check-sat command(s) [2023-11-22 23:32:07,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:32:07,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 2309 conjuncts, 191 conjunts are in the unsatisfiable core [2023-11-22 23:32:07,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:32:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 43898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:32:11,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:32:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 26414 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2023-11-22 23:32:15,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:32:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975061157] [2023-11-22 23:32:15,997 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 23:32:15,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347918181] [2023-11-22 23:32:15,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347918181] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:32:15,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:32:15,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2023-11-22 23:32:15,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636928229] [2023-11-22 23:32:15,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:32:16,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-11-22 23:32:16,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:32:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-11-22 23:32:16,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2023-11-22 23:32:16,014 INFO L87 Difference]: Start difference. First operand 1897 states and 2087 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-11-22 23:32:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:32:21,016 INFO L93 Difference]: Finished difference Result 2026 states and 2233 transitions. [2023-11-22 23:32:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2023-11-22 23:32:21,018 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-11-22 23:32:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:32:21,025 INFO L225 Difference]: With dead ends: 2026 [2023-11-22 23:32:21,025 INFO L226 Difference]: Without dead ends: 2020 [2023-11-22 23:32:21,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1993 GetRequests, 1702 SyntacticMatches, 90 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9505 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2023-11-22 23:32:21,030 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 392 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 23:32:21,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 772 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 23:32:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2023-11-22 23:32:21,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 2017. [2023-11-22 23:32:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1614 states have (on average 1.123915737298637) internal successors, (1814), 1614 states have internal predecessors, (1814), 203 states have call successors, (203), 200 states have call predecessors, (203), 199 states have return successors, (202), 202 states have call predecessors, (202), 202 states have call successors, (202) [2023-11-22 23:32:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2219 transitions. [2023-11-22 23:32:21,307 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2219 transitions. Word has length 948 [2023-11-22 23:32:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:32:21,309 INFO L495 AbstractCegarLoop]: Abstraction has 2017 states and 2219 transitions. [2023-11-22 23:32:21,310 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-11-22 23:32:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2219 transitions. [2023-11-22 23:32:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1009 [2023-11-22 23:32:21,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:32:21,343 INFO L195 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:32:21,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-22 23:32:21,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:32:21,560 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:32:21,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:32:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2091381843, now seen corresponding path program 4 times [2023-11-22 23:32:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:32:21,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626508007] [2023-11-22 23:32:21,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:32:21,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:32:21,604 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 23:32:21,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945143772] [2023-11-22 23:32:21,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 23:32:21,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:32:21,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:32:21,605 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:32:21,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-22 23:32:22,040 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 23:32:22,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-22 23:32:22,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 23:32:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 23:32:22,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 23:32:22,983 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 23:32:22,984 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 23:32:23,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-22 23:32:23,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-22 23:32:23,207 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-22 23:32:23,212 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 23:32:23,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,326 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,330 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,333 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,336 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,338 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,340 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,341 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,341 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,342 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,345 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,345 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,350 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,350 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,351 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,352 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,353 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,353 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,357 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,362 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,362 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,362 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,363 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,363 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,363 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,363 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,369 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,369 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,369 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,370 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,370 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,370 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,371 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,371 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,371 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,371 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,372 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,372 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,372 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,373 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,373 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,373 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,374 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,374 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,374 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,376 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,379 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,379 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,379 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:32:23 BoogieIcfgContainer [2023-11-22 23:32:23,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 23:32:23,450 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 23:32:23,450 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 23:32:23,450 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 23:32:23,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:31:42" (3/4) ... [2023-11-22 23:32:23,452 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-22 23:32:23,483 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,484 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,484 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,485 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,485 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,485 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,485 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,486 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,486 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,486 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,487 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,487 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,487 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,488 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,488 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,488 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,488 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,489 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,489 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,489 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,490 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,490 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,490 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,490 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,491 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,491 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,491 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,493 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,493 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,527 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,527 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,527 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,527 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,528 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,528 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,528 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,528 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,529 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,529 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,529 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,529 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,530 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,530 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,530 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,530 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-22 23:32:23,727 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 23:32:23,727 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 23:32:23,728 INFO L158 Benchmark]: Toolchain (without parser) took 42105.68ms. Allocated memory was 132.1MB in the beginning and 539.0MB in the end (delta: 406.8MB). Free memory was 62.1MB in the beginning and 460.0MB in the end (delta: -397.9MB). Peak memory consumption was 287.6MB. Max. memory is 16.1GB. [2023-11-22 23:32:23,728 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 132.1MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:32:23,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.79ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 61.9MB in the beginning and 144.9MB in the end (delta: -82.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-22 23:32:23,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.12ms. Allocated memory is still 178.3MB. Free memory was 144.9MB in the beginning and 143.9MB in the end (delta: 987.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:32:23,730 INFO L158 Benchmark]: Boogie Preprocessor took 17.57ms. Allocated memory is still 178.3MB. Free memory was 143.9MB in the beginning and 142.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 23:32:23,730 INFO L158 Benchmark]: RCFGBuilder took 371.96ms. Allocated memory is still 178.3MB. Free memory was 142.8MB in the beginning and 130.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-22 23:32:23,730 INFO L158 Benchmark]: TraceAbstraction took 41171.26ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 129.2MB in the beginning and 198.1MB in the end (delta: -68.9MB). Peak memory consumption was 291.8MB. Max. memory is 16.1GB. [2023-11-22 23:32:23,731 INFO L158 Benchmark]: Witness Printer took 277.43ms. Allocated memory is still 539.0MB. Free memory was 198.1MB in the beginning and 460.0MB in the end (delta: -261.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-22 23:32:23,733 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.20ms. Allocated memory is still 132.1MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.79ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 61.9MB in the beginning and 144.9MB in the end (delta: -82.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.12ms. Allocated memory is still 178.3MB. Free memory was 144.9MB in the beginning and 143.9MB in the end (delta: 987.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.57ms. Allocated memory is still 178.3MB. Free memory was 143.9MB in the beginning and 142.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.96ms. Allocated memory is still 178.3MB. Free memory was 142.8MB in the beginning and 130.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 41171.26ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 129.2MB in the beginning and 198.1MB in the end (delta: -68.9MB). Peak memory consumption was 291.8MB. Max. memory is 16.1GB. * Witness Printer took 277.43ms. Allocated memory is still 539.0MB. Free memory was 198.1MB in the beginning and 460.0MB in the end (delta: -261.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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=199, Y=1, counter=0, v=-197, x=0, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=1, v=-197, x=0, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=1, v=-197, 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=199, Y=1, counter=1, v=-197, x=0, x=0, x=0, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=1, v=-197, x=0, x=0, x=0, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=1, v=-195, x=0, x=0, x=0, y=0] [L45] x++ VAL [X=199, Y=1, counter=1, v=-195, x=0, x=0, x=1, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=2, v=-195, 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=199, Y=1, counter=2, v=-195, x=0, x=1, x=1, 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=199, Y=1, counter=2, v=-195, x=0, x=1, x=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=2, v=-195, x=0, x=1, x=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=2, v=-193, x=0, x=1, x=1, y=0] [L45] x++ VAL [X=199, Y=1, counter=2, v=-193, x=0, x=1, x=2, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=3, v=-193, x=0, x=1, x=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=3, v=-193, x=0, x=2, x=2, 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=199, Y=1, counter=3, v=-193, x=0, x=2, x=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=3, v=-193, x=0, x=2, x=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=3, v=-191, x=0, x=2, x=2, y=0] [L45] x++ VAL [X=199, Y=1, counter=3, v=-191, x=0, x=2, x=3, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=4, v=-191, x=0, x=2, x=3, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=4, v=-191, x=0, x=3, x=3, 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=199, Y=1, counter=4, v=-191, x=0, x=3, x=3, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=4, v=-191, x=0, x=3, x=3, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=4, v=-189, x=0, x=3, x=3, y=0] [L45] x++ VAL [X=199, Y=1, counter=4, v=-189, x=0, x=3, x=4, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=5, v=-189, x=0, x=3, x=4, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=5, v=-189, x=0, x=4, x=4, 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=199, Y=1, counter=5, v=-189, x=0, x=4, x=4, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=5, v=-189, x=0, x=4, x=4, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=5, v=-187, x=0, x=4, x=4, y=0] [L45] x++ VAL [X=199, Y=1, counter=5, v=-187, x=0, x=4, x=5, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=6, v=-187, x=0, x=4, x=5, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=6, v=-187, x=0, x=5, x=5, 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=199, Y=1, counter=6, v=-187, x=0, x=5, x=5, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=6, v=-187, x=0, x=5, x=5, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=6, v=-185, x=0, x=5, x=5, y=0] [L45] x++ VAL [X=199, Y=1, counter=6, v=-185, x=0, x=5, x=6, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=7, v=-185, x=0, x=5, x=6, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=7, v=-185, x=0, x=6, x=6, 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=199, Y=1, counter=7, v=-185, x=0, x=6, x=6, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=7, v=-185, x=0, x=6, x=6, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=7, v=-183, x=0, x=6, x=6, y=0] [L45] x++ VAL [X=199, Y=1, counter=7, v=-183, x=0, x=6, x=7, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=8, v=-183, x=0, x=6, x=7, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=8, v=-183, x=0, x=7, x=7, 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=199, Y=1, counter=8, v=-183, x=0, x=7, x=7, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=8, v=-183, x=0, x=7, x=7, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=8, v=-181, x=0, x=7, x=7, y=0] [L45] x++ VAL [X=199, Y=1, counter=8, v=-181, x=0, x=7, x=8, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=9, v=-181, x=0, x=7, x=8, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=9, v=-181, x=0, x=8, x=8, 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=199, Y=1, counter=9, v=-181, x=0, x=8, x=8, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=9, v=-181, x=0, x=8, x=8, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=9, v=-179, x=0, x=8, x=8, y=0] [L45] x++ VAL [X=199, Y=1, counter=9, v=-179, x=0, x=8, x=9, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=10, v=-179, x=0, x=8, x=9, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=10, v=-179, x=0, x=9, x=9, 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=199, Y=1, counter=10, v=-179, x=0, x=9, x=9, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=10, v=-179, x=0, x=9, x=9, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=10, v=-177, x=0, x=9, x=9, y=0] [L45] x++ VAL [X=199, Y=1, counter=10, v=-177, x=0, x=10, x=9, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=11, v=-177, x=0, x=10, x=9, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=11, v=-177, x=0, x=10, x=10, 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=199, Y=1, counter=11, v=-177, x=0, x=10, x=10, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=11, v=-177, x=0, x=10, x=10, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=11, v=-175, x=0, x=10, x=10, y=0] [L45] x++ VAL [X=199, Y=1, counter=11, v=-175, x=0, x=10, x=11, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=12, v=-175, x=0, x=10, x=11, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=12, v=-175, x=0, x=11, x=11, 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=199, Y=1, counter=12, v=-175, x=0, x=11, x=11, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=12, v=-175, x=0, x=11, x=11, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=12, v=-173, x=0, x=11, x=11, y=0] [L45] x++ VAL [X=199, Y=1, counter=12, v=-173, x=0, x=11, x=12, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=13, v=-173, x=0, x=11, x=12, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=13, v=-173, x=0, x=12, x=12, 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=199, Y=1, counter=13, v=-173, x=0, x=12, x=12, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=13, v=-173, x=0, x=12, x=12, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=13, v=-171, x=0, x=12, x=12, y=0] [L45] x++ VAL [X=199, Y=1, counter=13, v=-171, x=0, x=12, x=13, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=14, v=-171, x=0, x=12, x=13, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=14, v=-171, x=0, x=13, x=13, 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=199, Y=1, counter=14, v=-171, x=0, x=13, x=13, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=14, v=-171, x=0, x=13, x=13, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=14, v=-169, x=0, x=13, x=13, y=0] [L45] x++ VAL [X=199, Y=1, counter=14, v=-169, x=0, x=13, x=14, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=15, v=-169, x=0, x=13, x=14, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=15, v=-169, x=0, x=14, x=14, 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=199, Y=1, counter=15, v=-169, x=0, x=14, x=14, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=15, v=-169, x=0, x=14, x=14, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=15, v=-167, x=0, x=14, x=14, y=0] [L45] x++ VAL [X=199, Y=1, counter=15, v=-167, x=0, x=14, x=15, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=16, v=-167, x=0, x=14, x=15, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=16, v=-167, x=0, x=15, x=15, 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=199, Y=1, counter=16, v=-167, x=0, x=15, x=15, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=16, v=-167, x=0, x=15, x=15, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=16, v=-165, x=0, x=15, x=15, y=0] [L45] x++ VAL [X=199, Y=1, counter=16, v=-165, x=0, x=15, x=16, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=17, v=-165, x=0, x=15, x=16, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=17, v=-165, x=0, x=16, x=16, 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=199, Y=1, counter=17, v=-165, x=0, x=16, x=16, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=17, v=-165, x=0, x=16, x=16, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=17, v=-163, x=0, x=16, x=16, y=0] [L45] x++ VAL [X=199, Y=1, counter=17, v=-163, x=0, x=16, x=17, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=18, v=-163, x=0, x=16, x=17, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=18, v=-163, x=0, x=17, x=17, 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=199, Y=1, counter=18, v=-163, x=0, x=17, x=17, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=18, v=-163, x=0, x=17, x=17, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=18, v=-161, x=0, x=17, x=17, y=0] [L45] x++ VAL [X=199, Y=1, counter=18, v=-161, x=0, x=17, x=18, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=19, v=-161, x=0, x=17, x=18, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=19, v=-161, x=0, x=18, x=18, 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=199, Y=1, counter=19, v=-161, x=0, x=18, x=18, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=19, v=-161, x=0, x=18, x=18, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=19, v=-159, x=0, x=18, x=18, y=0] [L45] x++ VAL [X=199, Y=1, counter=19, v=-159, x=0, x=18, x=19, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=20, v=-159, x=0, x=18, x=19, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=20, v=-159, x=0, x=19, x=19, 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=199, Y=1, counter=20, v=-159, x=0, x=19, x=19, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=20, v=-159, x=0, x=19, x=19, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=20, v=-157, x=0, x=19, x=19, y=0] [L45] x++ VAL [X=199, Y=1, counter=20, v=-157, x=0, x=19, x=20, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=21, v=-157, x=0, x=19, x=20, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=21, v=-157, x=0, x=20, x=20, 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=199, Y=1, counter=21, v=-157, x=0, x=20, x=20, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=21, v=-157, x=0, x=20, x=20, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=21, v=-155, x=0, x=20, x=20, y=0] [L45] x++ VAL [X=199, Y=1, counter=21, v=-155, x=0, x=20, x=21, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=22, v=-155, x=0, x=20, x=21, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=22, v=-155, x=0, x=21, x=21, 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=199, Y=1, counter=22, v=-155, x=0, x=21, x=21, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=22, v=-155, x=0, x=21, x=21, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=22, v=-153, x=0, x=21, x=21, y=0] [L45] x++ VAL [X=199, Y=1, counter=22, v=-153, x=0, x=21, x=22, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=23, v=-153, x=0, x=21, x=22, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=23, v=-153, x=0, x=22, x=22, 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=199, Y=1, counter=23, v=-153, x=0, x=22, x=22, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=23, v=-153, x=0, x=22, x=22, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=23, v=-151, x=0, x=22, x=22, y=0] [L45] x++ VAL [X=199, Y=1, counter=23, v=-151, x=0, x=22, x=23, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=24, v=-151, x=0, x=22, x=23, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=24, v=-151, x=0, x=23, x=23, 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=199, Y=1, counter=24, v=-151, x=0, x=23, x=23, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=24, v=-151, x=0, x=23, x=23, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=24, v=-149, x=0, x=23, x=23, y=0] [L45] x++ VAL [X=199, Y=1, counter=24, v=-149, x=0, x=23, x=24, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=25, v=-149, x=0, x=23, x=24, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=25, v=-149, x=0, x=24, x=24, 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=199, Y=1, counter=25, v=-149, x=0, x=24, x=24, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=25, v=-149, x=0, x=24, x=24, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=25, v=-147, x=0, x=24, x=24, y=0] [L45] x++ VAL [X=199, Y=1, counter=25, v=-147, x=0, x=24, x=25, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=26, v=-147, x=0, x=24, x=25, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=26, v=-147, x=0, x=25, x=25, 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=199, Y=1, counter=26, v=-147, x=0, x=25, x=25, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=26, v=-147, x=0, x=25, x=25, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=26, v=-145, x=0, x=25, x=25, y=0] [L45] x++ VAL [X=199, Y=1, counter=26, v=-145, x=0, x=25, x=26, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=27, v=-145, x=0, x=25, x=26, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=27, v=-145, x=0, x=26, x=26, 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=199, Y=1, counter=27, v=-145, x=0, x=26, x=26, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=27, v=-145, x=0, x=26, x=26, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=27, v=-143, x=0, x=26, x=26, y=0] [L45] x++ VAL [X=199, Y=1, counter=27, v=-143, x=0, x=26, x=27, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=28, v=-143, x=0, x=26, x=27, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=28, v=-143, x=0, x=27, x=27, 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=199, Y=1, counter=28, v=-143, x=0, x=27, x=27, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=28, v=-143, x=0, x=27, x=27, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=28, v=-141, x=0, x=27, x=27, y=0] [L45] x++ VAL [X=199, Y=1, counter=28, v=-141, x=0, x=27, x=28, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=29, v=-141, x=0, x=27, x=28, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=29, v=-141, x=0, x=28, x=28, 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=199, Y=1, counter=29, v=-141, x=0, x=28, x=28, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=29, v=-141, x=0, x=28, x=28, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=29, v=-139, x=0, x=28, x=28, y=0] [L45] x++ VAL [X=199, Y=1, counter=29, v=-139, x=0, x=28, x=29, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=30, v=-139, x=0, x=28, x=29, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=30, v=-139, x=0, x=29, x=29, 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=199, Y=1, counter=30, v=-139, x=0, x=29, x=29, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=30, v=-139, x=0, x=29, x=29, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=30, v=-137, x=0, x=29, x=29, y=0] [L45] x++ VAL [X=199, Y=1, counter=30, v=-137, x=0, x=29, x=30, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=31, v=-137, x=0, x=29, x=30, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=31, v=-137, x=0, x=30, x=30, 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=199, Y=1, counter=31, v=-137, x=0, x=30, x=30, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=31, v=-137, x=0, x=30, x=30, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=31, v=-135, x=0, x=30, x=30, y=0] [L45] x++ VAL [X=199, Y=1, counter=31, v=-135, x=0, x=30, x=31, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=32, v=-135, x=0, x=30, x=31, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=32, v=-135, x=0, x=31, x=31, 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=199, Y=1, counter=32, v=-135, x=0, x=31, x=31, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=32, v=-135, x=0, x=31, x=31, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=32, v=-133, x=0, x=31, x=31, y=0] [L45] x++ VAL [X=199, Y=1, counter=32, v=-133, x=0, x=31, x=32, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=33, v=-133, x=0, x=31, x=32, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=33, v=-133, x=0, x=32, x=32, 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=199, Y=1, counter=33, v=-133, x=0, x=32, x=32, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=33, v=-133, x=0, x=32, x=32, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=33, v=-131, x=0, x=32, x=32, y=0] [L45] x++ VAL [X=199, Y=1, counter=33, v=-131, x=0, x=32, x=33, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=34, v=-131, x=0, x=32, x=33, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=34, v=-131, x=0, x=33, x=33, 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=199, Y=1, counter=34, v=-131, x=0, x=33, x=33, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=34, v=-131, x=0, x=33, x=33, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=34, v=-129, x=0, x=33, x=33, y=0] [L45] x++ VAL [X=199, Y=1, counter=34, v=-129, x=0, x=33, x=34, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=35, v=-129, x=0, x=33, x=34, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=35, v=-129, x=0, x=34, x=34, 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=199, Y=1, counter=35, v=-129, x=0, x=34, x=34, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=35, v=-129, x=0, x=34, x=34, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=35, v=-127, x=0, x=34, x=34, y=0] [L45] x++ VAL [X=199, Y=1, counter=35, v=-127, x=0, x=34, x=35, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=36, v=-127, x=0, x=34, x=35, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=36, v=-127, x=0, x=35, x=35, 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=199, Y=1, counter=36, v=-127, x=0, x=35, x=35, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=36, v=-127, x=0, x=35, x=35, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=36, v=-125, x=0, x=35, x=35, y=0] [L45] x++ VAL [X=199, Y=1, counter=36, v=-125, x=0, x=35, x=36, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=37, v=-125, x=0, x=35, x=36, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=37, v=-125, x=0, x=36, x=36, 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=199, Y=1, counter=37, v=-125, x=0, x=36, x=36, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=37, v=-125, x=0, x=36, x=36, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=37, v=-123, x=0, x=36, x=36, y=0] [L45] x++ VAL [X=199, Y=1, counter=37, v=-123, x=0, x=36, x=37, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=38, v=-123, x=0, x=36, x=37, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=38, v=-123, x=0, x=37, x=37, 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=199, Y=1, counter=38, v=-123, x=0, x=37, x=37, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=38, v=-123, x=0, x=37, x=37, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=38, v=-121, x=0, x=37, x=37, y=0] [L45] x++ VAL [X=199, Y=1, counter=38, v=-121, x=0, x=37, x=38, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=39, v=-121, x=0, x=37, x=38, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=39, v=-121, x=0, x=38, x=38, 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=199, Y=1, counter=39, v=-121, x=0, x=38, x=38, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=39, v=-121, x=0, x=38, x=38, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=39, v=-119, x=0, x=38, x=38, y=0] [L45] x++ VAL [X=199, Y=1, counter=39, v=-119, x=0, x=38, x=39, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=40, v=-119, x=0, x=38, x=39, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=40, v=-119, x=0, x=39, x=39, 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=199, Y=1, counter=40, v=-119, x=0, x=39, x=39, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=40, v=-119, x=0, x=39, x=39, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=40, v=-117, x=0, x=39, x=39, y=0] [L45] x++ VAL [X=199, Y=1, counter=40, v=-117, x=0, x=39, x=40, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=41, v=-117, x=0, x=39, x=40, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=41, v=-117, x=0, x=40, x=40, 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=199, Y=1, counter=41, v=-117, x=0, x=40, x=40, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=41, v=-117, x=0, x=40, x=40, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=41, v=-115, x=0, x=40, x=40, y=0] [L45] x++ VAL [X=199, Y=1, counter=41, v=-115, x=0, x=40, x=41, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=42, v=-115, x=0, x=40, x=41, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=42, v=-115, x=0, x=41, x=41, 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=199, Y=1, counter=42, v=-115, x=0, x=41, x=41, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=42, v=-115, x=0, x=41, x=41, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=42, v=-113, x=0, x=41, x=41, y=0] [L45] x++ VAL [X=199, Y=1, counter=42, v=-113, x=0, x=41, x=42, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=43, v=-113, x=0, x=41, x=42, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=43, v=-113, x=0, x=42, x=42, 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=199, Y=1, counter=43, v=-113, x=0, x=42, x=42, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=43, v=-113, x=0, x=42, x=42, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=43, v=-111, x=0, x=42, x=42, y=0] [L45] x++ VAL [X=199, Y=1, counter=43, v=-111, x=0, x=42, x=43, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=44, v=-111, x=0, x=42, x=43, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=44, v=-111, x=0, x=43, x=43, 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=199, Y=1, counter=44, v=-111, x=0, x=43, x=43, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=44, v=-111, x=0, x=43, x=43, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=44, v=-109, x=0, x=43, x=43, y=0] [L45] x++ VAL [X=199, Y=1, counter=44, v=-109, x=0, x=43, x=44, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=45, v=-109, x=0, x=43, x=44, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=45, v=-109, x=0, x=44, x=44, 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=199, Y=1, counter=45, v=-109, x=0, x=44, x=44, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=45, v=-109, x=0, x=44, x=44, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=45, v=-107, x=0, x=44, x=44, y=0] [L45] x++ VAL [X=199, Y=1, counter=45, v=-107, x=0, x=44, x=45, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=46, v=-107, x=0, x=44, x=45, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=46, v=-107, x=0, x=45, x=45, 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=199, Y=1, counter=46, v=-107, x=0, x=45, x=45, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=46, v=-107, x=0, x=45, x=45, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=46, v=-105, x=0, x=45, x=45, y=0] [L45] x++ VAL [X=199, Y=1, counter=46, v=-105, x=0, x=45, x=46, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=47, v=-105, x=0, x=45, x=46, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=47, v=-105, x=0, x=46, x=46, 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=199, Y=1, counter=47, v=-105, x=0, x=46, x=46, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=47, v=-105, x=0, x=46, x=46, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=47, v=-103, x=0, x=46, x=46, y=0] [L45] x++ VAL [X=199, Y=1, counter=47, v=-103, x=0, x=46, x=47, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=48, v=-103, x=0, x=46, x=47, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=48, v=-103, x=0, x=47, x=47, 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=199, Y=1, counter=48, v=-103, x=0, x=47, x=47, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=48, v=-103, x=0, x=47, x=47, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=48, v=-101, x=0, x=47, x=47, y=0] [L45] x++ VAL [X=199, Y=1, counter=48, v=-101, x=0, x=47, x=48, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=49, v=-101, x=0, x=47, x=48, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=49, v=-101, x=0, x=48, x=48, 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=199, Y=1, counter=49, v=-101, x=0, x=48, x=48, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=49, v=-101, x=0, x=48, x=48, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=49, v=-99, x=0, x=48, x=48, y=0] [L45] x++ VAL [X=199, Y=1, counter=49, v=-99, x=0, x=48, x=49, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=50, v=-99, x=0, x=48, x=49, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=50, v=-99, x=0, x=49, x=49, 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=199, Y=1, counter=50, v=-99, x=0, x=49, x=49, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=50, v=-99, x=0, x=49, x=49, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=50, v=-97, x=0, x=49, x=49, y=0] [L45] x++ VAL [X=199, Y=1, counter=50, v=-97, x=0, x=49, x=50, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=51, v=-97, x=0, x=49, x=50, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=51, v=-97, x=0, x=50, x=50, 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=199, Y=1, counter=51, v=-97, x=0, x=50, x=50, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=51, v=-97, x=0, x=50, x=50, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=51, v=-95, x=0, x=50, x=50, y=0] [L45] x++ VAL [X=199, Y=1, counter=51, v=-95, x=0, x=50, x=51, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=52, v=-95, x=0, x=50, x=51, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=52, v=-95, x=0, x=51, x=51, 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=199, Y=1, counter=52, v=-95, x=0, x=51, x=51, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=52, v=-95, x=0, x=51, x=51, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=52, v=-93, x=0, x=51, x=51, y=0] [L45] x++ VAL [X=199, Y=1, counter=52, v=-93, x=0, x=51, x=52, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=53, v=-93, x=0, x=51, x=52, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=53, v=-93, x=0, x=52, x=52, 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=199, Y=1, counter=53, v=-93, x=0, x=52, x=52, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=53, v=-93, x=0, x=52, x=52, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=53, v=-91, x=0, x=52, x=52, y=0] [L45] x++ VAL [X=199, Y=1, counter=53, v=-91, x=0, x=52, x=53, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=54, v=-91, x=0, x=52, x=53, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=54, v=-91, x=0, x=53, x=53, 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=199, Y=1, counter=54, v=-91, x=0, x=53, x=53, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=54, v=-91, x=0, x=53, x=53, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=54, v=-89, x=0, x=53, x=53, y=0] [L45] x++ VAL [X=199, Y=1, counter=54, v=-89, x=0, x=53, x=54, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=55, v=-89, x=0, x=53, x=54, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=55, v=-89, x=0, x=54, x=54, 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=199, Y=1, counter=55, v=-89, x=0, x=54, x=54, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=55, v=-89, x=0, x=54, x=54, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=55, v=-87, x=0, x=54, x=54, y=0] [L45] x++ VAL [X=199, Y=1, counter=55, v=-87, x=0, x=54, x=55, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=56, v=-87, x=0, x=54, x=55, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=56, v=-87, x=0, x=55, x=55, 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=199, Y=1, counter=56, v=-87, x=0, x=55, x=55, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=56, v=-87, x=0, x=55, x=55, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=56, v=-85, x=0, x=55, x=55, y=0] [L45] x++ VAL [X=199, Y=1, counter=56, v=-85, x=0, x=55, x=56, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=57, v=-85, x=0, x=55, x=56, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=57, v=-85, x=0, x=56, x=56, 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=199, Y=1, counter=57, v=-85, x=0, x=56, x=56, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=57, v=-85, x=0, x=56, x=56, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=57, v=-83, x=0, x=56, x=56, y=0] [L45] x++ VAL [X=199, Y=1, counter=57, v=-83, x=0, x=56, x=57, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=58, v=-83, x=0, x=56, x=57, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=58, v=-83, x=0, x=57, x=57, 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=199, Y=1, counter=58, v=-83, x=0, x=57, x=57, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=58, v=-83, x=0, x=57, x=57, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=58, v=-81, x=0, x=57, x=57, y=0] [L45] x++ VAL [X=199, Y=1, counter=58, v=-81, x=0, x=57, x=58, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=59, v=-81, x=0, x=57, x=58, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=59, v=-81, x=0, x=58, x=58, 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=199, Y=1, counter=59, v=-81, x=0, x=58, x=58, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=59, v=-81, x=0, x=58, x=58, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=59, v=-79, x=0, x=58, x=58, y=0] [L45] x++ VAL [X=199, Y=1, counter=59, v=-79, x=0, x=58, x=59, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=60, v=-79, x=0, x=58, x=59, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=60, v=-79, x=0, x=59, x=59, 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=199, Y=1, counter=60, v=-79, x=0, x=59, x=59, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=60, v=-79, x=0, x=59, x=59, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=60, v=-77, x=0, x=59, x=59, y=0] [L45] x++ VAL [X=199, Y=1, counter=60, v=-77, x=0, x=59, x=60, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=61, v=-77, x=0, x=59, x=60, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=61, v=-77, x=0, x=60, x=60, 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=199, Y=1, counter=61, v=-77, x=0, x=60, x=60, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=61, v=-77, x=0, x=60, x=60, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=61, v=-75, x=0, x=60, x=60, y=0] [L45] x++ VAL [X=199, Y=1, counter=61, v=-75, x=0, x=60, x=61, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=62, v=-75, x=0, x=60, x=61, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=62, v=-75, x=0, x=61, x=61, 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=199, Y=1, counter=62, v=-75, x=0, x=61, x=61, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=62, v=-75, x=0, x=61, x=61, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=62, v=-73, x=0, x=61, x=61, y=0] [L45] x++ VAL [X=199, Y=1, counter=62, v=-73, x=0, x=61, x=62, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=63, v=-73, x=0, x=61, x=62, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=63, v=-73, x=0, x=62, x=62, 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=199, Y=1, counter=63, v=-73, x=0, x=62, x=62, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=63, v=-73, x=0, x=62, x=62, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=63, v=-71, x=0, x=62, x=62, y=0] [L45] x++ VAL [X=199, Y=1, counter=63, v=-71, x=0, x=62, x=63, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=64, v=-71, x=0, x=62, x=63, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=64, v=-71, x=0, x=63, x=63, 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=199, Y=1, counter=64, v=-71, x=0, x=63, x=63, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=64, v=-71, x=0, x=63, x=63, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=64, v=-69, x=0, x=63, x=63, y=0] [L45] x++ VAL [X=199, Y=1, counter=64, v=-69, x=0, x=63, x=64, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=65, v=-69, x=0, x=63, x=64, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=65, v=-69, x=0, x=64, x=64, 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=199, Y=1, counter=65, v=-69, x=0, x=64, x=64, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=65, v=-69, x=0, x=64, x=64, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=65, v=-67, x=0, x=64, x=64, y=0] [L45] x++ VAL [X=199, Y=1, counter=65, v=-67, x=0, x=64, x=65, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=66, v=-67, x=0, x=64, x=65, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=66, v=-67, x=0, x=65, x=65, 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=199, Y=1, counter=66, v=-67, x=0, x=65, x=65, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=66, v=-67, x=0, x=65, x=65, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=66, v=-65, x=0, x=65, x=65, y=0] [L45] x++ VAL [X=199, Y=1, counter=66, v=-65, x=0, x=65, x=66, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=67, v=-65, x=0, x=65, x=66, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=67, v=-65, x=0, x=66, x=66, 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=199, Y=1, counter=67, v=-65, x=0, x=66, x=66, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=67, v=-65, x=0, x=66, x=66, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=67, v=-63, x=0, x=66, x=66, y=0] [L45] x++ VAL [X=199, Y=1, counter=67, v=-63, x=0, x=66, x=67, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=68, v=-63, x=0, x=66, x=67, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=68, v=-63, x=0, x=67, x=67, 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=199, Y=1, counter=68, v=-63, x=0, x=67, x=67, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=68, v=-63, x=0, x=67, x=67, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=68, v=-61, x=0, x=67, x=67, y=0] [L45] x++ VAL [X=199, Y=1, counter=68, v=-61, x=0, x=67, x=68, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=69, v=-61, x=0, x=67, x=68, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=69, v=-61, x=0, x=68, x=68, 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=199, Y=1, counter=69, v=-61, x=0, x=68, x=68, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=69, v=-61, x=0, x=68, x=68, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=69, v=-59, x=0, x=68, x=68, y=0] [L45] x++ VAL [X=199, Y=1, counter=69, v=-59, x=0, x=68, x=69, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=70, v=-59, x=0, x=68, x=69, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=70, v=-59, x=0, x=69, x=69, 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=199, Y=1, counter=70, v=-59, x=0, x=69, x=69, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=70, v=-59, x=0, x=69, x=69, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=70, v=-57, x=0, x=69, x=69, y=0] [L45] x++ VAL [X=199, Y=1, counter=70, v=-57, x=0, x=69, x=70, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=71, v=-57, x=0, x=69, x=70, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=71, v=-57, x=0, x=70, x=70, 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=199, Y=1, counter=71, v=-57, x=0, x=70, x=70, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=71, v=-57, x=0, x=70, x=70, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=71, v=-55, x=0, x=70, x=70, y=0] [L45] x++ VAL [X=199, Y=1, counter=71, v=-55, x=0, x=70, x=71, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=72, v=-55, x=0, x=70, x=71, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=72, v=-55, x=0, x=71, x=71, 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=199, Y=1, counter=72, v=-55, x=0, x=71, x=71, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=72, v=-55, x=0, x=71, x=71, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=72, v=-53, x=0, x=71, x=71, y=0] [L45] x++ VAL [X=199, Y=1, counter=72, v=-53, x=0, x=71, x=72, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=73, v=-53, x=0, x=71, x=72, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=73, v=-53, x=0, x=72, x=72, 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=199, Y=1, counter=73, v=-53, x=0, x=72, x=72, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=73, v=-53, x=0, x=72, x=72, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=73, v=-51, x=0, x=72, x=72, y=0] [L45] x++ VAL [X=199, Y=1, counter=73, v=-51, x=0, x=72, x=73, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=74, v=-51, x=0, x=72, x=73, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=74, v=-51, x=0, x=73, x=73, 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=199, Y=1, counter=74, v=-51, x=0, x=73, x=73, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=74, v=-51, x=0, x=73, x=73, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=74, v=-49, x=0, x=73, x=73, y=0] [L45] x++ VAL [X=199, Y=1, counter=74, v=-49, x=0, x=73, x=74, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=75, v=-49, x=0, x=73, x=74, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=75, v=-49, x=0, x=74, x=74, 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=199, Y=1, counter=75, v=-49, x=0, x=74, x=74, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=75, v=-49, x=0, x=74, x=74, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=75, v=-47, x=0, x=74, x=74, y=0] [L45] x++ VAL [X=199, Y=1, counter=75, v=-47, x=0, x=74, x=75, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=76, v=-47, x=0, x=74, x=75, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=76, v=-47, x=0, x=75, x=75, 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=199, Y=1, counter=76, v=-47, x=0, x=75, x=75, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=76, v=-47, x=0, x=75, x=75, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=76, v=-45, x=0, x=75, x=75, y=0] [L45] x++ VAL [X=199, Y=1, counter=76, v=-45, x=0, x=75, x=76, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=77, v=-45, x=0, x=75, x=76, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=77, v=-45, x=0, x=76, x=76, 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=199, Y=1, counter=77, v=-45, x=0, x=76, x=76, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=77, v=-45, x=0, x=76, x=76, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=77, v=-43, x=0, x=76, x=76, y=0] [L45] x++ VAL [X=199, Y=1, counter=77, v=-43, x=0, x=76, x=77, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=78, v=-43, x=0, x=76, x=77, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=78, v=-43, x=0, x=77, x=77, 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=199, Y=1, counter=78, v=-43, x=0, x=77, x=77, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=78, v=-43, x=0, x=77, x=77, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=78, v=-41, x=0, x=77, x=77, y=0] [L45] x++ VAL [X=199, Y=1, counter=78, v=-41, x=0, x=77, x=78, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=79, v=-41, x=0, x=77, x=78, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=79, v=-41, x=0, x=78, x=78, 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=199, Y=1, counter=79, v=-41, x=0, x=78, x=78, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=79, v=-41, x=0, x=78, x=78, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=79, v=-39, x=0, x=78, x=78, y=0] [L45] x++ VAL [X=199, Y=1, counter=79, v=-39, x=0, x=78, x=79, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=80, v=-39, x=0, x=78, x=79, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=80, v=-39, x=0, x=79, x=79, 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=199, Y=1, counter=80, v=-39, x=0, x=79, x=79, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=80, v=-39, x=0, x=79, x=79, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=80, v=-37, x=0, x=79, x=79, y=0] [L45] x++ VAL [X=199, Y=1, counter=80, v=-37, x=0, x=79, x=80, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=81, v=-37, x=0, x=79, x=80, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=81, v=-37, x=0, x=80, x=80, 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=199, Y=1, counter=81, v=-37, x=0, x=80, x=80, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=81, v=-37, x=0, x=80, x=80, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=81, v=-35, x=0, x=80, x=80, y=0] [L45] x++ VAL [X=199, Y=1, counter=81, v=-35, x=0, x=80, x=81, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=82, v=-35, x=0, x=80, x=81, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=82, v=-35, x=0, x=81, x=81, 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=199, Y=1, counter=82, v=-35, x=0, x=81, x=81, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=82, v=-35, x=0, x=81, x=81, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=82, v=-33, x=0, x=81, x=81, y=0] [L45] x++ VAL [X=199, Y=1, counter=82, v=-33, x=0, x=81, x=82, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=83, v=-33, x=0, x=81, x=82, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=83, v=-33, x=0, x=82, x=82, 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=199, Y=1, counter=83, v=-33, x=0, x=82, x=82, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=83, v=-33, x=0, x=82, x=82, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=83, v=-31, x=0, x=82, x=82, y=0] [L45] x++ VAL [X=199, Y=1, counter=83, v=-31, x=0, x=82, x=83, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=84, v=-31, x=0, x=82, x=83, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=84, v=-31, x=0, x=83, x=83, 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=199, Y=1, counter=84, v=-31, x=0, x=83, x=83, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=84, v=-31, x=0, x=83, x=83, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=84, v=-29, x=0, x=83, x=83, y=0] [L45] x++ VAL [X=199, Y=1, counter=84, v=-29, x=0, x=83, x=84, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=85, v=-29, x=0, x=83, x=84, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=85, v=-29, x=0, x=84, x=84, 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=199, Y=1, counter=85, v=-29, x=0, x=84, x=84, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=85, v=-29, x=0, x=84, x=84, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=85, v=-27, x=0, x=84, x=84, y=0] [L45] x++ VAL [X=199, Y=1, counter=85, v=-27, x=0, x=84, x=85, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=86, v=-27, x=0, x=84, x=85, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=86, v=-27, x=0, x=85, x=85, 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=199, Y=1, counter=86, v=-27, x=0, x=85, x=85, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=86, v=-27, x=0, x=85, x=85, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=86, v=-25, x=0, x=85, x=85, y=0] [L45] x++ VAL [X=199, Y=1, counter=86, v=-25, x=0, x=85, x=86, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=87, v=-25, x=0, x=85, x=86, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=87, v=-25, x=0, x=86, x=86, 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=199, Y=1, counter=87, v=-25, x=0, x=86, x=86, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=87, v=-25, x=0, x=86, x=86, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=87, v=-23, x=0, x=86, x=86, y=0] [L45] x++ VAL [X=199, Y=1, counter=87, v=-23, x=0, x=86, x=87, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=88, v=-23, x=0, x=86, x=87, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=88, v=-23, x=0, x=87, x=87, 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=199, Y=1, counter=88, v=-23, x=0, x=87, x=87, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=88, v=-23, x=0, x=87, x=87, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=88, v=-21, x=0, x=87, x=87, y=0] [L45] x++ VAL [X=199, Y=1, counter=88, v=-21, x=0, x=87, x=88, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=89, v=-21, x=0, x=87, x=88, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=89, v=-21, x=0, x=88, x=88, 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=199, Y=1, counter=89, v=-21, x=0, x=88, x=88, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=89, v=-21, x=0, x=88, x=88, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=89, v=-19, x=0, x=88, x=88, y=0] [L45] x++ VAL [X=199, Y=1, counter=89, v=-19, x=0, x=88, x=89, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=90, v=-19, x=0, x=88, x=89, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=90, v=-19, x=0, x=89, x=89, 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=199, Y=1, counter=90, v=-19, x=0, x=89, x=89, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=90, v=-19, x=0, x=89, x=89, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=90, v=-17, x=0, x=89, x=89, y=0] [L45] x++ VAL [X=199, Y=1, counter=90, v=-17, x=0, x=89, x=90, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=91, v=-17, x=0, x=89, x=90, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=91, v=-17, x=0, x=90, x=90, 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=199, Y=1, counter=91, v=-17, x=0, x=90, x=90, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=91, v=-17, x=0, x=90, x=90, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=91, v=-15, x=0, x=90, x=90, y=0] [L45] x++ VAL [X=199, Y=1, counter=91, v=-15, x=0, x=90, x=91, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=92, v=-15, x=0, x=90, x=91, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=92, v=-15, x=0, x=91, x=91, 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=199, Y=1, counter=92, v=-15, x=0, x=91, x=91, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=92, v=-15, x=0, x=91, x=91, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=92, v=-13, x=0, x=91, x=91, y=0] [L45] x++ VAL [X=199, Y=1, counter=92, v=-13, x=0, x=91, x=92, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=93, v=-13, x=0, x=91, x=92, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=93, v=-13, x=0, x=92, x=92, 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=199, Y=1, counter=93, v=-13, x=0, x=92, x=92, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=93, v=-13, x=0, x=92, x=92, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=93, v=-11, x=0, x=92, x=92, y=0] [L45] x++ VAL [X=199, Y=1, counter=93, v=-11, x=0, x=92, x=93, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=94, v=-11, x=0, x=92, x=93, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=94, v=-11, x=0, x=93, x=93, 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=199, Y=1, counter=94, v=-11, x=0, x=93, x=93, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=94, v=-11, x=0, x=93, x=93, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=94, v=-9, x=0, x=93, x=93, y=0] [L45] x++ VAL [X=199, Y=1, counter=94, v=-9, x=0, x=93, x=94, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=95, v=-9, x=0, x=93, x=94, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=95, v=-9, x=0, x=94, 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=199, Y=1, counter=95, v=-9, x=0, x=94, x=94, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=95, v=-9, x=0, x=94, x=94, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=95, v=-7, x=0, x=94, x=94, y=0] [L45] x++ VAL [X=199, Y=1, counter=95, v=-7, x=0, x=94, x=95, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=96, v=-7, x=0, x=94, x=95, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=96, v=-7, x=0, x=95, 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=199, Y=1, counter=96, v=-7, x=0, x=95, x=95, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=96, v=-7, x=0, x=95, x=95, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=96, v=-5, x=0, x=95, x=95, y=0] [L45] x++ VAL [X=199, Y=1, counter=96, v=-5, x=0, x=95, x=96, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=97, v=-5, x=0, x=95, x=96, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=97, v=-5, x=0, x=96, 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=199, Y=1, counter=97, v=-5, x=0, x=96, x=96, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=97, v=-5, x=0, x=96, x=96, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=97, v=-3, x=0, x=96, x=96, y=0] [L45] x++ VAL [X=199, Y=1, counter=97, v=-3, x=0, x=96, x=97, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=98, v=-3, x=0, x=96, x=97, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=98, v=-3, x=0, x=97, 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=199, Y=1, counter=98, v=-3, x=0, x=97, x=97, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=98, v=-3, x=0, x=97, x=97, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=98, v=-1, x=0, x=97, x=97, y=0] [L45] x++ VAL [X=199, Y=1, counter=98, v=-1, x=0, x=97, x=98, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=99, v=-1, x=0, x=97, x=98, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=99, v=-1, x=0, x=98, 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=199, Y=1, counter=99, v=-1, x=0, x=98, x=98, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=99, v=-1, x=0, x=98, x=98, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=99, v=1, x=0, x=98, x=98, y=0] [L45] x++ VAL [X=199, Y=1, counter=99, v=1, x=0, x=98, x=99, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=100, v=1, x=0, x=98, x=99, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=100, v=1, x=0, x=99, 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=199, Y=1, counter=100, v=1, x=0, x=99, x=99, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=100, v=1, x=0, x=99, x=99, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=199, Y=1, counter=100, v=-395, x=0, x=99, x=99, y=1] [L45] x++ VAL [X=199, Y=1, counter=100, v=-395, x=0, x=100, x=99, y=1] [L31] EXPR counter++ VAL [X=199, Y=1, counter=101, v=-395, x=0, x=100, x=99, y=1] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=199, Y=1, counter=101, v=-395, x=100, x=100, x=100, 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: 40.9s, OverallIterations: 15, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1795 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1790 mSDsluCounter, 2890 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2721 mSDsCounter, 213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2325 IncrementalHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 213 mSolverCounterUnsat, 169 mSDtfsCounter, 2325 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4767 GetRequests, 3972 SyntacticMatches, 101 SemanticMatches, 694 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17127 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2017occurred in iteration=14, InterpolantAutomatonStates: 660, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 55 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 3268 NumberOfCodeBlocks, 3038 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 4443 ConstructedInterpolants, 2 QuantifiedInterpolants, 13012 SizeOfPredicates, 219 NumberOfNonLiveVariables, 5334 ConjunctsInSsa, 541 ConjunctsInUnsatCore, 26 InterpolantComputations, 1 PerfectInterpolantSequences, 28451/120380 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-22 23:32:23,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE