./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.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 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:15:36,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:15:37,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:15:37,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:15:37,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:15:37,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:15:37,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:15:37,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:15:37,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:15:37,043 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:15:37,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:15:37,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:15:37,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:15:37,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:15:37,044 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:15:37,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:15:37,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:15:37,046 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:15:37,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:15:37,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:15:37,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:15:37,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:15:37,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:15:37,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:15:37,047 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:15:37,047 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:15:37,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:15:37,048 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:15:37,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:15:37,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:15:37,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:15:37,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:15:37,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:15:37,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:15:37,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:15:37,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:15:37,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:15:37,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:15:37,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:15:37,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:15:37,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:15:37,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:15:37,051 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 -> 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 [2024-11-19 21:15:37,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:15:37,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:15:37,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:15:37,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:15:37,259 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:15:37,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2024-11-19 21:15:38,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:15:38,567 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:15:38,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2024-11-19 21:15:38,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c65d4d94f/45d36632ec1b4a59b679596cf5e99cfe/FLAG8ffad6df5 [2024-11-19 21:15:38,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c65d4d94f/45d36632ec1b4a59b679596cf5e99cfe [2024-11-19 21:15:38,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:15:38,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:15:38,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:15:38,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:15:38,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:15:38,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5c17e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38, skipping insertion in model container [2024-11-19 21:15:38,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:15:38,756 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/egcd-ll_unwindbound50.c[489,502] [2024-11-19 21:15:38,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:15:38,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:15:38,794 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/egcd-ll_unwindbound50.c[489,502] [2024-11-19 21:15:38,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:15:38,816 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:15:38,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38 WrapperNode [2024-11-19 21:15:38,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:15:38,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:15:38,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:15:38,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:15:38,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,847 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2024-11-19 21:15:38,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:15:38,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:15:38,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:15:38,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:15:38,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,870 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-19 21:15:38,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:15:38,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:15:38,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:15:38,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:15:38,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (1/1) ... [2024-11-19 21:15:38,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:15:38,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:38,913 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-19 21:15:38,918 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-19 21:15:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:15:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 21:15:38,953 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 21:15:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:15:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:15:38,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:15:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 21:15:38,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 21:15:39,004 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:15:39,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:15:39,166 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-19 21:15:39,166 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:15:39,195 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:15:39,196 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:15:39,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:39 BoogieIcfgContainer [2024-11-19 21:15:39,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:15:39,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:15:39,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:15:39,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:15:39,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:15:38" (1/3) ... [2024-11-19 21:15:39,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39db1157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:39, skipping insertion in model container [2024-11-19 21:15:39,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:38" (2/3) ... [2024-11-19 21:15:39,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39db1157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:39, skipping insertion in model container [2024-11-19 21:15:39,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:39" (3/3) ... [2024-11-19 21:15:39,203 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound50.c [2024-11-19 21:15:39,216 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:15:39,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:15:39,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:15:39,272 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;@24990961, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:15:39,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:15:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 21:15:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 21:15:39,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:39,283 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:39,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:39,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2024-11-19 21:15:39,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757808506] [2024-11-19 21:15:39,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:39,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:39,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:15:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:39,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:15:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:15:39,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:39,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757808506] [2024-11-19 21:15:39,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757808506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:15:39,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:15:39,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 21:15:39,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141034274] [2024-11-19 21:15:39,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:15:39,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:15:39,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:39,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:15:39,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 21:15:39,440 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 21:15:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:39,455 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2024-11-19 21:15:39,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:15:39,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-19 21:15:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:39,461 INFO L225 Difference]: With dead ends: 57 [2024-11-19 21:15:39,461 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 21:15:39,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 21:15:39,466 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:39,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:15:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 21:15:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-19 21:15:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 21:15:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-11-19 21:15:39,492 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2024-11-19 21:15:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:39,492 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-11-19 21:15:39,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 21:15:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-11-19 21:15:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 21:15:39,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:39,494 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:39,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 21:15:39,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:39,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:39,495 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2024-11-19 21:15:39,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:39,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48010536] [2024-11-19 21:15:39,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:39,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:15:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:15:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:15:39,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:39,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48010536] [2024-11-19 21:15:39,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48010536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:15:39,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:15:39,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 21:15:39,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118056176] [2024-11-19 21:15:39,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:15:39,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 21:15:39,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:39,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 21:15:39,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 21:15:39,661 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 21:15:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:39,688 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-11-19 21:15:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 21:15:39,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-19 21:15:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:39,691 INFO L225 Difference]: With dead ends: 38 [2024-11-19 21:15:39,691 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 21:15:39,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-19 21:15:39,692 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 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-19 21:15:39,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:15:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 21:15:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 21:15:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 21:15:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-11-19 21:15:39,699 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2024-11-19 21:15:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:39,699 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-11-19 21:15:39,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 21:15:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-11-19 21:15:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 21:15:39,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:39,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:39,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 21:15:39,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:39,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2024-11-19 21:15:39,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:39,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107697700] [2024-11-19 21:15:39,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:39,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:15:39,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928937434] [2024-11-19 21:15:39,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:39,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:39,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:39,733 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-19 21:15:39,735 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-19 21:15:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:39,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 21:15:39,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:15:39,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:15:39,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:39,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107697700] [2024-11-19 21:15:39,877 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:15:39,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928937434] [2024-11-19 21:15:39,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928937434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:15:39,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:15:39,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 21:15:39,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443440980] [2024-11-19 21:15:39,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:15:39,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:15:39,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:39,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:15:39,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:15:39,882 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 21:15:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:39,937 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2024-11-19 21:15:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:15:39,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-19 21:15:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:39,939 INFO L225 Difference]: With dead ends: 45 [2024-11-19 21:15:39,939 INFO L226 Difference]: Without dead ends: 43 [2024-11-19 21:15:39,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:15:39,941 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:39,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 118 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:15:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-19 21:15:39,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-19 21:15:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 21:15:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-11-19 21:15:39,952 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2024-11-19 21:15:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:39,953 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-11-19 21:15:39,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 21:15:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-11-19 21:15:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 21:15:39,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:39,953 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:39,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 21:15:40,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:40,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:40,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2024-11-19 21:15:40,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:40,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350587180] [2024-11-19 21:15:40,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:40,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:15:40,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1903367785] [2024-11-19 21:15:40,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:40,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:40,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:40,172 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-19 21:15:40,173 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-19 21:15:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:40,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 21:15:40,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:15:40,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:15:40,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:40,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350587180] [2024-11-19 21:15:40,268 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:15:40,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903367785] [2024-11-19 21:15:40,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903367785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:15:40,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:15:40,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 21:15:40,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779139622] [2024-11-19 21:15:40,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:15:40,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:15:40,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:40,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:15:40,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:15:40,270 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 21:15:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:40,340 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-11-19 21:15:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:15:40,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-11-19 21:15:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:40,342 INFO L225 Difference]: With dead ends: 49 [2024-11-19 21:15:40,342 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 21:15:40,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:15:40,343 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:40,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 132 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:15:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 21:15:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-19 21:15:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 21:15:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2024-11-19 21:15:40,355 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2024-11-19 21:15:40,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:40,356 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-11-19 21:15:40,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 21:15:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2024-11-19 21:15:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 21:15:40,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:40,357 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:40,363 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-19 21:15:40,557 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,SelfDestructingSolverStorable3 [2024-11-19 21:15:40,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:40,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:40,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2024-11-19 21:15:40,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:40,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491293111] [2024-11-19 21:15:40,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:40,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:15:40,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272306701] [2024-11-19 21:15:40,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:40,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:40,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:40,580 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-19 21:15:40,581 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-19 21:15:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:40,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 21:15:40,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:15:40,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:15:40,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:40,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491293111] [2024-11-19 21:15:40,691 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:15:40,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272306701] [2024-11-19 21:15:40,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272306701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:15:40,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:15:40,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 21:15:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468373232] [2024-11-19 21:15:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:15:40,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:15:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:40,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:15:40,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:15:40,694 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 21:15:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:40,753 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2024-11-19 21:15:40,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:15:40,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-11-19 21:15:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:40,756 INFO L225 Difference]: With dead ends: 71 [2024-11-19 21:15:40,756 INFO L226 Difference]: Without dead ends: 67 [2024-11-19 21:15:40,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:15:40,758 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:40,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:15:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-19 21:15:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-19 21:15:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 39 states have internal predecessors, (47), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 21:15:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-11-19 21:15:40,777 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2024-11-19 21:15:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:40,777 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-11-19 21:15:40,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 21:15:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-11-19 21:15:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 21:15:40,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:40,778 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:40,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 21:15:40,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:40,979 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:40,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2024-11-19 21:15:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:40,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654569033] [2024-11-19 21:15:40,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:40,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:15:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:15:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:15:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 21:15:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:15:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 21:15:41,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:41,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654569033] [2024-11-19 21:15:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654569033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:15:41,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:15:41,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 21:15:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467248456] [2024-11-19 21:15:41,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:15:41,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:15:41,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:41,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:15:41,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:15:41,120 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 21:15:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:41,165 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2024-11-19 21:15:41,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:15:41,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2024-11-19 21:15:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:41,167 INFO L225 Difference]: With dead ends: 83 [2024-11-19 21:15:41,167 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 21:15:41,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:15:41,169 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:41,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:15:41,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 21:15:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2024-11-19 21:15:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 45 states have internal predecessors, (50), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 21:15:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2024-11-19 21:15:41,185 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2024-11-19 21:15:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:41,185 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2024-11-19 21:15:41,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 21:15:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2024-11-19 21:15:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 21:15:41,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:41,186 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:41,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:15:41,187 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:41,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2024-11-19 21:15:41,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:41,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266204775] [2024-11-19 21:15:41,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:41,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:15:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:15:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:15:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 21:15:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:15:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 21:15:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:41,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266204775] [2024-11-19 21:15:41,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266204775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:15:41,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516163495] [2024-11-19 21:15:41,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:41,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:41,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:41,280 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-19 21:15:41,281 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-19 21:15:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 21:15:41,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 21:15:41,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:15:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 21:15:41,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516163495] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:15:41,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:15:41,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-19 21:15:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10298472] [2024-11-19 21:15:41,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:15:41,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 21:15:41,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:41,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 21:15:41,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:15:41,416 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 21:15:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:41,533 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2024-11-19 21:15:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:15:41,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 38 [2024-11-19 21:15:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:41,536 INFO L225 Difference]: With dead ends: 218 [2024-11-19 21:15:41,536 INFO L226 Difference]: Without dead ends: 196 [2024-11-19 21:15:41,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 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-19 21:15:41,537 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:41,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 156 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:15:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-19 21:15:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2024-11-19 21:15:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 119 states have internal predecessors, (132), 61 states have call successors, (61), 21 states have call predecessors, (61), 20 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-19 21:15:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2024-11-19 21:15:41,567 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2024-11-19 21:15:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:41,568 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2024-11-19 21:15:41,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 21:15:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2024-11-19 21:15:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 21:15:41,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:41,571 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:41,577 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-19 21:15:41,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:41,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:41,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2024-11-19 21:15:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342602970] [2024-11-19 21:15:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:41,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:15:41,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1131964265] [2024-11-19 21:15:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:41,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:41,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:41,787 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-19 21:15:41,787 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-19 21:15:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:41,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 21:15:41,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 21:15:41,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:15:41,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:41,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342602970] [2024-11-19 21:15:41,886 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:15:41,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131964265] [2024-11-19 21:15:41,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131964265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:15:41,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:15:41,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 21:15:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338812527] [2024-11-19 21:15:41,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:15:41,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:15:41,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:41,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:15:41,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:15:41,888 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 21:15:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:41,925 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2024-11-19 21:15:41,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:15:41,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-11-19 21:15:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:41,927 INFO L225 Difference]: With dead ends: 204 [2024-11-19 21:15:41,927 INFO L226 Difference]: Without dead ends: 199 [2024-11-19 21:15:41,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:15:41,928 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:41,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 112 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:15:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-19 21:15:41,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-19 21:15:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 117 states have (on average 1.205128205128205) internal successors, (141), 128 states have internal predecessors, (141), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-19 21:15:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2024-11-19 21:15:41,946 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2024-11-19 21:15:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:41,946 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2024-11-19 21:15:41,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 21:15:41,947 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2024-11-19 21:15:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 21:15:41,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:41,947 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:41,955 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-19 21:15:42,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:42,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:42,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:42,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2024-11-19 21:15:42,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:42,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617473244] [2024-11-19 21:15:42,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:42,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:42,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:15:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:42,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:15:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:42,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:15:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:42,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 21:15:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:42,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:15:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:42,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:15:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 21:15:42,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:42,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617473244] [2024-11-19 21:15:42,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617473244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:15:42,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373314471] [2024-11-19 21:15:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:42,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:42,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:42,309 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-19 21:15:42,310 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-19 21:15:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:42,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 21:15:42,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:15:42,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:15:42,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373314471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:15:42,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:15:42,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-19 21:15:42,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359059527] [2024-11-19 21:15:42,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:15:42,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:15:42,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:42,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:15:42,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:15:42,427 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 21:15:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:42,518 INFO L93 Difference]: Finished difference Result 230 states and 279 transitions. [2024-11-19 21:15:42,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:15:42,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-11-19 21:15:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:42,520 INFO L225 Difference]: With dead ends: 230 [2024-11-19 21:15:42,520 INFO L226 Difference]: Without dead ends: 220 [2024-11-19 21:15:42,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:15:42,523 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:42,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:15:42,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-19 21:15:42,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2024-11-19 21:15:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 130 states have (on average 1.176923076923077) internal successors, (153), 141 states have internal predecessors, (153), 57 states have call successors, (57), 28 states have call predecessors, (57), 28 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-19 21:15:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 261 transitions. [2024-11-19 21:15:42,543 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 261 transitions. Word has length 40 [2024-11-19 21:15:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:42,543 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 261 transitions. [2024-11-19 21:15:42,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 21:15:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 261 transitions. [2024-11-19 21:15:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 21:15:42,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:42,546 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:42,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 21:15:42,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:42,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:42,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2024-11-19 21:15:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:42,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144191185] [2024-11-19 21:15:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:15:42,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158181395] [2024-11-19 21:15:42,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 21:15:42,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:42,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:42,760 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-19 21:15:42,761 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-19 21:15:42,794 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 21:15:42,795 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:15:42,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 21:15:42,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 21:15:43,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:15:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 21:15:43,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:43,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144191185] [2024-11-19 21:15:43,340 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:15:43,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158181395] [2024-11-19 21:15:43,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158181395] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:15:43,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 21:15:43,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2024-11-19 21:15:43,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052211587] [2024-11-19 21:15:43,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 21:15:43,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 21:15:43,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:43,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 21:15:43,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:15:43,341 INFO L87 Difference]: Start difference. First operand 216 states and 261 transitions. Second operand has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-19 21:15:44,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:44,224 INFO L93 Difference]: Finished difference Result 266 states and 335 transitions. [2024-11-19 21:15:44,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 21:15:44,225 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 43 [2024-11-19 21:15:44,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:44,229 INFO L225 Difference]: With dead ends: 266 [2024-11-19 21:15:44,229 INFO L226 Difference]: Without dead ends: 264 [2024-11-19 21:15:44,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:15:44,230 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:44,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 258 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 21:15:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-19 21:15:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 228. [2024-11-19 21:15:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 139 states have (on average 1.1654676258992807) internal successors, (162), 150 states have internal predecessors, (162), 57 states have call successors, (57), 31 states have call predecessors, (57), 31 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-19 21:15:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2024-11-19 21:15:44,263 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 43 [2024-11-19 21:15:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:44,263 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2024-11-19 21:15:44,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-19 21:15:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2024-11-19 21:15:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 21:15:44,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:44,264 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:44,271 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-19 21:15:44,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:44,466 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:44,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash -740326292, now seen corresponding path program 1 times [2024-11-19 21:15:44,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:44,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53512559] [2024-11-19 21:15:44,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:44,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:15:44,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110781229] [2024-11-19 21:15:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:44,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:44,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:44,478 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-19 21:15:44,479 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-19 21:15:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:44,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 21:15:44,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-19 21:15:44,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:15:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 21:15:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53512559] [2024-11-19 21:15:44,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:15:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110781229] [2024-11-19 21:15:44,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110781229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:15:44,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 21:15:44,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-11-19 21:15:44,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974445263] [2024-11-19 21:15:44,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 21:15:44,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 21:15:44,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:44,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 21:15:44,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:15:44,975 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-19 21:15:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:45,469 INFO L93 Difference]: Finished difference Result 277 states and 342 transitions. [2024-11-19 21:15:45,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 21:15:45,470 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 48 [2024-11-19 21:15:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:45,472 INFO L225 Difference]: With dead ends: 277 [2024-11-19 21:15:45,472 INFO L226 Difference]: Without dead ends: 235 [2024-11-19 21:15:45,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:15:45,473 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:45,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 278 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 21:15:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-19 21:15:45,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 200. [2024-11-19 21:15:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 129 states have (on average 1.1472868217054264) internal successors, (148), 135 states have internal predecessors, (148), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 21:15:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 229 transitions. [2024-11-19 21:15:45,500 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 229 transitions. Word has length 48 [2024-11-19 21:15:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:45,501 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 229 transitions. [2024-11-19 21:15:45,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-19 21:15:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 229 transitions. [2024-11-19 21:15:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 21:15:45,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:45,501 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:45,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 21:15:45,705 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,SelfDestructingSolverStorable10 [2024-11-19 21:15:45,706 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:45,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2024-11-19 21:15:45,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:45,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692331709] [2024-11-19 21:15:45,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:45,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:15:45,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266674939] [2024-11-19 21:15:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:45,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:45,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:45,719 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-19 21:15:45,720 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-19 21:15:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:45,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 21:15:45,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-19 21:15:45,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:15:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 21:15:46,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:46,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692331709] [2024-11-19 21:15:46,116 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:15:46,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266674939] [2024-11-19 21:15:46,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266674939] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:15:46,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 21:15:46,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-19 21:15:46,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121700124] [2024-11-19 21:15:46,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 21:15:46,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 21:15:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:46,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 21:15:46,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:15:46,118 INFO L87 Difference]: Start difference. First operand 200 states and 229 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-19 21:15:46,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:46,368 INFO L93 Difference]: Finished difference Result 220 states and 255 transitions. [2024-11-19 21:15:46,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:15:46,368 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 57 [2024-11-19 21:15:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:46,369 INFO L225 Difference]: With dead ends: 220 [2024-11-19 21:15:46,370 INFO L226 Difference]: Without dead ends: 213 [2024-11-19 21:15:46,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:15:46,370 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 41 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:46,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 358 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 21:15:46,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-19 21:15:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 191. [2024-11-19 21:15:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.1395348837209303) internal successors, (147), 131 states have internal predecessors, (147), 34 states have call successors, (34), 28 states have call predecessors, (34), 27 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 21:15:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2024-11-19 21:15:46,392 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 57 [2024-11-19 21:15:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:46,393 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2024-11-19 21:15:46,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-19 21:15:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2024-11-19 21:15:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 21:15:46,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:46,394 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:46,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 21:15:46,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:46,598 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:46,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash -388853941, now seen corresponding path program 1 times [2024-11-19 21:15:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:46,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570772330] [2024-11-19 21:15:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:46,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:15:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:46,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:15:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:46,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:15:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:46,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 21:15:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:46,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:15:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:46,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:15:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:46,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:15:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:46,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-19 21:15:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:46,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-19 21:15:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-19 21:15:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570772330] [2024-11-19 21:15:46,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570772330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:15:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702990861] [2024-11-19 21:15:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:46,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:46,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:46,740 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-19 21:15:46,743 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-19 21:15:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:46,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 21:15:46,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-19 21:15:46,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:15:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-19 21:15:46,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702990861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:15:46,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:15:46,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 13 [2024-11-19 21:15:46,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240669696] [2024-11-19 21:15:46,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:15:46,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 21:15:46,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:46,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 21:15:46,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:15:46,886 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 21:15:46,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:46,967 INFO L93 Difference]: Finished difference Result 217 states and 242 transitions. [2024-11-19 21:15:46,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:15:46,968 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 59 [2024-11-19 21:15:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:46,969 INFO L225 Difference]: With dead ends: 217 [2024-11-19 21:15:46,969 INFO L226 Difference]: Without dead ends: 197 [2024-11-19 21:15:46,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:15:46,969 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:46,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:15:46,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-19 21:15:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 98. [2024-11-19 21:15:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.106060606060606) internal successors, (73), 68 states have internal predecessors, (73), 17 states have call successors, (17), 14 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 21:15:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-11-19 21:15:46,983 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 59 [2024-11-19 21:15:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:46,984 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-11-19 21:15:46,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 21:15:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-19 21:15:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 21:15:46,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:46,984 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:46,991 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-19 21:15:47,188 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,SelfDestructingSolverStorable12 [2024-11-19 21:15:47,189 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:47,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2024-11-19 21:15:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562453964] [2024-11-19 21:15:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:15:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:15:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:15:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 21:15:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:15:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:15:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:15:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-19 21:15:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:15:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:15:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:15:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:15:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:15:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:15:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-19 21:15:47,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:47,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562453964] [2024-11-19 21:15:47,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562453964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:15:47,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985882397] [2024-11-19 21:15:47,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 21:15:47,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:47,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:47,323 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-19 21:15:47,324 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-19 21:15:47,367 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 21:15:47,367 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:15:47,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 21:15:47,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-19 21:15:47,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:15:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-19 21:15:47,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985882397] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:15:47,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:15:47,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-19 21:15:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770539970] [2024-11-19 21:15:47,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:15:47,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 21:15:47,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:47,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 21:15:47,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:15:47,566 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2024-11-19 21:15:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:47,751 INFO L93 Difference]: Finished difference Result 233 states and 258 transitions. [2024-11-19 21:15:47,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 21:15:47,751 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) Word has length 95 [2024-11-19 21:15:47,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:47,752 INFO L225 Difference]: With dead ends: 233 [2024-11-19 21:15:47,752 INFO L226 Difference]: Without dead ends: 224 [2024-11-19 21:15:47,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:15:47,753 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:47,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 138 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:15:47,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-19 21:15:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 212. [2024-11-19 21:15:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 144 states have (on average 1.0902777777777777) internal successors, (157), 146 states have internal predecessors, (157), 35 states have call successors, (35), 32 states have call predecessors, (35), 32 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 21:15:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 225 transitions. [2024-11-19 21:15:47,780 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 225 transitions. Word has length 95 [2024-11-19 21:15:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:47,780 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 225 transitions. [2024-11-19 21:15:47,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2024-11-19 21:15:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 225 transitions. [2024-11-19 21:15:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-19 21:15:47,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:47,782 INFO L215 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:47,788 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-19 21:15:47,982 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,SelfDestructingSolverStorable13 [2024-11-19 21:15:47,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:47,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2024-11-19 21:15:47,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:47,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308972802] [2024-11-19 21:15:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:47,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:15:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:15:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:15:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 21:15:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:15:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:15:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:15:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-19 21:15:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:15:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:15:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:15:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:15:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:15:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:15:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:15:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:15:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:15:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:15:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-19 21:15:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-19 21:15:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-19 21:15:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-19 21:15:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-19 21:15:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-19 21:15:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-19 21:15:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-19 21:15:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-19 21:15:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-19 21:15:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-19 21:15:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-19 21:15:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-19 21:15:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-19 21:15:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2024-11-19 21:15:48,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:48,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308972802] [2024-11-19 21:15:48,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308972802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:15:48,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769774800] [2024-11-19 21:15:48,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 21:15:48,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:48,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:48,370 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-19 21:15:48,371 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-19 21:15:48,459 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2024-11-19 21:15:48,460 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:15:48,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 21:15:48,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 21:15:48,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:15:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2024-11-19 21:15:48,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769774800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:15:48,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:15:48,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2024-11-19 21:15:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608442001] [2024-11-19 21:15:48,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:15:48,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 21:15:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:48,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 21:15:48,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2024-11-19 21:15:48,892 INFO L87 Difference]: Start difference. First operand 212 states and 225 transitions. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (97), 13 states have call predecessors, (97), 12 states have return successors, (96), 22 states have call predecessors, (96), 22 states have call successors, (96) [2024-11-19 21:15:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:49,369 INFO L93 Difference]: Finished difference Result 473 states and 522 transitions. [2024-11-19 21:15:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-19 21:15:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (97), 13 states have call predecessors, (97), 12 states have return successors, (96), 22 states have call predecessors, (96), 22 states have call successors, (96) Word has length 209 [2024-11-19 21:15:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:49,371 INFO L225 Difference]: With dead ends: 473 [2024-11-19 21:15:49,371 INFO L226 Difference]: Without dead ends: 464 [2024-11-19 21:15:49,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 21:15:49,372 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 155 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:49,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 242 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 21:15:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-19 21:15:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 440. [2024-11-19 21:15:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 300 states have (on average 1.0833333333333333) internal successors, (325), 302 states have internal predecessors, (325), 71 states have call successors, (71), 68 states have call predecessors, (71), 68 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-19 21:15:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 465 transitions. [2024-11-19 21:15:49,431 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 465 transitions. Word has length 209 [2024-11-19 21:15:49,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:49,433 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 465 transitions. [2024-11-19 21:15:49,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (97), 13 states have call predecessors, (97), 12 states have return successors, (96), 22 states have call predecessors, (96), 22 states have call successors, (96) [2024-11-19 21:15:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 465 transitions. [2024-11-19 21:15:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-11-19 21:15:49,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:49,438 INFO L215 NwaCegarLoop]: trace histogram [67, 66, 66, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:49,444 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-19 21:15:49,640 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,SelfDestructingSolverStorable14 [2024-11-19 21:15:49,641 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:49,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:49,641 INFO L85 PathProgramCache]: Analyzing trace with hash -767722162, now seen corresponding path program 4 times [2024-11-19 21:15:49,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:49,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909463460] [2024-11-19 21:15:49,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:49,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:15:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:15:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:15:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 21:15:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:15:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:15:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:15:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-19 21:15:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:15:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:15:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:15:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:15:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:15:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:15:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:15:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:15:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:15:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:15:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-19 21:15:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-19 21:15:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-19 21:15:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-19 21:15:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-19 21:15:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-19 21:15:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-19 21:15:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-19 21:15:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-19 21:15:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-19 21:15:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-19 21:15:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-19 21:15:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-19 21:15:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-19 21:15:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-19 21:15:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-19 21:15:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-19 21:15:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-19 21:15:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-19 21:15:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-19 21:15:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-19 21:15:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-19 21:15:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-19 21:15:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-19 21:15:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-19 21:15:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-19 21:15:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-19 21:15:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-19 21:15:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-19 21:15:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-19 21:15:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-19 21:15:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-11-19 21:15:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-19 21:15:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-11-19 21:15:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-11-19 21:15:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-19 21:15:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-19 21:15:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-19 21:15:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-19 21:15:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-19 21:15:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-19 21:15:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-19 21:15:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-19 21:15:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-11-19 21:15:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-19 21:15:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-11-19 21:15:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2024-11-19 21:15:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-11-19 21:15:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-19 21:15:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-11-19 21:15:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2024-11-19 21:15:50,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:50,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909463460] [2024-11-19 21:15:50,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909463460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:15:50,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466822350] [2024-11-19 21:15:50,891 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 21:15:50,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:50,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:50,893 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-19 21:15:50,894 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-19 21:15:51,027 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 21:15:51,028 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:15:51,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 21:15:51,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:15:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 9977 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-19 21:15:51,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:15:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2024-11-19 21:15:52,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466822350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:15:52,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:15:52,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 26] total 50 [2024-11-19 21:15:52,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095319949] [2024-11-19 21:15:52,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:15:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 21:15:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:15:52,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 21:15:52,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 21:15:52,151 INFO L87 Difference]: Start difference. First operand 440 states and 465 transitions. Second operand has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (205), 25 states have call predecessors, (205), 24 states have return successors, (204), 46 states have call predecessors, (204), 46 states have call successors, (204) [2024-11-19 21:15:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:15:53,549 INFO L93 Difference]: Finished difference Result 953 states and 1050 transitions. [2024-11-19 21:15:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-11-19 21:15:53,549 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (205), 25 states have call predecessors, (205), 24 states have return successors, (204), 46 states have call predecessors, (204), 46 states have call successors, (204) Word has length 437 [2024-11-19 21:15:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:15:53,553 INFO L225 Difference]: With dead ends: 953 [2024-11-19 21:15:53,553 INFO L226 Difference]: Without dead ends: 944 [2024-11-19 21:15:53,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1078 GetRequests, 985 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2024-11-19 21:15:53,555 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 441 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:15:53,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 354 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 21:15:53,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-19 21:15:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 896. [2024-11-19 21:15:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 612 states have (on average 1.0800653594771241) internal successors, (661), 614 states have internal predecessors, (661), 143 states have call successors, (143), 140 states have call predecessors, (143), 140 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2024-11-19 21:15:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 945 transitions. [2024-11-19 21:15:53,665 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 945 transitions. Word has length 437 [2024-11-19 21:15:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:15:53,666 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 945 transitions. [2024-11-19 21:15:53,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (205), 25 states have call predecessors, (205), 24 states have return successors, (204), 46 states have call predecessors, (204), 46 states have call successors, (204) [2024-11-19 21:15:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 945 transitions. [2024-11-19 21:15:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2024-11-19 21:15:53,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:15:53,685 INFO L215 NwaCegarLoop]: trace histogram [139, 138, 138, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:15:53,692 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-19 21:15:53,885 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,SelfDestructingSolverStorable15 [2024-11-19 21:15:53,886 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:15:53,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:15:53,886 INFO L85 PathProgramCache]: Analyzing trace with hash -776415410, now seen corresponding path program 5 times [2024-11-19 21:15:53,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:15:53,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488695807] [2024-11-19 21:15:53,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:15:53,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:15:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:15:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:15:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:15:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 21:15:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:15:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:15:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:15:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-19 21:15:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:15:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:15:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:15:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:15:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:15:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:15:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:15:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:15:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:15:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:15:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-19 21:15:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-19 21:15:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-19 21:15:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-19 21:15:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-19 21:15:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-19 21:15:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-19 21:15:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-19 21:15:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-19 21:15:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-19 21:15:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-19 21:15:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-19 21:15:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-19 21:15:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-19 21:15:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-19 21:15:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-19 21:15:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-19 21:15:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-19 21:15:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-19 21:15:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-19 21:15:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-19 21:15:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-19 21:15:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-19 21:15:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-19 21:15:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-19 21:15:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-19 21:15:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-19 21:15:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-19 21:15:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-19 21:15:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-19 21:15:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-19 21:15:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-11-19 21:15:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-19 21:15:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-11-19 21:15:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-11-19 21:15:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-19 21:15:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-19 21:15:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-19 21:15:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-19 21:15:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-19 21:15:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-19 21:15:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-19 21:15:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-19 21:15:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-11-19 21:15:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-19 21:15:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-11-19 21:15:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2024-11-19 21:15:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-11-19 21:15:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-19 21:15:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-11-19 21:15:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-19 21:15:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2024-11-19 21:15:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2024-11-19 21:15:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2024-11-19 21:15:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2024-11-19 21:15:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2024-11-19 21:15:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2024-11-19 21:15:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 476 [2024-11-19 21:15:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 481 [2024-11-19 21:15:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 490 [2024-11-19 21:15:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 495 [2024-11-19 21:15:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2024-11-19 21:15:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2024-11-19 21:15:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2024-11-19 21:15:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 519 [2024-11-19 21:15:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2024-11-19 21:15:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-11-19 21:15:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 538 [2024-11-19 21:15:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-11-19 21:15:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-11-19 21:15:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2024-11-19 21:15:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 566 [2024-11-19 21:15:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 571 [2024-11-19 21:15:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-19 21:15:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 585 [2024-11-19 21:15:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2024-11-19 21:15:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 595 [2024-11-19 21:15:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 604 [2024-11-19 21:15:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 609 [2024-11-19 21:15:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 614 [2024-11-19 21:15:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2024-11-19 21:15:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2024-11-19 21:15:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 633 [2024-11-19 21:15:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 642 [2024-11-19 21:15:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2024-11-19 21:15:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 652 [2024-11-19 21:15:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 661 [2024-11-19 21:15:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 666 [2024-11-19 21:15:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 671 [2024-11-19 21:15:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 680 [2024-11-19 21:15:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 685 [2024-11-19 21:15:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 690 [2024-11-19 21:15:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 699 [2024-11-19 21:15:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 704 [2024-11-19 21:15:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 709 [2024-11-19 21:15:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 718 [2024-11-19 21:15:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 723 [2024-11-19 21:15:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 728 [2024-11-19 21:15:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 737 [2024-11-19 21:15:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 742 [2024-11-19 21:15:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 747 [2024-11-19 21:15:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2024-11-19 21:15:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 761 [2024-11-19 21:15:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 766 [2024-11-19 21:15:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 775 [2024-11-19 21:15:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 780 [2024-11-19 21:15:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 785 [2024-11-19 21:15:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 794 [2024-11-19 21:15:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 799 [2024-11-19 21:15:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 804 [2024-11-19 21:15:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 813 [2024-11-19 21:15:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 818 [2024-11-19 21:15:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 823 [2024-11-19 21:15:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 832 [2024-11-19 21:15:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 837 [2024-11-19 21:15:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 842 [2024-11-19 21:15:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 851 [2024-11-19 21:15:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 856 [2024-11-19 21:15:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 861 [2024-11-19 21:15:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 870 [2024-11-19 21:15:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 875 [2024-11-19 21:15:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 880 [2024-11-19 21:15:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:15:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2024-11-19 21:15:57,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:15:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488695807] [2024-11-19 21:15:57,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488695807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:15:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355925896] [2024-11-19 21:15:57,583 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 21:15:57,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:15:57,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:15:57,585 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-19 21:15:57,587 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-19 21:16:50,829 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2024-11-19 21:16:50,829 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:16:50,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-19 21:16:50,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:16:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 44597 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-19 21:16:51,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:16:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2024-11-19 21:16:52,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355925896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:16:52,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:16:52,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 50] total 54 [2024-11-19 21:16:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560436685] [2024-11-19 21:16:52,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:16:52,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-19 21:16:52,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:16:52,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-19 21:16:52,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2024-11-19 21:16:52,885 INFO L87 Difference]: Start difference. First operand 896 states and 945 transitions. Second operand has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (292), 49 states have call predecessors, (292), 48 states have return successors, (291), 50 states have call predecessors, (291), 50 states have call successors, (291) [2024-11-19 21:16:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:16:54,441 INFO L93 Difference]: Finished difference Result 989 states and 1050 transitions. [2024-11-19 21:16:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-19 21:16:54,442 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (292), 49 states have call predecessors, (292), 48 states have return successors, (291), 50 states have call predecessors, (291), 50 states have call successors, (291) Word has length 893 [2024-11-19 21:16:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:16:54,448 INFO L225 Difference]: With dead ends: 989 [2024-11-19 21:16:54,449 INFO L226 Difference]: Without dead ends: 980 [2024-11-19 21:16:54,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2162 GetRequests, 2017 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2024-11-19 21:16:54,451 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 183 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:16:54,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 384 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 21:16:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2024-11-19 21:16:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 972. [2024-11-19 21:16:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 664 states have (on average 1.0798192771084338) internal successors, (717), 666 states have internal predecessors, (717), 155 states have call successors, (155), 152 states have call predecessors, (155), 152 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-19 21:16:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1025 transitions. [2024-11-19 21:16:54,564 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1025 transitions. Word has length 893 [2024-11-19 21:16:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:16:54,566 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1025 transitions. [2024-11-19 21:16:54,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (292), 49 states have call predecessors, (292), 48 states have return successors, (291), 50 states have call predecessors, (291), 50 states have call successors, (291) [2024-11-19 21:16:54,567 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1025 transitions. [2024-11-19 21:16:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2024-11-19 21:16:54,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:16:54,572 INFO L215 NwaCegarLoop]: trace histogram [151, 150, 150, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:16:54,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-19 21:16:54,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:16:54,772 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:16:54,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:16:54,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1208919630, now seen corresponding path program 6 times [2024-11-19 21:16:54,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:16:54,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152579212] [2024-11-19 21:16:54,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:16:54,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:16:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:16:55,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006965848] [2024-11-19 21:16:55,068 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 21:16:55,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:16:55,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:16:55,070 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-19 21:16:55,071 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-19 21:16:59,625 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2024-11-19 21:16:59,626 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 21:16:59,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 21:16:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 21:17:00,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 21:17:00,008 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 21:17:00,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 21:17:00,026 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-19 21:17:00,211 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,SelfDestructingSolverStorable17 [2024-11-19 21:17:00,214 INFO L407 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:17:00,359 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 21:17:00,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:17:00 BoogieIcfgContainer [2024-11-19 21:17:00,365 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 21:17:00,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 21:17:00,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 21:17:00,366 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 21:17:00,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:39" (3/4) ... [2024-11-19 21:17:00,367 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 21:17:00,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 21:17:00,495 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 21:17:00,496 INFO L158 Benchmark]: Toolchain (without parser) took 81901.03ms. Allocated memory was 159.4MB in the beginning and 731.9MB in the end (delta: 572.5MB). Free memory was 87.4MB in the beginning and 477.3MB in the end (delta: -390.0MB). Peak memory consumption was 185.2MB. Max. memory is 16.1GB. [2024-11-19 21:17:00,496 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 21:17:00,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.03ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 74.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 21:17:00,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.71ms. Allocated memory is still 159.4MB. Free memory was 74.3MB in the beginning and 72.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 21:17:00,497 INFO L158 Benchmark]: Boogie Preprocessor took 34.70ms. Allocated memory is still 159.4MB. Free memory was 72.9MB in the beginning and 71.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 21:17:00,497 INFO L158 Benchmark]: RCFGBuilder took 312.10ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 71.1MB in the beginning and 177.6MB in the end (delta: -106.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-19 21:17:00,497 INFO L158 Benchmark]: TraceAbstraction took 81166.81ms. Allocated memory was 207.6MB in the beginning and 731.9MB in the end (delta: 524.3MB). Free memory was 176.7MB in the beginning and 509.9MB in the end (delta: -333.1MB). Peak memory consumption was 191.2MB. Max. memory is 16.1GB. [2024-11-19 21:17:00,497 INFO L158 Benchmark]: Witness Printer took 129.65ms. Allocated memory is still 731.9MB. Free memory was 509.9MB in the beginning and 477.3MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-19 21:17:00,500 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.16ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.03ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 74.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.71ms. Allocated memory is still 159.4MB. Free memory was 74.3MB in the beginning and 72.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.70ms. Allocated memory is still 159.4MB. Free memory was 72.9MB in the beginning and 71.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 312.10ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 71.1MB in the beginning and 177.6MB in the end (delta: -106.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 81166.81ms. Allocated memory was 207.6MB in the beginning and 731.9MB in the end (delta: 524.3MB). Free memory was 176.7MB in the beginning and 509.9MB in the end (delta: -333.1MB). Peak memory consumption was 191.2MB. Max. memory is 16.1GB. * Witness Printer took 129.65ms. Allocated memory is still 731.9MB. Free memory was 509.9MB in the beginning and 477.3MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=52, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=52, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=52, b=1, counter=0, p=1, q=0, r=0, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=51, b=1, counter=1, p=1, q=0, r=-1, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=50, b=1, counter=2, p=1, q=0, r=-2, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=49, b=1, counter=3, p=1, q=0, r=-3, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=48, b=1, counter=4, p=1, q=0, r=-4, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=47, b=1, counter=5, p=1, q=0, r=-5, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=46, b=1, counter=6, p=1, q=0, r=-6, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=45, b=1, counter=7, p=1, q=0, r=-7, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=44, b=1, counter=8, p=1, q=0, r=-8, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=43, b=1, counter=9, p=1, q=0, r=-9, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=42, b=1, counter=10, p=1, q=0, r=-10, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=41, b=1, counter=11, p=1, q=0, r=-11, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=40, b=1, counter=12, p=1, q=0, r=-12, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=39, b=1, counter=13, p=1, q=0, r=-13, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=38, b=1, counter=14, p=1, q=0, r=-14, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=37, b=1, counter=15, p=1, q=0, r=-15, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=36, b=1, counter=16, p=1, q=0, r=-16, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=35, b=1, counter=17, p=1, q=0, r=-17, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=34, b=1, counter=18, p=1, q=0, r=-18, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=33, b=1, counter=19, p=1, q=0, r=-19, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=32, b=1, counter=20, p=1, q=0, r=-20, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=31, b=1, counter=21, p=1, q=0, r=-21, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=30, b=1, counter=22, p=1, q=0, r=-22, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=29, b=1, counter=23, p=1, q=0, r=-23, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=28, b=1, counter=24, p=1, q=0, r=-24, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=27, b=1, counter=25, p=1, q=0, r=-25, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=26, b=1, counter=26, p=1, q=0, r=-26, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=25, b=1, counter=27, p=1, q=0, r=-27, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=24, b=1, counter=28, p=1, q=0, r=-28, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=23, b=1, counter=29, p=1, q=0, r=-29, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=22, b=1, counter=30, p=1, q=0, r=-30, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=21, b=1, counter=31, p=1, q=0, r=-31, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=20, b=1, counter=32, p=1, q=0, r=-32, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=19, b=1, counter=33, p=1, q=0, r=-33, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=18, b=1, counter=34, p=1, q=0, r=-34, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=17, b=1, counter=35, p=1, q=0, r=-35, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=16, b=1, counter=36, p=1, q=0, r=-36, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=15, b=1, counter=37, p=1, q=0, r=-37, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=14, b=1, counter=38, p=1, q=0, r=-38, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=13, b=1, counter=39, p=1, q=0, r=-39, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=12, b=1, counter=40, p=1, q=0, r=-40, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=1, counter=41, p=1, q=0, r=-41, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=10, b=1, counter=42, p=1, q=0, r=-42, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=1, counter=43, p=1, q=0, r=-43, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=8, b=1, counter=44, p=1, q=0, r=-44, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=1, counter=45, p=1, q=0, r=-45, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=6, b=1, counter=46, p=1, q=0, r=-46, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=1, counter=47, p=1, q=0, r=-47, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=4, b=1, counter=48, p=1, q=0, r=-48, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=1, counter=49, p=1, q=0, r=-49, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=2, b=1, counter=50, p=1, q=0, r=-50, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=2, b=1, counter=51, p=1, q=0, r=-50, s=1, x=52, y=1] [L34] COND FALSE !(counter++<50) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 81.0s, OverallIterations: 18, TraceHistogramMax: 151, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1082 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1051 mSDsluCounter, 3144 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2605 mSDsCounter, 350 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2148 IncrementalHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 350 mSolverCounterUnsat, 539 mSDtfsCounter, 2148 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4732 GetRequests, 4308 SyntacticMatches, 46 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4227 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred in iteration=17, InterpolantAutomatonStates: 364, 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, 17 MinimizatonAttempts, 303 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 58.5s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 6068 NumberOfCodeBlocks, 6053 NumberOfCodeBlocksAsserted, 241 NumberOfCheckSat, 5718 ConstructedInterpolants, 0 QuantifiedInterpolants, 13658 SizeOfPredicates, 104 NumberOfNonLiveVariables, 4657 ConjunctsInSsa, 351 ConjunctsInUnsatCore, 33 InterpolantComputations, 8 PerfectInterpolantSequences, 100119/175782 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-19 21:17:00,536 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