./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/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 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 01:13:35,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 01:13:35,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 01:13:35,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 01:13:35,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 01:13:35,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 01:13:35,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 01:13:35,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 01:13:35,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 01:13:35,894 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 01:13:35,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 01:13:35,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 01:13:35,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 01:13:35,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 01:13:35,896 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 01:13:35,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 01:13:35,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 01:13:35,897 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 01:13:35,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 01:13:35,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 01:13:35,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 01:13:35,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 01:13:35,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 01:13:35,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 01:13:35,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 01:13:35,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 01:13:35,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 01:13:35,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 01:13:35,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 01:13:35,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 01:13:35,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 01:13:35,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 01:13:35,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 01:13:35,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 01:13:35,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 01:13:35,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 01:13:35,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 01:13:35,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 01:13:35,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 01:13:35,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 01:13:35,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 01:13:35,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 01:13:35,903 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 [2024-11-22 01:13:36,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 01:13:36,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 01:13:36,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 01:13:36,129 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 01:13:36,129 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 01:13:36,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2024-11-22 01:13:37,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 01:13:37,505 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 01:13:37,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2024-11-22 01:13:37,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee00ba41b/2fc42364ddc84630b6f31566e7f7d697/FLAG2aed69fcf [2024-11-22 01:13:37,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee00ba41b/2fc42364ddc84630b6f31566e7f7d697 [2024-11-22 01:13:37,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 01:13:37,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 01:13:37,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 01:13:37,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 01:13:37,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 01:13:37,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4c8122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37, skipping insertion in model container [2024-11-22 01:13:37,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 01:13:37,692 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2024-11-22 01:13:37,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 01:13:37,723 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 01:13:37,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2024-11-22 01:13:37,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 01:13:37,758 INFO L204 MainTranslator]: Completed translation [2024-11-22 01:13:37,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37 WrapperNode [2024-11-22 01:13:37,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 01:13:37,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 01:13:37,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 01:13:37,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 01:13:37,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,788 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2024-11-22 01:13:37,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 01:13:37,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 01:13:37,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 01:13:37,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 01:13:37,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,807 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 01:13:37,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 01:13:37,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 01:13:37,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 01:13:37,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 01:13:37,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (1/1) ... [2024-11-22 01:13:37,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 01:13:37,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:37,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 01:13:37,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 01:13:37,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 01:13:37,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 01:13:37,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 01:13:37,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 01:13:37,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 01:13:37,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 01:13:37,930 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 01:13:37,932 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 01:13:38,043 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-22 01:13:38,043 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 01:13:38,055 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 01:13:38,056 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 01:13:38,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:13:38 BoogieIcfgContainer [2024-11-22 01:13:38,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 01:13:38,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 01:13:38,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 01:13:38,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 01:13:38,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:13:37" (1/3) ... [2024-11-22 01:13:38,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df52290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:13:38, skipping insertion in model container [2024-11-22 01:13:38,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:37" (2/3) ... [2024-11-22 01:13:38,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df52290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:13:38, skipping insertion in model container [2024-11-22 01:13:38,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:13:38" (3/3) ... [2024-11-22 01:13:38,066 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2024-11-22 01:13:38,081 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 01:13:38,081 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 01:13:38,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 01:13:38,153 INFO L333 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, 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;@55332988, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 01:13:38,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 01:13:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 01:13:38,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 01:13:38,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:38,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:38,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:38,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2024-11-22 01:13:38,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:38,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396781141] [2024-11-22 01:13:38,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:38,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 01:13:38,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398492172] [2024-11-22 01:13:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:38,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:38,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:38,283 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) [2024-11-22 01:13:38,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 01:13:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:13:38,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 01:13:38,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:13:38,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 01:13:38,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:38,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396781141] [2024-11-22 01:13:38,493 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 01:13:38,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398492172] [2024-11-22 01:13:38,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398492172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:13:38,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:13:38,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 01:13:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770838585] [2024-11-22 01:13:38,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:13:38,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 01:13:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 01:13:38,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 01:13:38,517 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:13:38,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:38,626 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-22 01:13:38,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 01:13:38,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 01:13:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:38,644 INFO L225 Difference]: With dead ends: 52 [2024-11-22 01:13:38,644 INFO L226 Difference]: Without dead ends: 28 [2024-11-22 01:13:38,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 01:13:38,649 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:38,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 01:13:38,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-22 01:13:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2024-11-22 01:13:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 01:13:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-22 01:13:38,677 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 8 [2024-11-22 01:13:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:38,677 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-22 01:13:38,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:13:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-22 01:13:38,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 01:13:38,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:38,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:38,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 01:13:38,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 01:13:38,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:38,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:38,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1226236780, now seen corresponding path program 1 times [2024-11-22 01:13:38,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:38,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192104326] [2024-11-22 01:13:38,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:38,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:13:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:13:38,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:38,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192104326] [2024-11-22 01:13:38,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192104326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:13:38,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:13:38,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 01:13:38,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309299555] [2024-11-22 01:13:38,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:13:38,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 01:13:38,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 01:13:38,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 01:13:38,958 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (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) [2024-11-22 01:13:38,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:38,982 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-22 01:13:38,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 01:13:38,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (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 9 [2024-11-22 01:13:38,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:38,984 INFO L225 Difference]: With dead ends: 31 [2024-11-22 01:13:38,984 INFO L226 Difference]: Without dead ends: 23 [2024-11-22 01:13:38,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 01:13:38,986 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:38,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:13:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-22 01:13:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-22 01:13:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 01:13:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-22 01:13:38,997 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2024-11-22 01:13:38,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:38,997 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-22 01:13:38,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (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) [2024-11-22 01:13:38,997 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-22 01:13:38,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 01:13:38,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:38,997 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:38,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 01:13:38,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:38,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:38,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1414665262, now seen corresponding path program 1 times [2024-11-22 01:13:38,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:38,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468093124] [2024-11-22 01:13:38,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:38,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 01:13:39,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [870367563] [2024-11-22 01:13:39,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:39,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:39,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:39,028 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) [2024-11-22 01:13:39,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 01:13:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:13:39,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 01:13:39,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:13:39,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 01:13:39,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:39,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468093124] [2024-11-22 01:13:39,179 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 01:13:39,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870367563] [2024-11-22 01:13:39,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870367563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:13:39,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:13:39,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 01:13:39,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569449773] [2024-11-22 01:13:39,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:13:39,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 01:13:39,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:39,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 01:13:39,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 01:13:39,183 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 01:13:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:39,253 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-22 01:13:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 01:13:39,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-22 01:13:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:39,255 INFO L225 Difference]: With dead ends: 33 [2024-11-22 01:13:39,255 INFO L226 Difference]: Without dead ends: 25 [2024-11-22 01:13:39,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 01:13:39,256 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:39,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:13:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-22 01:13:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-22 01:13:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 01:13:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-22 01:13:39,264 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2024-11-22 01:13:39,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:39,265 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-22 01:13:39,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 01:13:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-22 01:13:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 01:13:39,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:39,267 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:39,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 01:13:39,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-22 01:13:39,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:39,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:39,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2024-11-22 01:13:39,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:39,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605556645] [2024-11-22 01:13:39,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:39,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 01:13:39,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722548220] [2024-11-22 01:13:39,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:39,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:39,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:39,502 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) [2024-11-22 01:13:39,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 01:13:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:13:39,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 01:13:39,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:13:39,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:13:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 01:13:39,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:39,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605556645] [2024-11-22 01:13:39,766 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 01:13:39,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722548220] [2024-11-22 01:13:39,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722548220] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:13:39,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 01:13:39,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-22 01:13:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203860452] [2024-11-22 01:13:39,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 01:13:39,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 01:13:39,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:39,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 01:13:39,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 01:13:39,768 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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) [2024-11-22 01:13:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:39,914 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-22 01:13:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 01:13:39,915 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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 18 [2024-11-22 01:13:39,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:39,916 INFO L225 Difference]: With dead ends: 41 [2024-11-22 01:13:39,916 INFO L226 Difference]: Without dead ends: 37 [2024-11-22 01:13:39,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-22 01:13:39,917 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:39,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 85 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 01:13:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-22 01:13:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2024-11-22 01:13:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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) [2024-11-22 01:13:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-22 01:13:39,923 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2024-11-22 01:13:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:39,924 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-22 01:13:39,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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) [2024-11-22 01:13:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-22 01:13:39,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 01:13:39,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:39,925 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:39,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 01:13:40,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:40,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:40,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash 606185, now seen corresponding path program 1 times [2024-11-22 01:13:40,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:40,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872964179] [2024-11-22 01:13:40,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:40,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:13:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:13:40,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:40,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872964179] [2024-11-22 01:13:40,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872964179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:13:40,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283746491] [2024-11-22 01:13:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:40,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:40,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:40,200 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) [2024-11-22 01:13:40,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 01:13:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:13:40,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 01:13:40,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:13:40,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:13:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:13:40,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283746491] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:13:40,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:13:40,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-22 01:13:40,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011185277] [2024-11-22 01:13:40,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:13:40,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 01:13:40,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:40,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 01:13:40,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 01:13:40,284 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 01:13:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:40,340 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-22 01:13:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 01:13:40,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-22 01:13:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:40,341 INFO L225 Difference]: With dead ends: 68 [2024-11-22 01:13:40,341 INFO L226 Difference]: Without dead ends: 62 [2024-11-22 01:13:40,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-22 01:13:40,342 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:40,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 77 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:13:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-22 01:13:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2024-11-22 01:13:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 01:13:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-22 01:13:40,351 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 19 [2024-11-22 01:13:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:40,351 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-22 01:13:40,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 01:13:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-22 01:13:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 01:13:40,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:40,351 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:40,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 01:13:40,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:40,552 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:40,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:40,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1993750159, now seen corresponding path program 1 times [2024-11-22 01:13:40,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:40,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081648923] [2024-11-22 01:13:40,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:40,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 01:13:40,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647691045] [2024-11-22 01:13:40,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:40,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:40,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:40,594 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) [2024-11-22 01:13:40,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 01:13:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:13:40,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 01:13:40,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 01:13:40,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:13:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 01:13:40,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:40,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081648923] [2024-11-22 01:13:40,875 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 01:13:40,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647691045] [2024-11-22 01:13:40,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647691045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:13:40,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 01:13:40,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-22 01:13:40,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446336211] [2024-11-22 01:13:40,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 01:13:40,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 01:13:40,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:40,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 01:13:40,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-22 01:13:40,877 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 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) [2024-11-22 01:13:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:41,003 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2024-11-22 01:13:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 01:13:41,003 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 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 25 [2024-11-22 01:13:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:41,005 INFO L225 Difference]: With dead ends: 79 [2024-11-22 01:13:41,005 INFO L226 Difference]: Without dead ends: 73 [2024-11-22 01:13:41,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-22 01:13:41,006 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:41,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 83 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 01:13:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-22 01:13:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-22 01:13:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-22 01:13:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-11-22 01:13:41,026 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 25 [2024-11-22 01:13:41,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:41,026 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-22 01:13:41,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 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) [2024-11-22 01:13:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2024-11-22 01:13:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 01:13:41,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:41,028 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:41,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 01:13:41,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:41,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:41,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2024-11-22 01:13:41,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:41,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315167539] [2024-11-22 01:13:41,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:41,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 01:13:41,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597804414] [2024-11-22 01:13:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:41,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:41,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:41,252 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) [2024-11-22 01:13:41,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 01:13:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:13:41,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 01:13:41,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 01:13:41,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:13:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 01:13:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:44,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315167539] [2024-11-22 01:13:44,586 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 01:13:44,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597804414] [2024-11-22 01:13:44,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597804414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:13:44,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 01:13:44,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-11-22 01:13:44,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840366813] [2024-11-22 01:13:44,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 01:13:44,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-22 01:13:44,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:44,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-22 01:13:44,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-22 01:13:44,589 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 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) [2024-11-22 01:13:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:46,258 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-11-22 01:13:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-22 01:13:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 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 25 [2024-11-22 01:13:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:46,259 INFO L225 Difference]: With dead ends: 86 [2024-11-22 01:13:46,259 INFO L226 Difference]: Without dead ends: 78 [2024-11-22 01:13:46,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 01:13:46,260 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:46,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 115 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 01:13:46,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-22 01:13:46,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-22 01:13:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 01:13:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2024-11-22 01:13:46,275 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 25 [2024-11-22 01:13:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:46,275 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2024-11-22 01:13:46,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 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) [2024-11-22 01:13:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2024-11-22 01:13:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 01:13:46,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:46,276 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:46,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 01:13:46,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:46,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:46,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash 741920142, now seen corresponding path program 1 times [2024-11-22 01:13:46,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:46,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085696196] [2024-11-22 01:13:46,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:46,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:13:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 01:13:46,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085696196] [2024-11-22 01:13:46,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085696196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:13:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111561976] [2024-11-22 01:13:46,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:46,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:46,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:46,590 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) [2024-11-22 01:13:46,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 01:13:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:13:46,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 01:13:46,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 01:13:46,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:13:46,817 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 01:13:46,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111561976] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:13:46,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:13:46,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-22 01:13:46,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788923019] [2024-11-22 01:13:46,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:13:46,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 01:13:46,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:46,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 01:13:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-22 01:13:46,819 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 01:13:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:46,940 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-11-22 01:13:46,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 01:13:46,940 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2024-11-22 01:13:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:46,941 INFO L225 Difference]: With dead ends: 88 [2024-11-22 01:13:46,941 INFO L226 Difference]: Without dead ends: 82 [2024-11-22 01:13:46,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-22 01:13:46,942 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:46,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 102 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 01:13:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-22 01:13:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-22 01:13:46,954 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), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 01:13:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-22 01:13:46,955 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 35 [2024-11-22 01:13:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:46,955 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-22 01:13:46,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 01:13:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-22 01:13:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-22 01:13:46,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:46,957 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:46,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 01:13:47,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:47,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:47,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1464162251, now seen corresponding path program 2 times [2024-11-22 01:13:47,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:47,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333330042] [2024-11-22 01:13:47,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:13:47,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:47,169 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:13:47,169 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:13:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 01:13:47,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:47,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333330042] [2024-11-22 01:13:47,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333330042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:13:47,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337325512] [2024-11-22 01:13:47,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:13:47,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:47,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:47,308 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) [2024-11-22 01:13:47,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 01:13:47,346 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:13:47,346 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:13:47,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 01:13:47,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 01:13:47,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:13:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 01:13:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337325512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:13:47,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:13:47,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-22 01:13:47,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066364564] [2024-11-22 01:13:47,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:13:47,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 01:13:47,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:47,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 01:13:47,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-22 01:13:47,649 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 01:13:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:47,938 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2024-11-22 01:13:47,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 01:13:47,939 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 45 [2024-11-22 01:13:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:47,940 INFO L225 Difference]: With dead ends: 110 [2024-11-22 01:13:47,940 INFO L226 Difference]: Without dead ends: 104 [2024-11-22 01:13:47,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2024-11-22 01:13:47,941 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:47,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 168 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 01:13:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-22 01:13:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-11-22 01:13:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 01:13:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2024-11-22 01:13:47,958 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 45 [2024-11-22 01:13:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:47,958 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2024-11-22 01:13:47,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 01:13:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2024-11-22 01:13:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-22 01:13:47,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:47,960 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:47,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 01:13:48,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-22 01:13:48,164 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:48,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1900020427, now seen corresponding path program 3 times [2024-11-22 01:13:48,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:48,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806116788] [2024-11-22 01:13:48,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 01:13:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:48,185 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-22 01:13:48,186 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:13:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 01:13:48,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:48,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806116788] [2024-11-22 01:13:48,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806116788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:13:48,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620930789] [2024-11-22 01:13:48,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 01:13:48,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:48,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:48,241 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) [2024-11-22 01:13:48,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 01:13:48,308 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 01:13:48,309 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:13:48,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 01:13:48,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-22 01:13:48,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:13:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-22 01:13:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620930789] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:13:48,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:13:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 11] total 21 [2024-11-22 01:13:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816614538] [2024-11-22 01:13:48,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:13:48,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 01:13:48,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 01:13:48,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-11-22 01:13:48,610 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 21 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 9 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-22 01:13:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:49,084 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2024-11-22 01:13:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-22 01:13:49,084 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 9 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 45 [2024-11-22 01:13:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:49,085 INFO L225 Difference]: With dead ends: 134 [2024-11-22 01:13:49,085 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 01:13:49,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2024-11-22 01:13:49,090 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:49,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 167 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 01:13:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 01:13:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 62. [2024-11-22 01:13:49,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 01:13:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-11-22 01:13:49,100 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 45 [2024-11-22 01:13:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:49,101 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-11-22 01:13:49,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 9 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-22 01:13:49,101 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-11-22 01:13:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 01:13:49,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:49,104 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:49,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-22 01:13:49,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-22 01:13:49,305 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:49,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 2 times [2024-11-22 01:13:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211666022] [2024-11-22 01:13:49,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:13:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:49,313 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:13:49,314 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:13:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 01:13:49,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:49,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211666022] [2024-11-22 01:13:49,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211666022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:13:49,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505766003] [2024-11-22 01:13:49,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:13:49,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:49,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:49,443 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) [2024-11-22 01:13:49,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 01:13:49,486 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:13:49,486 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:13:49,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 01:13:49,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:13:49,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:13:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 01:13:49,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505766003] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:13:49,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:13:49,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2024-11-22 01:13:49,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337703407] [2024-11-22 01:13:49,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:13:49,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 01:13:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:49,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 01:13:49,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2024-11-22 01:13:49,613 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-22 01:13:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:49,702 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-11-22 01:13:49,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 01:13:49,703 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 49 [2024-11-22 01:13:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:49,703 INFO L225 Difference]: With dead ends: 128 [2024-11-22 01:13:49,703 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 01:13:49,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-22 01:13:49,704 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 50 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:49,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 117 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:13:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 01:13:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-22 01:13:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.1224489795918366) internal successors, (110), 98 states have internal predecessors, (110), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 01:13:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-11-22 01:13:49,719 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 49 [2024-11-22 01:13:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:49,720 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-11-22 01:13:49,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-22 01:13:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-11-22 01:13:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-22 01:13:49,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:49,722 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:49,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-22 01:13:49,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-22 01:13:49,927 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:49,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 3 times [2024-11-22 01:13:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:49,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408515911] [2024-11-22 01:13:49,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 01:13:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:50,001 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-22 01:13:50,002 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:13:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-22 01:13:50,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:50,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408515911] [2024-11-22 01:13:50,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408515911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:13:50,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650791691] [2024-11-22 01:13:50,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 01:13:50,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:50,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:50,496 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) [2024-11-22 01:13:50,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-22 01:13:50,546 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 01:13:50,546 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:13:50,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 01:13:50,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-11-22 01:13:50,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:13:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-11-22 01:13:51,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650791691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:13:51,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:13:51,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 12] total 37 [2024-11-22 01:13:51,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87961534] [2024-11-22 01:13:51,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:13:51,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-22 01:13:51,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:51,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-22 01:13:51,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1114, Unknown=0, NotChecked=0, Total=1332 [2024-11-22 01:13:51,023 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 37 states, 33 states have (on average 2.696969696969697) internal successors, (89), 36 states have internal predecessors, (89), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 01:13:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:52,800 INFO L93 Difference]: Finished difference Result 239 states and 263 transitions. [2024-11-22 01:13:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-22 01:13:52,801 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 2.696969696969697) internal successors, (89), 36 states have internal predecessors, (89), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 109 [2024-11-22 01:13:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:52,802 INFO L225 Difference]: With dead ends: 239 [2024-11-22 01:13:52,802 INFO L226 Difference]: Without dead ends: 229 [2024-11-22 01:13:52,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4237 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1964, Invalid=12556, Unknown=0, NotChecked=0, Total=14520 [2024-11-22 01:13:52,805 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 334 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:52,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 110 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 01:13:52,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-22 01:13:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2024-11-22 01:13:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 181 states have (on average 1.1215469613259668) internal successors, (203), 181 states have internal predecessors, (203), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 01:13:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2024-11-22 01:13:52,833 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 109 [2024-11-22 01:13:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:52,833 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2024-11-22 01:13:52,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 2.696969696969697) internal successors, (89), 36 states have internal predecessors, (89), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 01:13:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2024-11-22 01:13:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-22 01:13:52,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:52,835 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:52,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-22 01:13:53,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-22 01:13:53,036 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:53,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:53,036 INFO L85 PathProgramCache]: Analyzing trace with hash -640043763, now seen corresponding path program 1 times [2024-11-22 01:13:53,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:53,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181000305] [2024-11-22 01:13:53,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:53,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:13:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 01:13:53,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:53,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181000305] [2024-11-22 01:13:53,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181000305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:13:53,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605354102] [2024-11-22 01:13:53,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:13:53,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:53,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:53,379 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) [2024-11-22 01:13:53,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-22 01:13:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:13:53,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 01:13:53,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:13:53,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:13:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 01:13:53,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605354102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:13:53,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:13:53,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 28 [2024-11-22 01:13:53,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512766467] [2024-11-22 01:13:53,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:13:53,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 01:13:53,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:53,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 01:13:53,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2024-11-22 01:13:53,845 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-22 01:13:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:54,211 INFO L93 Difference]: Finished difference Result 495 states and 555 transitions. [2024-11-22 01:13:54,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-22 01:13:54,212 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) Word has length 119 [2024-11-22 01:13:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:54,214 INFO L225 Difference]: With dead ends: 495 [2024-11-22 01:13:54,214 INFO L226 Difference]: Without dead ends: 489 [2024-11-22 01:13:54,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=940, Invalid=1610, Unknown=0, NotChecked=0, Total=2550 [2024-11-22 01:13:54,215 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 156 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:54,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 210 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 01:13:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-22 01:13:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2024-11-22 01:13:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 389 states have (on average 1.1233933161953729) internal successors, (437), 389 states have internal predecessors, (437), 49 states have call successors, (49), 48 states have call predecessors, (49), 47 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 01:13:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 534 transitions. [2024-11-22 01:13:54,261 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 534 transitions. Word has length 119 [2024-11-22 01:13:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:54,261 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 534 transitions. [2024-11-22 01:13:54,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-22 01:13:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 534 transitions. [2024-11-22 01:13:54,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-22 01:13:54,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:54,263 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:54,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-22 01:13:54,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-22 01:13:54,464 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:54,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash -132233178, now seen corresponding path program 2 times [2024-11-22 01:13:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:54,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936207073] [2024-11-22 01:13:54,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:13:54,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:54,492 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:13:54,493 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:13:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 1704 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-22 01:13:55,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:13:55,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936207073] [2024-11-22 01:13:55,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936207073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:13:55,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928336607] [2024-11-22 01:13:55,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:13:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:13:55,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:13:55,526 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) [2024-11-22 01:13:55,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-22 01:13:55,624 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:13:55,624 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:13:55,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-22 01:13:55,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:13:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 2808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:13:55,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:13:56,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 1704 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-22 01:13:56,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928336607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:13:56,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:13:56,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 55 [2024-11-22 01:13:56,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805750773] [2024-11-22 01:13:56,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:13:56,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-22 01:13:56,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:13:56,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-22 01:13:56,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1361, Invalid=1609, Unknown=0, NotChecked=0, Total=2970 [2024-11-22 01:13:56,735 INFO L87 Difference]: Start difference. First operand 486 states and 534 transitions. Second operand has 55 states, 55 states have (on average 5.9818181818181815) internal successors, (329), 55 states have internal predecessors, (329), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2024-11-22 01:13:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:13:57,900 INFO L93 Difference]: Finished difference Result 1015 states and 1140 transitions. [2024-11-22 01:13:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-22 01:13:57,901 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.9818181818181815) internal successors, (329), 55 states have internal predecessors, (329), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) Word has length 249 [2024-11-22 01:13:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:13:57,904 INFO L225 Difference]: With dead ends: 1015 [2024-11-22 01:13:57,904 INFO L226 Difference]: Without dead ends: 1009 [2024-11-22 01:13:57,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3904, Invalid=6602, Unknown=0, NotChecked=0, Total=10506 [2024-11-22 01:13:57,907 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 466 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 01:13:57,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 392 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 01:13:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-11-22 01:13:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2024-11-22 01:13:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 805 states have (on average 1.124223602484472) internal successors, (905), 805 states have internal predecessors, (905), 101 states have call successors, (101), 100 states have call predecessors, (101), 99 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 01:13:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1106 transitions. [2024-11-22 01:13:58,009 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1106 transitions. Word has length 249 [2024-11-22 01:13:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:13:58,013 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1106 transitions. [2024-11-22 01:13:58,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.9818181818181815) internal successors, (329), 55 states have internal predecessors, (329), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2024-11-22 01:13:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1106 transitions. [2024-11-22 01:13:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2024-11-22 01:13:58,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:13:58,022 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:13:58,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-22 01:13:58,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-22 01:13:58,223 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:13:58,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:13:58,224 INFO L85 PathProgramCache]: Analyzing trace with hash -234739816, now seen corresponding path program 3 times [2024-11-22 01:13:58,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:13:58,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853086722] [2024-11-22 01:13:58,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 01:13:58,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:13:58,493 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-11-22 01:13:58,493 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:14:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 100 proven. 7450 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-22 01:14:04,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:14:04,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853086722] [2024-11-22 01:14:04,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853086722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:14:04,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529147788] [2024-11-22 01:14:04,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 01:14:04,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:14:04,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:14:04,404 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) [2024-11-22 01:14:04,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-22 01:14:04,688 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-11-22 01:14:04,688 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:14:04,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-22 01:14:04,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:14:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 100 proven. 12350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:14:05,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:14:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 100 proven. 7450 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-22 01:14:09,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529147788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:14:09,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:14:09,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 53, 54] total 144 [2024-11-22 01:14:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349395871] [2024-11-22 01:14:09,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:14:09,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 144 states [2024-11-22 01:14:09,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:14:09,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2024-11-22 01:14:09,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8991, Invalid=11601, Unknown=0, NotChecked=0, Total=20592 [2024-11-22 01:14:09,225 INFO L87 Difference]: Start difference. First operand 1006 states and 1106 transitions. Second operand has 144 states, 144 states have (on average 5.145833333333333) internal successors, (741), 144 states have internal predecessors, (741), 100 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (149), 99 states have call predecessors, (149), 99 states have call successors, (149) [2024-11-22 01:14:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:14:13,994 INFO L93 Difference]: Finished difference Result 2015 states and 2264 transitions. [2024-11-22 01:14:13,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2024-11-22 01:14:13,994 INFO L78 Accepts]: Start accepts. Automaton has has 144 states, 144 states have (on average 5.145833333333333) internal successors, (741), 144 states have internal predecessors, (741), 100 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (149), 99 states have call predecessors, (149), 99 states have call successors, (149) Word has length 509 [2024-11-22 01:14:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:14:14,001 INFO L225 Difference]: With dead ends: 2015 [2024-11-22 01:14:14,001 INFO L226 Difference]: Without dead ends: 2009 [2024-11-22 01:14:14,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1169 GetRequests, 966 SyntacticMatches, 2 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4677 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=15305, Invalid=25701, Unknown=0, NotChecked=0, Total=41006 [2024-11-22 01:14:14,005 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 970 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 01:14:14,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 778 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 01:14:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2024-11-22 01:14:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 2006. [2024-11-22 01:14:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2006 states, 1605 states have (on average 1.1246105919003115) internal successors, (1805), 1605 states have internal predecessors, (1805), 201 states have call successors, (201), 200 states have call predecessors, (201), 199 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-22 01:14:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2206 transitions. [2024-11-22 01:14:14,220 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2206 transitions. Word has length 509 [2024-11-22 01:14:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:14:14,220 INFO L471 AbstractCegarLoop]: Abstraction has 2006 states and 2206 transitions. [2024-11-22 01:14:14,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 144 states, 144 states have (on average 5.145833333333333) internal successors, (741), 144 states have internal predecessors, (741), 100 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (149), 99 states have call predecessors, (149), 99 states have call successors, (149) [2024-11-22 01:14:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2206 transitions. [2024-11-22 01:14:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2024-11-22 01:14:14,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:14:14,231 INFO L215 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:14:14,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-22 01:14:14,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:14:14,432 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:14:14,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:14:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1685422910, now seen corresponding path program 4 times [2024-11-22 01:14:14,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:14:14,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135885530] [2024-11-22 01:14:14,433 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 01:14:14,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:14:15,407 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 01:14:15,407 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-22 01:14:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583329351] [2024-11-22 01:14:15,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 01:14:15,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:14:15,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:14:15,422 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) [2024-11-22 01:14:15,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-22 01:14:15,795 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 01:14:15,795 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 01:14:15,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 01:14:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 01:14:16,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 01:14:16,628 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 01:14:16,629 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 01:14:16,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-22 01:14:16,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-22 01:14:16,833 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-22 01:14:16,997 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 01:14:17,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:14:17 BoogieIcfgContainer [2024-11-22 01:14:17,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 01:14:17,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 01:14:17,001 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 01:14:17,001 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 01:14:17,002 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:13:38" (3/4) ... [2024-11-22 01:14:17,002 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 01:14:17,152 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 01:14:17,153 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 01:14:17,153 INFO L158 Benchmark]: Toolchain (without parser) took 39626.70ms. Allocated memory was 157.3MB in the beginning and 989.9MB in the end (delta: 832.6MB). Free memory was 85.1MB in the beginning and 508.0MB in the end (delta: -422.9MB). Peak memory consumption was 410.5MB. Max. memory is 16.1GB. [2024-11-22 01:14:17,153 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory was 108.0MB in the beginning and 107.8MB in the end (delta: 241.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 01:14:17,153 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.55ms. Allocated memory is still 157.3MB. Free memory was 84.9MB in the beginning and 72.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 01:14:17,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.61ms. Allocated memory is still 157.3MB. Free memory was 72.2MB in the beginning and 70.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 01:14:17,154 INFO L158 Benchmark]: Boogie Preprocessor took 23.46ms. Allocated memory is still 157.3MB. Free memory was 70.6MB in the beginning and 68.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 01:14:17,154 INFO L158 Benchmark]: RCFGBuilder took 243.25ms. Allocated memory is still 157.3MB. Free memory was 68.9MB in the beginning and 57.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 01:14:17,154 INFO L158 Benchmark]: TraceAbstraction took 38940.55ms. Allocated memory was 157.3MB in the beginning and 989.9MB in the end (delta: 832.6MB). Free memory was 56.9MB in the beginning and 550.9MB in the end (delta: -494.0MB). Peak memory consumption was 341.2MB. Max. memory is 16.1GB. [2024-11-22 01:14:17,154 INFO L158 Benchmark]: Witness Printer took 151.88ms. Allocated memory is still 989.9MB. Free memory was 550.9MB in the beginning and 508.0MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-22 01:14:17,155 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.17ms. Allocated memory is still 157.3MB. Free memory was 108.0MB in the beginning and 107.8MB in the end (delta: 241.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.55ms. Allocated memory is still 157.3MB. Free memory was 84.9MB in the beginning and 72.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.61ms. Allocated memory is still 157.3MB. Free memory was 72.2MB in the beginning and 70.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.46ms. Allocated memory is still 157.3MB. Free memory was 70.6MB in the beginning and 68.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 243.25ms. Allocated memory is still 157.3MB. Free memory was 68.9MB in the beginning and 57.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38940.55ms. Allocated memory was 157.3MB in the beginning and 989.9MB in the end (delta: 832.6MB). Free memory was 56.9MB in the beginning and 550.9MB in the end (delta: -494.0MB). Peak memory consumption was 341.2MB. Max. memory is 16.1GB. * Witness Printer took 151.88ms. Allocated memory is still 989.9MB. Free memory was 550.9MB in the beginning and 508.0MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=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, xy=0, y=0, yx=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, 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, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=1, v=-197, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=1, v=-195, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=199, Y=1, counter=1, v=-195, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=2, v=-195, x=1, xy=0, y=0, yx=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=1, xy=0, y=0, yx=1] [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, 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=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=2, v=-195, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=2, v=-193, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=199, Y=1, counter=2, v=-193, x=2, xy=0, y=0, yx=1] [L31] EXPR counter++ VAL [X=199, Y=1, counter=3, v=-193, x=2, xy=0, y=0, yx=1] [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=2, xy=0, y=0, yx=2] [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, 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=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=3, v=-193, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=3, v=-191, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=199, Y=1, counter=3, v=-191, x=3, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=199, Y=1, counter=4, v=-191, x=3, xy=0, y=0, yx=2] [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=3, xy=0, y=0, yx=3] [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, 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=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=4, v=-191, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=4, v=-189, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=199, Y=1, counter=4, v=-189, x=4, xy=0, y=0, yx=3] [L31] EXPR counter++ VAL [X=199, Y=1, counter=5, v=-189, x=4, xy=0, y=0, yx=3] [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=4, xy=0, y=0, yx=4] [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, 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=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=5, v=-189, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=5, v=-187, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=199, Y=1, counter=5, v=-187, x=5, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=199, Y=1, counter=6, v=-187, x=5, xy=0, y=0, yx=4] [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=5, xy=0, y=0, yx=5] [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, 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=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=6, v=-187, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=6, v=-185, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=199, Y=1, counter=6, v=-185, x=6, xy=0, y=0, yx=5] [L31] EXPR counter++ VAL [X=199, Y=1, counter=7, v=-185, x=6, xy=0, y=0, yx=5] [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=6, xy=0, y=0, yx=6] [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, 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=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=7, v=-185, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=7, v=-183, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=199, Y=1, counter=7, v=-183, x=7, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=199, Y=1, counter=8, v=-183, x=7, xy=0, y=0, yx=6] [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=7, xy=0, y=0, yx=7] [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, 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=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=8, v=-183, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=8, v=-181, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=199, Y=1, counter=8, v=-181, x=8, xy=0, y=0, yx=7] [L31] EXPR counter++ VAL [X=199, Y=1, counter=9, v=-181, x=8, xy=0, y=0, yx=7] [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=8, xy=0, y=0, yx=8] [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, 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=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=9, v=-181, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=9, v=-179, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=199, Y=1, counter=9, v=-179, x=9, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=199, Y=1, counter=10, v=-179, x=9, xy=0, y=0, yx=8] [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=9, xy=0, y=0, yx=9] [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, 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=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=10, v=-179, x=9, xy=0, y=0, yx=9] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=10, v=-177, x=9, xy=0, y=0, yx=9] [L45] x++ VAL [X=199, Y=1, counter=10, v=-177, x=10, xy=0, y=0, yx=9] [L31] EXPR counter++ VAL [X=199, Y=1, counter=11, v=-177, x=10, xy=0, y=0, yx=9] [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=10, xy=0, y=0, yx=10] [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, 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=10, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=11, v=-177, x=10, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=11, v=-175, x=10, xy=0, y=0, yx=10] [L45] x++ VAL [X=199, Y=1, counter=11, v=-175, x=11, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=199, Y=1, counter=12, v=-175, x=11, xy=0, y=0, yx=10] [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=11, xy=0, y=0, yx=11] [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, 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=11, xy=0, y=0, yx=11] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=12, v=-175, x=11, xy=0, y=0, yx=11] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=12, v=-173, x=11, xy=0, y=0, yx=11] [L45] x++ VAL [X=199, Y=1, counter=12, v=-173, x=12, xy=0, y=0, yx=11] [L31] EXPR counter++ VAL [X=199, Y=1, counter=13, v=-173, x=12, xy=0, y=0, yx=11] [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=12, xy=0, y=0, yx=12] [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, 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=12, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=13, v=-173, x=12, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=13, v=-171, x=12, xy=0, y=0, yx=12] [L45] x++ VAL [X=199, Y=1, counter=13, v=-171, x=13, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=199, Y=1, counter=14, v=-171, x=13, xy=0, y=0, yx=12] [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=13, xy=0, y=0, yx=13] [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, 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=13, xy=0, y=0, yx=13] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=14, v=-171, x=13, xy=0, y=0, yx=13] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=14, v=-169, x=13, xy=0, y=0, yx=13] [L45] x++ VAL [X=199, Y=1, counter=14, v=-169, x=14, xy=0, y=0, yx=13] [L31] EXPR counter++ VAL [X=199, Y=1, counter=15, v=-169, x=14, xy=0, y=0, yx=13] [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=14, xy=0, y=0, yx=14] [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, 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=14, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=15, v=-169, x=14, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=15, v=-167, x=14, xy=0, y=0, yx=14] [L45] x++ VAL [X=199, Y=1, counter=15, v=-167, x=15, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=199, Y=1, counter=16, v=-167, x=15, xy=0, y=0, yx=14] [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=15, xy=0, y=0, yx=15] [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, 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=15, xy=0, y=0, yx=15] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=16, v=-167, x=15, xy=0, y=0, yx=15] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=16, v=-165, x=15, xy=0, y=0, yx=15] [L45] x++ VAL [X=199, Y=1, counter=16, v=-165, x=16, xy=0, y=0, yx=15] [L31] EXPR counter++ VAL [X=199, Y=1, counter=17, v=-165, x=16, xy=0, y=0, yx=15] [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=16, xy=0, y=0, yx=16] [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, 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=16, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=17, v=-165, x=16, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=17, v=-163, x=16, xy=0, y=0, yx=16] [L45] x++ VAL [X=199, Y=1, counter=17, v=-163, x=17, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=199, Y=1, counter=18, v=-163, x=17, xy=0, y=0, yx=16] [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=17, xy=0, y=0, yx=17] [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, 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=17, xy=0, y=0, yx=17] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=18, v=-163, x=17, xy=0, y=0, yx=17] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=18, v=-161, x=17, xy=0, y=0, yx=17] [L45] x++ VAL [X=199, Y=1, counter=18, v=-161, x=18, xy=0, y=0, yx=17] [L31] EXPR counter++ VAL [X=199, Y=1, counter=19, v=-161, x=18, xy=0, y=0, yx=17] [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=18, xy=0, y=0, yx=18] [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, 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=18, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=19, v=-161, x=18, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=19, v=-159, x=18, xy=0, y=0, yx=18] [L45] x++ VAL [X=199, Y=1, counter=19, v=-159, x=19, xy=0, y=0, yx=18] [L31] EXPR counter++ VAL [X=199, Y=1, counter=20, v=-159, x=19, xy=0, y=0, yx=18] [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=19, xy=0, y=0, yx=19] [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, 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=19, xy=0, y=0, yx=19] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=20, v=-159, x=19, xy=0, y=0, yx=19] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=20, v=-157, x=19, xy=0, y=0, yx=19] [L45] x++ VAL [X=199, Y=1, counter=20, v=-157, x=20, xy=0, y=0, yx=19] [L31] EXPR counter++ VAL [X=199, Y=1, counter=21, v=-157, x=20, xy=0, y=0, yx=19] [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=20, xy=0, y=0, yx=20] [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, 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=20, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=21, v=-157, x=20, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=21, v=-155, x=20, xy=0, y=0, yx=20] [L45] x++ VAL [X=199, Y=1, counter=21, v=-155, x=21, xy=0, y=0, yx=20] [L31] EXPR counter++ VAL [X=199, Y=1, counter=22, v=-155, x=21, xy=0, y=0, yx=20] [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=21, xy=0, y=0, yx=21] [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, 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=21, xy=0, y=0, yx=21] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=22, v=-155, x=21, xy=0, y=0, yx=21] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=22, v=-153, x=21, xy=0, y=0, yx=21] [L45] x++ VAL [X=199, Y=1, counter=22, v=-153, x=22, xy=0, y=0, yx=21] [L31] EXPR counter++ VAL [X=199, Y=1, counter=23, v=-153, x=22, xy=0, y=0, yx=21] [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=22, xy=0, y=0, yx=22] [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, 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=22, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=23, v=-153, x=22, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=23, v=-151, x=22, xy=0, y=0, yx=22] [L45] x++ VAL [X=199, Y=1, counter=23, v=-151, x=23, xy=0, y=0, yx=22] [L31] EXPR counter++ VAL [X=199, Y=1, counter=24, v=-151, x=23, xy=0, y=0, yx=22] [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=23, xy=0, y=0, yx=23] [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, 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=23, xy=0, y=0, yx=23] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=24, v=-151, x=23, xy=0, y=0, yx=23] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=24, v=-149, x=23, xy=0, y=0, yx=23] [L45] x++ VAL [X=199, Y=1, counter=24, v=-149, x=24, xy=0, y=0, yx=23] [L31] EXPR counter++ VAL [X=199, Y=1, counter=25, v=-149, x=24, xy=0, y=0, yx=23] [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=24, xy=0, y=0, yx=24] [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, 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=24, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=25, v=-149, x=24, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=25, v=-147, x=24, xy=0, y=0, yx=24] [L45] x++ VAL [X=199, Y=1, counter=25, v=-147, x=25, xy=0, y=0, yx=24] [L31] EXPR counter++ VAL [X=199, Y=1, counter=26, v=-147, x=25, xy=0, y=0, yx=24] [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=25, xy=0, y=0, yx=25] [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, 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=25, xy=0, y=0, yx=25] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=26, v=-147, x=25, xy=0, y=0, yx=25] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=26, v=-145, x=25, xy=0, y=0, yx=25] [L45] x++ VAL [X=199, Y=1, counter=26, v=-145, x=26, xy=0, y=0, yx=25] [L31] EXPR counter++ VAL [X=199, Y=1, counter=27, v=-145, x=26, xy=0, y=0, yx=25] [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=26, xy=0, y=0, yx=26] [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, 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=26, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=27, v=-145, x=26, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=27, v=-143, x=26, xy=0, y=0, yx=26] [L45] x++ VAL [X=199, Y=1, counter=27, v=-143, x=27, xy=0, y=0, yx=26] [L31] EXPR counter++ VAL [X=199, Y=1, counter=28, v=-143, x=27, xy=0, y=0, yx=26] [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=27, xy=0, y=0, yx=27] [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, 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=27, xy=0, y=0, yx=27] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=28, v=-143, x=27, xy=0, y=0, yx=27] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=28, v=-141, x=27, xy=0, y=0, yx=27] [L45] x++ VAL [X=199, Y=1, counter=28, v=-141, x=28, xy=0, y=0, yx=27] [L31] EXPR counter++ VAL [X=199, Y=1, counter=29, v=-141, x=28, xy=0, y=0, yx=27] [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=28, xy=0, y=0, yx=28] [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, 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=28, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=29, v=-141, x=28, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=29, v=-139, x=28, xy=0, y=0, yx=28] [L45] x++ VAL [X=199, Y=1, counter=29, v=-139, x=29, xy=0, y=0, yx=28] [L31] EXPR counter++ VAL [X=199, Y=1, counter=30, v=-139, x=29, xy=0, y=0, yx=28] [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=29, xy=0, y=0, yx=29] [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, 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=29, xy=0, y=0, yx=29] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=30, v=-139, x=29, xy=0, y=0, yx=29] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=30, v=-137, x=29, xy=0, y=0, yx=29] [L45] x++ VAL [X=199, Y=1, counter=30, v=-137, x=30, xy=0, y=0, yx=29] [L31] EXPR counter++ VAL [X=199, Y=1, counter=31, v=-137, x=30, xy=0, y=0, yx=29] [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=30, xy=0, y=0, yx=30] [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, 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=30, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=31, v=-137, x=30, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=31, v=-135, x=30, xy=0, y=0, yx=30] [L45] x++ VAL [X=199, Y=1, counter=31, v=-135, x=31, xy=0, y=0, yx=30] [L31] EXPR counter++ VAL [X=199, Y=1, counter=32, v=-135, x=31, xy=0, y=0, yx=30] [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=31, xy=0, y=0, yx=31] [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, 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=31, xy=0, y=0, yx=31] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=32, v=-135, x=31, xy=0, y=0, yx=31] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=32, v=-133, x=31, xy=0, y=0, yx=31] [L45] x++ VAL [X=199, Y=1, counter=32, v=-133, x=32, xy=0, y=0, yx=31] [L31] EXPR counter++ VAL [X=199, Y=1, counter=33, v=-133, x=32, xy=0, y=0, yx=31] [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=32, xy=0, y=0, yx=32] [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, 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=32, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=33, v=-133, x=32, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=33, v=-131, x=32, xy=0, y=0, yx=32] [L45] x++ VAL [X=199, Y=1, counter=33, v=-131, x=33, xy=0, y=0, yx=32] [L31] EXPR counter++ VAL [X=199, Y=1, counter=34, v=-131, x=33, xy=0, y=0, yx=32] [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=33, xy=0, y=0, yx=33] [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, 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=33, xy=0, y=0, yx=33] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=34, v=-131, x=33, xy=0, y=0, yx=33] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=34, v=-129, x=33, xy=0, y=0, yx=33] [L45] x++ VAL [X=199, Y=1, counter=34, v=-129, x=34, xy=0, y=0, yx=33] [L31] EXPR counter++ VAL [X=199, Y=1, counter=35, v=-129, x=34, xy=0, y=0, yx=33] [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=34, xy=0, y=0, yx=34] [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, 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=34, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=35, v=-129, x=34, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=35, v=-127, x=34, xy=0, y=0, yx=34] [L45] x++ VAL [X=199, Y=1, counter=35, v=-127, x=35, xy=0, y=0, yx=34] [L31] EXPR counter++ VAL [X=199, Y=1, counter=36, v=-127, x=35, xy=0, y=0, yx=34] [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=35, xy=0, y=0, yx=35] [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, 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=35, xy=0, y=0, yx=35] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=36, v=-127, x=35, xy=0, y=0, yx=35] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=36, v=-125, x=35, xy=0, y=0, yx=35] [L45] x++ VAL [X=199, Y=1, counter=36, v=-125, x=36, xy=0, y=0, yx=35] [L31] EXPR counter++ VAL [X=199, Y=1, counter=37, v=-125, x=36, xy=0, y=0, yx=35] [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=36, xy=0, y=0, yx=36] [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, 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=36, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=37, v=-125, x=36, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=37, v=-123, x=36, xy=0, y=0, yx=36] [L45] x++ VAL [X=199, Y=1, counter=37, v=-123, x=37, xy=0, y=0, yx=36] [L31] EXPR counter++ VAL [X=199, Y=1, counter=38, v=-123, x=37, xy=0, y=0, yx=36] [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=37, xy=0, y=0, yx=37] [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, 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=37, xy=0, y=0, yx=37] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=38, v=-123, x=37, xy=0, y=0, yx=37] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=38, v=-121, x=37, xy=0, y=0, yx=37] [L45] x++ VAL [X=199, Y=1, counter=38, v=-121, x=38, xy=0, y=0, yx=37] [L31] EXPR counter++ VAL [X=199, Y=1, counter=39, v=-121, x=38, xy=0, y=0, yx=37] [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=38, xy=0, y=0, yx=38] [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, 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=38, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=39, v=-121, x=38, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=39, v=-119, x=38, xy=0, y=0, yx=38] [L45] x++ VAL [X=199, Y=1, counter=39, v=-119, x=39, xy=0, y=0, yx=38] [L31] EXPR counter++ VAL [X=199, Y=1, counter=40, v=-119, x=39, xy=0, y=0, yx=38] [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=39, xy=0, y=0, yx=39] [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, 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=39, xy=0, y=0, yx=39] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=40, v=-119, x=39, xy=0, y=0, yx=39] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=40, v=-117, x=39, xy=0, y=0, yx=39] [L45] x++ VAL [X=199, Y=1, counter=40, v=-117, x=40, xy=0, y=0, yx=39] [L31] EXPR counter++ VAL [X=199, Y=1, counter=41, v=-117, x=40, xy=0, y=0, yx=39] [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=40, xy=0, y=0, yx=40] [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, 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=40, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=41, v=-117, x=40, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=41, v=-115, x=40, xy=0, y=0, yx=40] [L45] x++ VAL [X=199, Y=1, counter=41, v=-115, x=41, xy=0, y=0, yx=40] [L31] EXPR counter++ VAL [X=199, Y=1, counter=42, v=-115, x=41, xy=0, y=0, yx=40] [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=41, xy=0, y=0, yx=41] [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, 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=41, xy=0, y=0, yx=41] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=42, v=-115, x=41, xy=0, y=0, yx=41] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=42, v=-113, x=41, xy=0, y=0, yx=41] [L45] x++ VAL [X=199, Y=1, counter=42, v=-113, x=42, xy=0, y=0, yx=41] [L31] EXPR counter++ VAL [X=199, Y=1, counter=43, v=-113, x=42, xy=0, y=0, yx=41] [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=42, xy=0, y=0, yx=42] [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, 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=42, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=43, v=-113, x=42, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=43, v=-111, x=42, xy=0, y=0, yx=42] [L45] x++ VAL [X=199, Y=1, counter=43, v=-111, x=43, xy=0, y=0, yx=42] [L31] EXPR counter++ VAL [X=199, Y=1, counter=44, v=-111, x=43, xy=0, y=0, yx=42] [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=43, xy=0, y=0, yx=43] [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, 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=43, xy=0, y=0, yx=43] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=44, v=-111, x=43, xy=0, y=0, yx=43] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=44, v=-109, x=43, xy=0, y=0, yx=43] [L45] x++ VAL [X=199, Y=1, counter=44, v=-109, x=44, xy=0, y=0, yx=43] [L31] EXPR counter++ VAL [X=199, Y=1, counter=45, v=-109, x=44, xy=0, y=0, yx=43] [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=44, xy=0, y=0, yx=44] [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, 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=44, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=45, v=-109, x=44, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=45, v=-107, x=44, xy=0, y=0, yx=44] [L45] x++ VAL [X=199, Y=1, counter=45, v=-107, x=45, xy=0, y=0, yx=44] [L31] EXPR counter++ VAL [X=199, Y=1, counter=46, v=-107, x=45, xy=0, y=0, yx=44] [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=45, xy=0, y=0, yx=45] [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, 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=45, xy=0, y=0, yx=45] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=46, v=-107, x=45, xy=0, y=0, yx=45] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=46, v=-105, x=45, xy=0, y=0, yx=45] [L45] x++ VAL [X=199, Y=1, counter=46, v=-105, x=46, xy=0, y=0, yx=45] [L31] EXPR counter++ VAL [X=199, Y=1, counter=47, v=-105, x=46, xy=0, y=0, yx=45] [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=46, xy=0, y=0, yx=46] [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, 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=46, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=47, v=-105, x=46, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=47, v=-103, x=46, xy=0, y=0, yx=46] [L45] x++ VAL [X=199, Y=1, counter=47, v=-103, x=47, xy=0, y=0, yx=46] [L31] EXPR counter++ VAL [X=199, Y=1, counter=48, v=-103, x=47, xy=0, y=0, yx=46] [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=47, xy=0, y=0, yx=47] [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, 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=47, xy=0, y=0, yx=47] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=48, v=-103, x=47, xy=0, y=0, yx=47] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=48, v=-101, x=47, xy=0, y=0, yx=47] [L45] x++ VAL [X=199, Y=1, counter=48, v=-101, x=48, xy=0, y=0, yx=47] [L31] EXPR counter++ VAL [X=199, Y=1, counter=49, v=-101, x=48, xy=0, y=0, yx=47] [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=48, xy=0, y=0, yx=48] [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, 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=48, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=49, v=-101, x=48, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=49, v=-99, x=48, xy=0, y=0, yx=48] [L45] x++ VAL [X=199, Y=1, counter=49, v=-99, x=49, xy=0, y=0, yx=48] [L31] EXPR counter++ VAL [X=199, Y=1, counter=50, v=-99, x=49, xy=0, y=0, yx=48] [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=49, xy=0, y=0, yx=49] [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, 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=49, xy=0, y=0, yx=49] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=50, v=-99, x=49, xy=0, y=0, yx=49] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=50, v=-97, x=49, xy=0, y=0, yx=49] [L45] x++ VAL [X=199, Y=1, counter=50, v=-97, x=50, xy=0, y=0, yx=49] [L31] EXPR counter++ VAL [X=199, Y=1, counter=51, v=-97, x=50, xy=0, y=0, yx=49] [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=50, xy=0, y=0, yx=50] [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, 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=50, xy=0, y=0, yx=50] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=51, v=-97, x=50, xy=0, y=0, yx=50] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=51, v=-95, x=50, xy=0, y=0, yx=50] [L45] x++ VAL [X=199, Y=1, counter=51, v=-95, x=51, xy=0, y=0, yx=50] [L31] EXPR counter++ VAL [X=199, Y=1, counter=52, v=-95, x=51, xy=0, y=0, yx=50] [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=51, xy=0, y=0, yx=51] [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, 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=51, xy=0, y=0, yx=51] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=52, v=-95, x=51, xy=0, y=0, yx=51] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=52, v=-93, x=51, xy=0, y=0, yx=51] [L45] x++ VAL [X=199, Y=1, counter=52, v=-93, x=52, xy=0, y=0, yx=51] [L31] EXPR counter++ VAL [X=199, Y=1, counter=53, v=-93, x=52, xy=0, y=0, yx=51] [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=52, xy=0, y=0, yx=52] [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, 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=52, xy=0, y=0, yx=52] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=53, v=-93, x=52, xy=0, y=0, yx=52] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=53, v=-91, x=52, xy=0, y=0, yx=52] [L45] x++ VAL [X=199, Y=1, counter=53, v=-91, x=53, xy=0, y=0, yx=52] [L31] EXPR counter++ VAL [X=199, Y=1, counter=54, v=-91, x=53, xy=0, y=0, yx=52] [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=53, xy=0, y=0, yx=53] [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, 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=53, xy=0, y=0, yx=53] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=54, v=-91, x=53, xy=0, y=0, yx=53] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=54, v=-89, x=53, xy=0, y=0, yx=53] [L45] x++ VAL [X=199, Y=1, counter=54, v=-89, x=54, xy=0, y=0, yx=53] [L31] EXPR counter++ VAL [X=199, Y=1, counter=55, v=-89, x=54, xy=0, y=0, yx=53] [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=54, xy=0, y=0, yx=54] [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, 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=54, xy=0, y=0, yx=54] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=55, v=-89, x=54, xy=0, y=0, yx=54] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=55, v=-87, x=54, xy=0, y=0, yx=54] [L45] x++ VAL [X=199, Y=1, counter=55, v=-87, x=55, xy=0, y=0, yx=54] [L31] EXPR counter++ VAL [X=199, Y=1, counter=56, v=-87, x=55, xy=0, y=0, yx=54] [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=55, xy=0, y=0, yx=55] [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, 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=55, xy=0, y=0, yx=55] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=56, v=-87, x=55, xy=0, y=0, yx=55] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=56, v=-85, x=55, xy=0, y=0, yx=55] [L45] x++ VAL [X=199, Y=1, counter=56, v=-85, x=56, xy=0, y=0, yx=55] [L31] EXPR counter++ VAL [X=199, Y=1, counter=57, v=-85, x=56, xy=0, y=0, yx=55] [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=56, xy=0, y=0, yx=56] [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, 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=56, xy=0, y=0, yx=56] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=57, v=-85, x=56, xy=0, y=0, yx=56] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=57, v=-83, x=56, xy=0, y=0, yx=56] [L45] x++ VAL [X=199, Y=1, counter=57, v=-83, x=57, xy=0, y=0, yx=56] [L31] EXPR counter++ VAL [X=199, Y=1, counter=58, v=-83, x=57, xy=0, y=0, yx=56] [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=57, xy=0, y=0, yx=57] [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, 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=57, xy=0, y=0, yx=57] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=58, v=-83, x=57, xy=0, y=0, yx=57] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=58, v=-81, x=57, xy=0, y=0, yx=57] [L45] x++ VAL [X=199, Y=1, counter=58, v=-81, x=58, xy=0, y=0, yx=57] [L31] EXPR counter++ VAL [X=199, Y=1, counter=59, v=-81, x=58, xy=0, y=0, yx=57] [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=58, xy=0, y=0, yx=58] [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, 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=58, xy=0, y=0, yx=58] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=59, v=-81, x=58, xy=0, y=0, yx=58] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=59, v=-79, x=58, xy=0, y=0, yx=58] [L45] x++ VAL [X=199, Y=1, counter=59, v=-79, x=59, xy=0, y=0, yx=58] [L31] EXPR counter++ VAL [X=199, Y=1, counter=60, v=-79, x=59, xy=0, y=0, yx=58] [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=59, xy=0, y=0, yx=59] [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, 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=59, xy=0, y=0, yx=59] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=60, v=-79, x=59, xy=0, y=0, yx=59] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=60, v=-77, x=59, xy=0, y=0, yx=59] [L45] x++ VAL [X=199, Y=1, counter=60, v=-77, x=60, xy=0, y=0, yx=59] [L31] EXPR counter++ VAL [X=199, Y=1, counter=61, v=-77, x=60, xy=0, y=0, yx=59] [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=60, xy=0, y=0, yx=60] [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, 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=60, xy=0, y=0, yx=60] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=61, v=-77, x=60, xy=0, y=0, yx=60] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=61, v=-75, x=60, xy=0, y=0, yx=60] [L45] x++ VAL [X=199, Y=1, counter=61, v=-75, x=61, xy=0, y=0, yx=60] [L31] EXPR counter++ VAL [X=199, Y=1, counter=62, v=-75, x=61, xy=0, y=0, yx=60] [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=61, xy=0, y=0, yx=61] [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, 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=61, xy=0, y=0, yx=61] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=62, v=-75, x=61, xy=0, y=0, yx=61] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=62, v=-73, x=61, xy=0, y=0, yx=61] [L45] x++ VAL [X=199, Y=1, counter=62, v=-73, x=62, xy=0, y=0, yx=61] [L31] EXPR counter++ VAL [X=199, Y=1, counter=63, v=-73, x=62, xy=0, y=0, yx=61] [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=62, xy=0, y=0, yx=62] [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, 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=62, xy=0, y=0, yx=62] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=63, v=-73, x=62, xy=0, y=0, yx=62] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=63, v=-71, x=62, xy=0, y=0, yx=62] [L45] x++ VAL [X=199, Y=1, counter=63, v=-71, x=63, xy=0, y=0, yx=62] [L31] EXPR counter++ VAL [X=199, Y=1, counter=64, v=-71, x=63, xy=0, y=0, yx=62] [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=63, xy=0, y=0, yx=63] [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, 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=63, xy=0, y=0, yx=63] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=64, v=-71, x=63, xy=0, y=0, yx=63] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=64, v=-69, x=63, xy=0, y=0, yx=63] [L45] x++ VAL [X=199, Y=1, counter=64, v=-69, x=64, xy=0, y=0, yx=63] [L31] EXPR counter++ VAL [X=199, Y=1, counter=65, v=-69, x=64, xy=0, y=0, yx=63] [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=64, xy=0, y=0, yx=64] [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, 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=64, xy=0, y=0, yx=64] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=65, v=-69, x=64, xy=0, y=0, yx=64] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=65, v=-67, x=64, xy=0, y=0, yx=64] [L45] x++ VAL [X=199, Y=1, counter=65, v=-67, x=65, xy=0, y=0, yx=64] [L31] EXPR counter++ VAL [X=199, Y=1, counter=66, v=-67, x=65, xy=0, y=0, yx=64] [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=65, xy=0, y=0, yx=65] [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, 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=65, xy=0, y=0, yx=65] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=66, v=-67, x=65, xy=0, y=0, yx=65] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=66, v=-65, x=65, xy=0, y=0, yx=65] [L45] x++ VAL [X=199, Y=1, counter=66, v=-65, x=66, xy=0, y=0, yx=65] [L31] EXPR counter++ VAL [X=199, Y=1, counter=67, v=-65, x=66, xy=0, y=0, yx=65] [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=66, xy=0, y=0, yx=66] [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, 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=66, xy=0, y=0, yx=66] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=67, v=-65, x=66, xy=0, y=0, yx=66] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=67, v=-63, x=66, xy=0, y=0, yx=66] [L45] x++ VAL [X=199, Y=1, counter=67, v=-63, x=67, xy=0, y=0, yx=66] [L31] EXPR counter++ VAL [X=199, Y=1, counter=68, v=-63, x=67, xy=0, y=0, yx=66] [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=67, xy=0, y=0, yx=67] [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, 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=67, xy=0, y=0, yx=67] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=68, v=-63, x=67, xy=0, y=0, yx=67] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=68, v=-61, x=67, xy=0, y=0, yx=67] [L45] x++ VAL [X=199, Y=1, counter=68, v=-61, x=68, xy=0, y=0, yx=67] [L31] EXPR counter++ VAL [X=199, Y=1, counter=69, v=-61, x=68, xy=0, y=0, yx=67] [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=68, xy=0, y=0, yx=68] [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, 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=68, xy=0, y=0, yx=68] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=69, v=-61, x=68, xy=0, y=0, yx=68] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=69, v=-59, x=68, xy=0, y=0, yx=68] [L45] x++ VAL [X=199, Y=1, counter=69, v=-59, x=69, xy=0, y=0, yx=68] [L31] EXPR counter++ VAL [X=199, Y=1, counter=70, v=-59, x=69, xy=0, y=0, yx=68] [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=69, xy=0, y=0, yx=69] [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, 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=69, xy=0, y=0, yx=69] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=70, v=-59, x=69, xy=0, y=0, yx=69] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=70, v=-57, x=69, xy=0, y=0, yx=69] [L45] x++ VAL [X=199, Y=1, counter=70, v=-57, x=70, xy=0, y=0, yx=69] [L31] EXPR counter++ VAL [X=199, Y=1, counter=71, v=-57, x=70, xy=0, y=0, yx=69] [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=70, xy=0, y=0, yx=70] [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, 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=70, xy=0, y=0, yx=70] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=71, v=-57, x=70, xy=0, y=0, yx=70] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=71, v=-55, x=70, xy=0, y=0, yx=70] [L45] x++ VAL [X=199, Y=1, counter=71, v=-55, x=71, xy=0, y=0, yx=70] [L31] EXPR counter++ VAL [X=199, Y=1, counter=72, v=-55, x=71, xy=0, y=0, yx=70] [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=71, xy=0, y=0, yx=71] [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, 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=71, xy=0, y=0, yx=71] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=72, v=-55, x=71, xy=0, y=0, yx=71] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=72, v=-53, x=71, xy=0, y=0, yx=71] [L45] x++ VAL [X=199, Y=1, counter=72, v=-53, x=72, xy=0, y=0, yx=71] [L31] EXPR counter++ VAL [X=199, Y=1, counter=73, v=-53, x=72, xy=0, y=0, yx=71] [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=72, xy=0, y=0, yx=72] [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, 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=72, xy=0, y=0, yx=72] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=73, v=-53, x=72, xy=0, y=0, yx=72] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=73, v=-51, x=72, xy=0, y=0, yx=72] [L45] x++ VAL [X=199, Y=1, counter=73, v=-51, x=73, xy=0, y=0, yx=72] [L31] EXPR counter++ VAL [X=199, Y=1, counter=74, v=-51, x=73, xy=0, y=0, yx=72] [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=73, xy=0, y=0, yx=73] [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, 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=73, xy=0, y=0, yx=73] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=74, v=-51, x=73, xy=0, y=0, yx=73] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=74, v=-49, x=73, xy=0, y=0, yx=73] [L45] x++ VAL [X=199, Y=1, counter=74, v=-49, x=74, xy=0, y=0, yx=73] [L31] EXPR counter++ VAL [X=199, Y=1, counter=75, v=-49, x=74, xy=0, y=0, yx=73] [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=74, xy=0, y=0, yx=74] [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, 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=74, xy=0, y=0, yx=74] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=75, v=-49, x=74, xy=0, y=0, yx=74] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=75, v=-47, x=74, xy=0, y=0, yx=74] [L45] x++ VAL [X=199, Y=1, counter=75, v=-47, x=75, xy=0, y=0, yx=74] [L31] EXPR counter++ VAL [X=199, Y=1, counter=76, v=-47, x=75, xy=0, y=0, yx=74] [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=75, xy=0, y=0, yx=75] [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, 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=75, xy=0, y=0, yx=75] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=76, v=-47, x=75, xy=0, y=0, yx=75] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=76, v=-45, x=75, xy=0, y=0, yx=75] [L45] x++ VAL [X=199, Y=1, counter=76, v=-45, x=76, xy=0, y=0, yx=75] [L31] EXPR counter++ VAL [X=199, Y=1, counter=77, v=-45, x=76, xy=0, y=0, yx=75] [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=76, xy=0, y=0, yx=76] [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, 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=76, xy=0, y=0, yx=76] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=77, v=-45, x=76, xy=0, y=0, yx=76] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=77, v=-43, x=76, xy=0, y=0, yx=76] [L45] x++ VAL [X=199, Y=1, counter=77, v=-43, x=77, xy=0, y=0, yx=76] [L31] EXPR counter++ VAL [X=199, Y=1, counter=78, v=-43, x=77, xy=0, y=0, yx=76] [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=77, xy=0, y=0, yx=77] [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, 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=77, xy=0, y=0, yx=77] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=78, v=-43, x=77, xy=0, y=0, yx=77] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=78, v=-41, x=77, xy=0, y=0, yx=77] [L45] x++ VAL [X=199, Y=1, counter=78, v=-41, x=78, xy=0, y=0, yx=77] [L31] EXPR counter++ VAL [X=199, Y=1, counter=79, v=-41, x=78, xy=0, y=0, yx=77] [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=78, xy=0, y=0, yx=78] [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, 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=78, xy=0, y=0, yx=78] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=79, v=-41, x=78, xy=0, y=0, yx=78] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=79, v=-39, x=78, xy=0, y=0, yx=78] [L45] x++ VAL [X=199, Y=1, counter=79, v=-39, x=79, xy=0, y=0, yx=78] [L31] EXPR counter++ VAL [X=199, Y=1, counter=80, v=-39, x=79, xy=0, y=0, yx=78] [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=79, xy=0, y=0, yx=79] [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, 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=79, xy=0, y=0, yx=79] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=80, v=-39, x=79, xy=0, y=0, yx=79] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=80, v=-37, x=79, xy=0, y=0, yx=79] [L45] x++ VAL [X=199, Y=1, counter=80, v=-37, x=80, xy=0, y=0, yx=79] [L31] EXPR counter++ VAL [X=199, Y=1, counter=81, v=-37, x=80, xy=0, y=0, yx=79] [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=80, xy=0, y=0, yx=80] [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, 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=80, xy=0, y=0, yx=80] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=81, v=-37, x=80, xy=0, y=0, yx=80] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=81, v=-35, x=80, xy=0, y=0, yx=80] [L45] x++ VAL [X=199, Y=1, counter=81, v=-35, x=81, xy=0, y=0, yx=80] [L31] EXPR counter++ VAL [X=199, Y=1, counter=82, v=-35, x=81, xy=0, y=0, yx=80] [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=81, xy=0, y=0, yx=81] [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, 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=81, xy=0, y=0, yx=81] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=82, v=-35, x=81, xy=0, y=0, yx=81] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=82, v=-33, x=81, xy=0, y=0, yx=81] [L45] x++ VAL [X=199, Y=1, counter=82, v=-33, x=82, xy=0, y=0, yx=81] [L31] EXPR counter++ VAL [X=199, Y=1, counter=83, v=-33, x=82, xy=0, y=0, yx=81] [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=82, xy=0, y=0, yx=82] [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, 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=82, xy=0, y=0, yx=82] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=83, v=-33, x=82, xy=0, y=0, yx=82] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=83, v=-31, x=82, xy=0, y=0, yx=82] [L45] x++ VAL [X=199, Y=1, counter=83, v=-31, x=83, xy=0, y=0, yx=82] [L31] EXPR counter++ VAL [X=199, Y=1, counter=84, v=-31, x=83, xy=0, y=0, yx=82] [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=83, xy=0, y=0, yx=83] [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, 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=83, xy=0, y=0, yx=83] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=84, v=-31, x=83, xy=0, y=0, yx=83] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=84, v=-29, x=83, xy=0, y=0, yx=83] [L45] x++ VAL [X=199, Y=1, counter=84, v=-29, x=84, xy=0, y=0, yx=83] [L31] EXPR counter++ VAL [X=199, Y=1, counter=85, v=-29, x=84, xy=0, y=0, yx=83] [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=84, xy=0, y=0, yx=84] [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, 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=84, xy=0, y=0, yx=84] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=85, v=-29, x=84, xy=0, y=0, yx=84] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=85, v=-27, x=84, xy=0, y=0, yx=84] [L45] x++ VAL [X=199, Y=1, counter=85, v=-27, x=85, xy=0, y=0, yx=84] [L31] EXPR counter++ VAL [X=199, Y=1, counter=86, v=-27, x=85, xy=0, y=0, yx=84] [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=85, xy=0, y=0, yx=85] [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, 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=85, xy=0, y=0, yx=85] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=86, v=-27, x=85, xy=0, y=0, yx=85] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=86, v=-25, x=85, xy=0, y=0, yx=85] [L45] x++ VAL [X=199, Y=1, counter=86, v=-25, x=86, xy=0, y=0, yx=85] [L31] EXPR counter++ VAL [X=199, Y=1, counter=87, v=-25, x=86, xy=0, y=0, yx=85] [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=86, xy=0, y=0, yx=86] [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, 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=86, xy=0, y=0, yx=86] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=87, v=-25, x=86, xy=0, y=0, yx=86] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=87, v=-23, x=86, xy=0, y=0, yx=86] [L45] x++ VAL [X=199, Y=1, counter=87, v=-23, x=87, xy=0, y=0, yx=86] [L31] EXPR counter++ VAL [X=199, Y=1, counter=88, v=-23, x=87, xy=0, y=0, yx=86] [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=87, xy=0, y=0, yx=87] [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, 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=87, xy=0, y=0, yx=87] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=88, v=-23, x=87, xy=0, y=0, yx=87] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=88, v=-21, x=87, xy=0, y=0, yx=87] [L45] x++ VAL [X=199, Y=1, counter=88, v=-21, x=88, xy=0, y=0, yx=87] [L31] EXPR counter++ VAL [X=199, Y=1, counter=89, v=-21, x=88, xy=0, y=0, yx=87] [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=88, xy=0, y=0, yx=88] [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, 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=88, xy=0, y=0, yx=88] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=89, v=-21, x=88, xy=0, y=0, yx=88] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=89, v=-19, x=88, xy=0, y=0, yx=88] [L45] x++ VAL [X=199, Y=1, counter=89, v=-19, x=89, xy=0, y=0, yx=88] [L31] EXPR counter++ VAL [X=199, Y=1, counter=90, v=-19, x=89, xy=0, y=0, yx=88] [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=89, xy=0, y=0, yx=89] [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, 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=89, xy=0, y=0, yx=89] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=90, v=-19, x=89, xy=0, y=0, yx=89] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=90, v=-17, x=89, xy=0, y=0, yx=89] [L45] x++ VAL [X=199, Y=1, counter=90, v=-17, x=90, xy=0, y=0, yx=89] [L31] EXPR counter++ VAL [X=199, Y=1, counter=91, v=-17, x=90, xy=0, y=0, yx=89] [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=90, xy=0, y=0, yx=90] [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, 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=90, xy=0, y=0, yx=90] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=91, v=-17, x=90, xy=0, y=0, yx=90] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=91, v=-15, x=90, xy=0, y=0, yx=90] [L45] x++ VAL [X=199, Y=1, counter=91, v=-15, x=91, xy=0, y=0, yx=90] [L31] EXPR counter++ VAL [X=199, Y=1, counter=92, v=-15, x=91, xy=0, y=0, yx=90] [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=91, xy=0, y=0, yx=91] [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, 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=91, xy=0, y=0, yx=91] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=92, v=-15, x=91, xy=0, y=0, yx=91] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=92, v=-13, x=91, xy=0, y=0, yx=91] [L45] x++ VAL [X=199, Y=1, counter=92, v=-13, x=92, xy=0, y=0, yx=91] [L31] EXPR counter++ VAL [X=199, Y=1, counter=93, v=-13, x=92, xy=0, y=0, yx=91] [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=92, xy=0, y=0, yx=92] [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, 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=92, xy=0, y=0, yx=92] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=93, v=-13, x=92, xy=0, y=0, yx=92] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=93, v=-11, x=92, xy=0, y=0, yx=92] [L45] x++ VAL [X=199, Y=1, counter=93, v=-11, x=93, xy=0, y=0, yx=92] [L31] EXPR counter++ VAL [X=199, Y=1, counter=94, v=-11, x=93, xy=0, y=0, yx=92] [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=93, xy=0, y=0, yx=93] [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, 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=93, xy=0, y=0, yx=93] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=94, v=-11, x=93, xy=0, y=0, yx=93] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=94, v=-9, x=93, xy=0, y=0, yx=93] [L45] x++ VAL [X=199, Y=1, counter=94, v=-9, x=94, xy=0, y=0, yx=93] [L31] EXPR counter++ VAL [X=199, Y=1, counter=95, v=-9, x=94, xy=0, y=0, yx=93] [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=94, xy=0, y=0, yx=94] [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, 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=94, xy=0, y=0, yx=94] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=95, v=-9, x=94, xy=0, y=0, yx=94] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=95, v=-7, x=94, xy=0, y=0, yx=94] [L45] x++ VAL [X=199, Y=1, counter=95, v=-7, x=95, xy=0, y=0, yx=94] [L31] EXPR counter++ VAL [X=199, Y=1, counter=96, v=-7, x=95, xy=0, y=0, yx=94] [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=95, xy=0, y=0, yx=95] [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, 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=95, xy=0, y=0, yx=95] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=96, v=-7, x=95, xy=0, y=0, yx=95] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=96, v=-5, x=95, xy=0, y=0, yx=95] [L45] x++ VAL [X=199, Y=1, counter=96, v=-5, x=96, xy=0, y=0, yx=95] [L31] EXPR counter++ VAL [X=199, Y=1, counter=97, v=-5, x=96, xy=0, y=0, yx=95] [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=96, xy=0, y=0, yx=96] [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, 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=96, xy=0, y=0, yx=96] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=97, v=-5, x=96, xy=0, y=0, yx=96] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=97, v=-3, x=96, xy=0, y=0, yx=96] [L45] x++ VAL [X=199, Y=1, counter=97, v=-3, x=97, xy=0, y=0, yx=96] [L31] EXPR counter++ VAL [X=199, Y=1, counter=98, v=-3, x=97, xy=0, y=0, yx=96] [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=97, xy=0, y=0, yx=97] [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, 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=97, xy=0, y=0, yx=97] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=98, v=-3, x=97, xy=0, y=0, yx=97] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=98, v=-1, x=97, xy=0, y=0, yx=97] [L45] x++ VAL [X=199, Y=1, counter=98, v=-1, x=98, xy=0, y=0, yx=97] [L31] EXPR counter++ VAL [X=199, Y=1, counter=99, v=-1, x=98, xy=0, y=0, yx=97] [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=98, xy=0, y=0, yx=98] [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, 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=98, xy=0, y=0, yx=98] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=99, v=-1, x=98, xy=0, y=0, yx=98] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=99, v=1, x=98, xy=0, y=0, yx=98] [L45] x++ VAL [X=199, Y=1, counter=99, v=1, x=99, xy=0, y=0, yx=98] [L31] EXPR counter++ VAL [X=199, Y=1, counter=100, v=1, x=99, xy=0, y=0, yx=98] [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=99, xy=0, y=0, yx=99] [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, 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=99, xy=0, y=0, yx=99] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=100, v=1, x=99, xy=0, y=0, yx=99] [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=99, xy=0, y=1, yx=99] [L45] x++ VAL [X=199, Y=1, counter=100, v=-395, x=100, xy=0, y=1, yx=99] [L31] EXPR counter++ VAL [X=199, Y=1, counter=101, v=-395, x=100, xy=0, y=1, yx=99] [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, xy=100, y=1, yx=100] [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, counter=101] [L16] reach_error() VAL [\old(cond)=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.7s, OverallIterations: 16, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2124 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2119 mSDsluCounter, 2562 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2339 mSDsCounter, 415 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2368 IncrementalHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 415 mSolverCounterUnsat, 223 mSDtfsCounter, 2368 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2968 GetRequests, 2295 SyntacticMatches, 16 SemanticMatches, 657 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12230 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2006occurred in iteration=15, InterpolantAutomatonStates: 620, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 98 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 4567 NumberOfCodeBlocks, 4457 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 3669 ConstructedInterpolants, 2 QuantifiedInterpolants, 11323 SizeOfPredicates, 123 NumberOfNonLiveVariables, 3210 ConjunctsInSsa, 346 ConjunctsInUnsatCore, 36 InterpolantComputations, 3 PerfectInterpolantSequences, 14518/49938 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! [2024-11-22 01:14:17,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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