/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 14:43:21,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 14:43:21,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 14:43:21,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 14:43:21,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 14:43:21,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 14:43:21,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 14:43:21,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 14:43:21,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 14:43:21,543 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 14:43:21,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 14:43:21,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 14:43:21,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 14:43:21,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 14:43:21,546 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 14:43:21,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 14:43:21,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 14:43:21,547 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 14:43:21,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 14:43:21,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 14:43:21,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 14:43:21,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 14:43:21,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 14:43:21,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 14:43:21,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 14:43:21,548 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 14:43:21,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 14:43:21,549 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 14:43:21,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 14:43:21,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 14:43:21,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 14:43:21,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 14:43:21,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 14:43:21,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 14:43:21,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 14:43:21,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 14:43:21,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 14:43:21,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 14:43:21,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 14:43:21,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 14:43:21,551 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 14:43:21,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 14:43:21,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 14:43:21,552 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 14:43:21,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 14:43:21,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 14:43:21,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 14:43:21,768 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 14:43:21,768 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 14:43:21,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2023-12-20 14:43:22,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 14:43:23,159 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 14:43:23,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2023-12-20 14:43:23,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2087f5e/fb1a8a9df1814de09bde814b5c570ce8/FLAGf5e60ba15 [2023-12-20 14:43:23,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2087f5e/fb1a8a9df1814de09bde814b5c570ce8 [2023-12-20 14:43:23,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 14:43:23,192 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 14:43:23,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 14:43:23,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 14:43:23,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 14:43:23,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327dbd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23, skipping insertion in model container [2023-12-20 14:43:23,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,242 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 14:43:23,347 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2023-12-20 14:43:23,373 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2023-12-20 14:43:23,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 14:43:23,420 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 14:43:23,434 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2023-12-20 14:43:23,448 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2023-12-20 14:43:23,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 14:43:23,475 INFO L206 MainTranslator]: Completed translation [2023-12-20 14:43:23,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23 WrapperNode [2023-12-20 14:43:23,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 14:43:23,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 14:43:23,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 14:43:23,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 14:43:23,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,510 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 483 [2023-12-20 14:43:23,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 14:43:23,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 14:43:23,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 14:43:23,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 14:43:23,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,543 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 14:43:23,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 14:43:23,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 14:43:23,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 14:43:23,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 14:43:23,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (1/1) ... [2023-12-20 14:43:23,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 14:43:23,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:23,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 14:43:23,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 14:43:23,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 14:43:23,672 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-20 14:43:23,672 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-20 14:43:23,673 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-12-20 14:43:23,673 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-12-20 14:43:23,674 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-20 14:43:23,674 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-20 14:43:23,674 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-20 14:43:23,674 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-20 14:43:23,674 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-20 14:43:23,674 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-20 14:43:23,674 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-20 14:43:23,675 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-20 14:43:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-20 14:43:23,675 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-20 14:43:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 14:43:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-20 14:43:23,675 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-20 14:43:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 14:43:23,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 14:43:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-20 14:43:23,675 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-20 14:43:23,774 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 14:43:23,776 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 14:43:24,203 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 14:43:24,236 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 14:43:24,236 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-20 14:43:24,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 02:43:24 BoogieIcfgContainer [2023-12-20 14:43:24,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 14:43:24,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 14:43:24,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 14:43:24,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 14:43:24,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 02:43:23" (1/3) ... [2023-12-20 14:43:24,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205096b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 02:43:24, skipping insertion in model container [2023-12-20 14:43:24,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:23" (2/3) ... [2023-12-20 14:43:24,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205096b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 02:43:24, skipping insertion in model container [2023-12-20 14:43:24,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 02:43:24" (3/3) ... [2023-12-20 14:43:24,242 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2023-12-20 14:43:24,254 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 14:43:24,254 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-20 14:43:24,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 14:43:24,297 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@744ca35d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 14:43:24,298 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-20 14:43:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 147 states have (on average 1.653061224489796) internal successors, (243), 152 states have internal predecessors, (243), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-20 14:43:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-20 14:43:24,310 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:24,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:24,311 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:24,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:24,315 INFO L85 PathProgramCache]: Analyzing trace with hash -641686583, now seen corresponding path program 1 times [2023-12-20 14:43:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:24,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25068178] [2023-12-20 14:43:24,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:24,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:24,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 14:43:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:24,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:24,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25068178] [2023-12-20 14:43:24,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25068178] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:24,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:24,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 14:43:24,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451651998] [2023-12-20 14:43:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:24,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:24,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:24,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:24,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 14:43:24,656 INFO L87 Difference]: Start difference. First operand has 181 states, 147 states have (on average 1.653061224489796) internal successors, (243), 152 states have internal predecessors, (243), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 14:43:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:25,004 INFO L93 Difference]: Finished difference Result 413 states and 658 transitions. [2023-12-20 14:43:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:43:25,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2023-12-20 14:43:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:25,018 INFO L225 Difference]: With dead ends: 413 [2023-12-20 14:43:25,018 INFO L226 Difference]: Without dead ends: 239 [2023-12-20 14:43:25,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:25,023 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 316 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:25,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 366 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:43:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-12-20 14:43:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2023-12-20 14:43:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.4845360824742269) internal successors, (288), 198 states have internal predecessors, (288), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2023-12-20 14:43:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 344 transitions. [2023-12-20 14:43:25,116 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 344 transitions. Word has length 37 [2023-12-20 14:43:25,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:25,117 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 344 transitions. [2023-12-20 14:43:25,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 14:43:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 344 transitions. [2023-12-20 14:43:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-20 14:43:25,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:25,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:25,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 14:43:25,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:25,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:25,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1102259478, now seen corresponding path program 1 times [2023-12-20 14:43:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:25,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67638062] [2023-12-20 14:43:25,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:25,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-20 14:43:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:25,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:25,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67638062] [2023-12-20 14:43:25,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67638062] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:25,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:25,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 14:43:25,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901582767] [2023-12-20 14:43:25,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:25,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:25,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:25,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:25,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 14:43:25,220 INFO L87 Difference]: Start difference. First operand 233 states and 344 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 14:43:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:25,464 INFO L93 Difference]: Finished difference Result 467 states and 688 transitions. [2023-12-20 14:43:25,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:43:25,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-12-20 14:43:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:25,470 INFO L225 Difference]: With dead ends: 467 [2023-12-20 14:43:25,470 INFO L226 Difference]: Without dead ends: 356 [2023-12-20 14:43:25,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:25,473 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 329 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:25,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 357 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:43:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-12-20 14:43:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 333. [2023-12-20 14:43:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 281 states have (on average 1.4448398576512456) internal successors, (406), 286 states have internal predecessors, (406), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2023-12-20 14:43:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 484 transitions. [2023-12-20 14:43:25,513 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 484 transitions. Word has length 38 [2023-12-20 14:43:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:25,513 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 484 transitions. [2023-12-20 14:43:25,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 14:43:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 484 transitions. [2023-12-20 14:43:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-20 14:43:25,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:25,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:25,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 14:43:25,518 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:25,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:25,518 INFO L85 PathProgramCache]: Analyzing trace with hash -45404508, now seen corresponding path program 1 times [2023-12-20 14:43:25,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:25,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686717322] [2023-12-20 14:43:25,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:25,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 14:43:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:25,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:25,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686717322] [2023-12-20 14:43:25,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686717322] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:25,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:25,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 14:43:25,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477711513] [2023-12-20 14:43:25,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:25,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:25,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:25,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:25,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 14:43:25,595 INFO L87 Difference]: Start difference. First operand 333 states and 484 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 14:43:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:25,903 INFO L93 Difference]: Finished difference Result 753 states and 1065 transitions. [2023-12-20 14:43:25,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:43:25,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2023-12-20 14:43:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:25,907 INFO L225 Difference]: With dead ends: 753 [2023-12-20 14:43:25,907 INFO L226 Difference]: Without dead ends: 542 [2023-12-20 14:43:25,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:25,909 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 156 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:25,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 477 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:43:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2023-12-20 14:43:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 438. [2023-12-20 14:43:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 374 states have (on average 1.4304812834224598) internal successors, (535), 381 states have internal predecessors, (535), 40 states have call successors, (40), 21 states have call predecessors, (40), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2023-12-20 14:43:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 625 transitions. [2023-12-20 14:43:25,964 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 625 transitions. Word has length 39 [2023-12-20 14:43:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:25,965 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 625 transitions. [2023-12-20 14:43:25,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 14:43:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 625 transitions. [2023-12-20 14:43:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-20 14:43:25,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:25,966 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:25,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 14:43:25,966 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:25,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:25,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1197660736, now seen corresponding path program 1 times [2023-12-20 14:43:25,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:25,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393532067] [2023-12-20 14:43:25,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:25,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-20 14:43:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 14:43:26,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:26,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393532067] [2023-12-20 14:43:26,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393532067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:26,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:26,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 14:43:26,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794873510] [2023-12-20 14:43:26,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:26,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:26,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:26,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:26,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 14:43:26,031 INFO L87 Difference]: Start difference. First operand 438 states and 625 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-20 14:43:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:26,361 INFO L93 Difference]: Finished difference Result 954 states and 1342 transitions. [2023-12-20 14:43:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:43:26,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2023-12-20 14:43:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:26,364 INFO L225 Difference]: With dead ends: 954 [2023-12-20 14:43:26,364 INFO L226 Difference]: Without dead ends: 638 [2023-12-20 14:43:26,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:26,370 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 141 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:26,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 521 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:43:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2023-12-20 14:43:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 604. [2023-12-20 14:43:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 516 states have (on average 1.377906976744186) internal successors, (711), 525 states have internal predecessors, (711), 54 states have call successors, (54), 29 states have call predecessors, (54), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) [2023-12-20 14:43:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 839 transitions. [2023-12-20 14:43:26,399 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 839 transitions. Word has length 54 [2023-12-20 14:43:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:26,400 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 839 transitions. [2023-12-20 14:43:26,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-20 14:43:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 839 transitions. [2023-12-20 14:43:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-20 14:43:26,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:26,402 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:26,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 14:43:26,402 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:26,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:26,403 INFO L85 PathProgramCache]: Analyzing trace with hash 119218933, now seen corresponding path program 1 times [2023-12-20 14:43:26,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:26,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728340421] [2023-12-20 14:43:26,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:26,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:43:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 14:43:26,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:26,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728340421] [2023-12-20 14:43:26,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728340421] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:26,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:26,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 14:43:26,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400983261] [2023-12-20 14:43:26,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:26,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:26,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:26,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:26,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 14:43:26,479 INFO L87 Difference]: Start difference. First operand 604 states and 839 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-20 14:43:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:26,622 INFO L93 Difference]: Finished difference Result 1183 states and 1618 transitions. [2023-12-20 14:43:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:43:26,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 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 59 [2023-12-20 14:43:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:26,627 INFO L225 Difference]: With dead ends: 1183 [2023-12-20 14:43:26,627 INFO L226 Difference]: Without dead ends: 781 [2023-12-20 14:43:26,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:26,628 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 315 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:26,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 369 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2023-12-20 14:43:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 732. [2023-12-20 14:43:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 628 states have (on average 1.3471337579617835) internal successors, (846), 639 states have internal predecessors, (846), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) [2023-12-20 14:43:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 996 transitions. [2023-12-20 14:43:26,664 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 996 transitions. Word has length 59 [2023-12-20 14:43:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:26,665 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 996 transitions. [2023-12-20 14:43:26,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-20 14:43:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 996 transitions. [2023-12-20 14:43:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 14:43:26,667 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:26,667 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:26,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 14:43:26,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:26,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash 157658772, now seen corresponding path program 1 times [2023-12-20 14:43:26,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:26,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339761658] [2023-12-20 14:43:26,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:26,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 14:43:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 14:43:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 14:43:26,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:26,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339761658] [2023-12-20 14:43:26,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339761658] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:26,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:26,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 14:43:26,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208213248] [2023-12-20 14:43:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:26,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:43:26,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:26,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:43:26,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:26,764 INFO L87 Difference]: Start difference. First operand 732 states and 996 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-20 14:43:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:26,954 INFO L93 Difference]: Finished difference Result 1218 states and 1658 transitions. [2023-12-20 14:43:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 14:43:26,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2023-12-20 14:43:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:26,957 INFO L225 Difference]: With dead ends: 1218 [2023-12-20 14:43:26,957 INFO L226 Difference]: Without dead ends: 680 [2023-12-20 14:43:26,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:26,959 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 93 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:26,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 607 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2023-12-20 14:43:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 607. [2023-12-20 14:43:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 520 states have (on average 1.3442307692307693) internal successors, (699), 530 states have internal predecessors, (699), 52 states have call successors, (52), 29 states have call predecessors, (52), 33 states have return successors, (70), 48 states have call predecessors, (70), 50 states have call successors, (70) [2023-12-20 14:43:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 821 transitions. [2023-12-20 14:43:26,986 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 821 transitions. Word has length 60 [2023-12-20 14:43:26,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:26,987 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 821 transitions. [2023-12-20 14:43:26,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-20 14:43:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 821 transitions. [2023-12-20 14:43:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 14:43:26,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:26,989 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:26,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 14:43:26,989 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:26,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1955298388, now seen corresponding path program 1 times [2023-12-20 14:43:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:26,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489297552] [2023-12-20 14:43:26,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 14:43:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 14:43:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 14:43:27,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:27,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489297552] [2023-12-20 14:43:27,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489297552] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:27,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591065833] [2023-12-20 14:43:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:27,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:27,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:27,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:27,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 14:43:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 14:43:27,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:27,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 14:43:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 14:43:27,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591065833] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:27,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-20 14:43:27,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2023-12-20 14:43:27,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146313853] [2023-12-20 14:43:27,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:27,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:27,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:27,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:27,271 INFO L87 Difference]: Start difference. First operand 607 states and 821 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-20 14:43:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:27,378 INFO L93 Difference]: Finished difference Result 656 states and 882 transitions. [2023-12-20 14:43:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 14:43:27,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2023-12-20 14:43:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:27,381 INFO L225 Difference]: With dead ends: 656 [2023-12-20 14:43:27,381 INFO L226 Difference]: Without dead ends: 653 [2023-12-20 14:43:27,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-20 14:43:27,382 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 440 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:27,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 311 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2023-12-20 14:43:27,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 606. [2023-12-20 14:43:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 520 states have (on average 1.3403846153846153) internal successors, (697), 529 states have internal predecessors, (697), 51 states have call successors, (51), 29 states have call predecessors, (51), 33 states have return successors, (70), 48 states have call predecessors, (70), 50 states have call successors, (70) [2023-12-20 14:43:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 818 transitions. [2023-12-20 14:43:27,408 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 818 transitions. Word has length 60 [2023-12-20 14:43:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:27,409 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 818 transitions. [2023-12-20 14:43:27,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-20 14:43:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 818 transitions. [2023-12-20 14:43:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:43:27,410 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:27,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:27,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 14:43:27,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:27,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:27,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1127040550, now seen corresponding path program 1 times [2023-12-20 14:43:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:27,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361563778] [2023-12-20 14:43:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:27,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:27,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:27,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361563778] [2023-12-20 14:43:27,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361563778] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:27,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:27,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 14:43:27,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560479294] [2023-12-20 14:43:27,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:27,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 14:43:27,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:27,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 14:43:27,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:27,688 INFO L87 Difference]: Start difference. First operand 606 states and 818 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:28,373 INFO L93 Difference]: Finished difference Result 881 states and 1244 transitions. [2023-12-20 14:43:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 14:43:28,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-20 14:43:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:28,377 INFO L225 Difference]: With dead ends: 881 [2023-12-20 14:43:28,377 INFO L226 Difference]: Without dead ends: 773 [2023-12-20 14:43:28,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-20 14:43:28,378 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 518 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:28,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 531 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 14:43:28,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-12-20 14:43:28,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 714. [2023-12-20 14:43:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 610 states have (on average 1.3688524590163935) internal successors, (835), 620 states have internal predecessors, (835), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (84), 59 states have call predecessors, (84), 61 states have call successors, (84) [2023-12-20 14:43:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 981 transitions. [2023-12-20 14:43:28,417 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 981 transitions. Word has length 61 [2023-12-20 14:43:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:28,417 INFO L495 AbstractCegarLoop]: Abstraction has 714 states and 981 transitions. [2023-12-20 14:43:28,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 981 transitions. [2023-12-20 14:43:28,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:43:28,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:28,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:28,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 14:43:28,419 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:28,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1159478042, now seen corresponding path program 1 times [2023-12-20 14:43:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:28,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667381745] [2023-12-20 14:43:28,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:28,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:28,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:28,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667381745] [2023-12-20 14:43:28,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667381745] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:28,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:28,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:43:28,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633461590] [2023-12-20 14:43:28,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:28,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:43:28,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:28,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:43:28,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:28,503 INFO L87 Difference]: Start difference. First operand 714 states and 981 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:29,402 INFO L93 Difference]: Finished difference Result 1126 states and 1610 transitions. [2023-12-20 14:43:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 14:43:29,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-20 14:43:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:29,405 INFO L225 Difference]: With dead ends: 1126 [2023-12-20 14:43:29,405 INFO L226 Difference]: Without dead ends: 910 [2023-12-20 14:43:29,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-20 14:43:29,406 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 523 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:29,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 870 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-20 14:43:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2023-12-20 14:43:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 815. [2023-12-20 14:43:29,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 693 states have (on average 1.3838383838383839) internal successors, (959), 704 states have internal predecessors, (959), 73 states have call successors, (73), 41 states have call predecessors, (73), 47 states have return successors, (97), 71 states have call predecessors, (97), 72 states have call successors, (97) [2023-12-20 14:43:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1129 transitions. [2023-12-20 14:43:29,443 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1129 transitions. Word has length 61 [2023-12-20 14:43:29,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:29,443 INFO L495 AbstractCegarLoop]: Abstraction has 815 states and 1129 transitions. [2023-12-20 14:43:29,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1129 transitions. [2023-12-20 14:43:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:43:29,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:29,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:29,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 14:43:29,445 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:29,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:29,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1174996760, now seen corresponding path program 1 times [2023-12-20 14:43:29,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:29,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458785934] [2023-12-20 14:43:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:29,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:29,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:29,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458785934] [2023-12-20 14:43:29,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458785934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:29,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:29,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:43:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674960798] [2023-12-20 14:43:29,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:29,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:43:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:29,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:43:29,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:29,565 INFO L87 Difference]: Start difference. First operand 815 states and 1129 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:30,574 INFO L93 Difference]: Finished difference Result 1547 states and 2242 transitions. [2023-12-20 14:43:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 14:43:30,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-20 14:43:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:30,578 INFO L225 Difference]: With dead ends: 1547 [2023-12-20 14:43:30,579 INFO L226 Difference]: Without dead ends: 1230 [2023-12-20 14:43:30,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-20 14:43:30,581 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 537 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:30,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 861 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 14:43:30,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2023-12-20 14:43:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1017. [2023-12-20 14:43:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 861 states have (on average 1.4076655052264808) internal successors, (1212), 874 states have internal predecessors, (1212), 93 states have call successors, (93), 53 states have call predecessors, (93), 61 states have return successors, (125), 93 states have call predecessors, (125), 92 states have call successors, (125) [2023-12-20 14:43:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1430 transitions. [2023-12-20 14:43:30,632 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1430 transitions. Word has length 61 [2023-12-20 14:43:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:30,632 INFO L495 AbstractCegarLoop]: Abstraction has 1017 states and 1430 transitions. [2023-12-20 14:43:30,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1430 transitions. [2023-12-20 14:43:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:43:30,634 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:30,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:30,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 14:43:30,635 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:30,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1528085142, now seen corresponding path program 1 times [2023-12-20 14:43:30,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:30,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043154894] [2023-12-20 14:43:30,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:30,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:30,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043154894] [2023-12-20 14:43:30,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043154894] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:30,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:30,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:43:30,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082931222] [2023-12-20 14:43:30,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:30,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:43:30,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:30,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:43:30,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:30,735 INFO L87 Difference]: Start difference. First operand 1017 states and 1430 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:31,510 INFO L93 Difference]: Finished difference Result 2251 states and 3293 transitions. [2023-12-20 14:43:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 14:43:31,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-20 14:43:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:31,517 INFO L225 Difference]: With dead ends: 2251 [2023-12-20 14:43:31,517 INFO L226 Difference]: Without dead ends: 1732 [2023-12-20 14:43:31,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-20 14:43:31,519 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 564 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:31,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 857 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 14:43:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2023-12-20 14:43:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1398. [2023-12-20 14:43:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1176 states have (on average 1.4319727891156462) internal successors, (1684), 1193 states have internal predecessors, (1684), 131 states have call successors, (131), 77 states have call predecessors, (131), 89 states have return successors, (185), 135 states have call predecessors, (185), 130 states have call successors, (185) [2023-12-20 14:43:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2000 transitions. [2023-12-20 14:43:31,582 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2000 transitions. Word has length 61 [2023-12-20 14:43:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:31,582 INFO L495 AbstractCegarLoop]: Abstraction has 1398 states and 2000 transitions. [2023-12-20 14:43:31,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2000 transitions. [2023-12-20 14:43:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:43:31,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:31,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:31,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 14:43:31,587 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:31,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash 400187560, now seen corresponding path program 1 times [2023-12-20 14:43:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:31,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749863128] [2023-12-20 14:43:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:31,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:31,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:31,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749863128] [2023-12-20 14:43:31,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749863128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:31,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:31,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:43:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682735840] [2023-12-20 14:43:31,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:31,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:43:31,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:31,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:43:31,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:31,675 INFO L87 Difference]: Start difference. First operand 1398 states and 2000 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:32,155 INFO L93 Difference]: Finished difference Result 2511 states and 3698 transitions. [2023-12-20 14:43:32,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 14:43:32,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-20 14:43:32,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:32,160 INFO L225 Difference]: With dead ends: 2511 [2023-12-20 14:43:32,161 INFO L226 Difference]: Without dead ends: 1611 [2023-12-20 14:43:32,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-20 14:43:32,163 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 497 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:32,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 444 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:43:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2023-12-20 14:43:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1398. [2023-12-20 14:43:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1176 states have (on average 1.4243197278911566) internal successors, (1675), 1193 states have internal predecessors, (1675), 131 states have call successors, (131), 77 states have call predecessors, (131), 89 states have return successors, (185), 135 states have call predecessors, (185), 130 states have call successors, (185) [2023-12-20 14:43:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1991 transitions. [2023-12-20 14:43:32,255 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1991 transitions. Word has length 61 [2023-12-20 14:43:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:32,256 INFO L495 AbstractCegarLoop]: Abstraction has 1398 states and 1991 transitions. [2023-12-20 14:43:32,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1991 transitions. [2023-12-20 14:43:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:43:32,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:32,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:32,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-20 14:43:32,258 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:32,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:32,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1293673898, now seen corresponding path program 1 times [2023-12-20 14:43:32,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:32,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409573617] [2023-12-20 14:43:32,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:32,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:32,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409573617] [2023-12-20 14:43:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409573617] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:32,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:32,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 14:43:32,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146501415] [2023-12-20 14:43:32,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:32,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 14:43:32,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:32,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 14:43:32,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:32,340 INFO L87 Difference]: Start difference. First operand 1398 states and 1991 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:32,881 INFO L93 Difference]: Finished difference Result 2580 states and 3787 transitions. [2023-12-20 14:43:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 14:43:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-20 14:43:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:32,889 INFO L225 Difference]: With dead ends: 2580 [2023-12-20 14:43:32,889 INFO L226 Difference]: Without dead ends: 1681 [2023-12-20 14:43:32,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-20 14:43:32,892 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 217 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:32,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 616 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 14:43:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2023-12-20 14:43:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1416. [2023-12-20 14:43:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1194 states have (on average 1.417922948073702) internal successors, (1693), 1211 states have internal predecessors, (1693), 131 states have call successors, (131), 77 states have call predecessors, (131), 89 states have return successors, (185), 135 states have call predecessors, (185), 130 states have call successors, (185) [2023-12-20 14:43:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2009 transitions. [2023-12-20 14:43:32,990 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2009 transitions. Word has length 61 [2023-12-20 14:43:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:32,990 INFO L495 AbstractCegarLoop]: Abstraction has 1416 states and 2009 transitions. [2023-12-20 14:43:32,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2009 transitions. [2023-12-20 14:43:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:43:32,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:32,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:32,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 14:43:32,992 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:32,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1953205420, now seen corresponding path program 1 times [2023-12-20 14:43:32,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:32,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13649685] [2023-12-20 14:43:32,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:32,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:33,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:33,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13649685] [2023-12-20 14:43:33,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13649685] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:33,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:33,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:43:33,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523757826] [2023-12-20 14:43:33,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:33,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:43:33,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:33,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:43:33,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:33,090 INFO L87 Difference]: Start difference. First operand 1416 states and 2009 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:34,164 INFO L93 Difference]: Finished difference Result 4621 states and 6923 transitions. [2023-12-20 14:43:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 14:43:34,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-20 14:43:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:34,181 INFO L225 Difference]: With dead ends: 4621 [2023-12-20 14:43:34,181 INFO L226 Difference]: Without dead ends: 3704 [2023-12-20 14:43:34,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-12-20 14:43:34,186 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1204 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:34,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 710 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-20 14:43:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2023-12-20 14:43:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3182. [2023-12-20 14:43:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 2648 states have (on average 1.4373111782477341) internal successors, (3806), 2696 states have internal predecessors, (3806), 315 states have call successors, (315), 189 states have call predecessors, (315), 217 states have return successors, (484), 304 states have call predecessors, (484), 314 states have call successors, (484) [2023-12-20 14:43:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4605 transitions. [2023-12-20 14:43:34,364 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4605 transitions. Word has length 61 [2023-12-20 14:43:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:34,365 INFO L495 AbstractCegarLoop]: Abstraction has 3182 states and 4605 transitions. [2023-12-20 14:43:34,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4605 transitions. [2023-12-20 14:43:34,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:43:34,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:34,367 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:34,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 14:43:34,368 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:34,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash 484045592, now seen corresponding path program 1 times [2023-12-20 14:43:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:34,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340732089] [2023-12-20 14:43:34,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:34,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 14:43:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 14:43:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 14:43:34,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:34,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340732089] [2023-12-20 14:43:34,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340732089] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:34,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093339492] [2023-12-20 14:43:34,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:34,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:34,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:34,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:34,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 14:43:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-20 14:43:34,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:34,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 14:43:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 14:43:34,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093339492] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 14:43:34,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 14:43:34,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2023-12-20 14:43:34,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784996463] [2023-12-20 14:43:34,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 14:43:34,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 14:43:34,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:34,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 14:43:34,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-20 14:43:34,722 INFO L87 Difference]: Start difference. First operand 3182 states and 4605 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-20 14:43:35,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:35,526 INFO L93 Difference]: Finished difference Result 4418 states and 6257 transitions. [2023-12-20 14:43:35,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-20 14:43:35,526 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2023-12-20 14:43:35,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:35,546 INFO L225 Difference]: With dead ends: 4418 [2023-12-20 14:43:35,546 INFO L226 Difference]: Without dead ends: 4020 [2023-12-20 14:43:35,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2023-12-20 14:43:35,551 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 539 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:35,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1416 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 14:43:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2023-12-20 14:43:35,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 3511. [2023-12-20 14:43:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 2940 states have (on average 1.4217687074829932) internal successors, (4180), 2995 states have internal predecessors, (4180), 334 states have call successors, (334), 202 states have call predecessors, (334), 235 states have return successors, (515), 321 states have call predecessors, (515), 333 states have call successors, (515) [2023-12-20 14:43:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 5029 transitions. [2023-12-20 14:43:35,774 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 5029 transitions. Word has length 61 [2023-12-20 14:43:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:35,774 INFO L495 AbstractCegarLoop]: Abstraction has 3511 states and 5029 transitions. [2023-12-20 14:43:35,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-20 14:43:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 5029 transitions. [2023-12-20 14:43:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-20 14:43:35,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:35,779 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:35,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:35,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-20 14:43:35,987 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:35,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:35,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1275804189, now seen corresponding path program 1 times [2023-12-20 14:43:35,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:35,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637202245] [2023-12-20 14:43:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:35,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:36,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:36,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 14:43:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:36,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:36,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 14:43:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-20 14:43:36,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:36,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637202245] [2023-12-20 14:43:36,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637202245] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:36,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:36,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 14:43:36,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908218322] [2023-12-20 14:43:36,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:36,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:36,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:36,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 14:43:36,040 INFO L87 Difference]: Start difference. First operand 3511 states and 5029 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-20 14:43:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:36,359 INFO L93 Difference]: Finished difference Result 4145 states and 5852 transitions. [2023-12-20 14:43:36,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:43:36,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2023-12-20 14:43:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:36,373 INFO L225 Difference]: With dead ends: 4145 [2023-12-20 14:43:36,373 INFO L226 Difference]: Without dead ends: 3480 [2023-12-20 14:43:36,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:36,376 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 326 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:36,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 385 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:43:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2023-12-20 14:43:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3403. [2023-12-20 14:43:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 2845 states have (on average 1.4242530755711775) internal successors, (4052), 2900 states have internal predecessors, (4052), 327 states have call successors, (327), 197 states have call predecessors, (327), 229 states have return successors, (504), 313 states have call predecessors, (504), 326 states have call successors, (504) [2023-12-20 14:43:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 4883 transitions. [2023-12-20 14:43:36,596 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 4883 transitions. Word has length 78 [2023-12-20 14:43:36,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:36,597 INFO L495 AbstractCegarLoop]: Abstraction has 3403 states and 4883 transitions. [2023-12-20 14:43:36,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-20 14:43:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4883 transitions. [2023-12-20 14:43:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-20 14:43:36,603 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:36,603 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:36,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-20 14:43:36,603 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:36,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1576457092, now seen corresponding path program 1 times [2023-12-20 14:43:36,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:36,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010946984] [2023-12-20 14:43:36,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:36,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:36,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:36,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 14:43:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:36,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 14:43:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:36,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 14:43:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:36,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 14:43:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-20 14:43:36,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:36,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010946984] [2023-12-20 14:43:36,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010946984] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:36,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381731244] [2023-12-20 14:43:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:36,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:36,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:36,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:36,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 14:43:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:36,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:36,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-20 14:43:36,794 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:36,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381731244] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:36,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:36,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-20 14:43:36,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498241367] [2023-12-20 14:43:36,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:36,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:36,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:36,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:36,796 INFO L87 Difference]: Start difference. First operand 3403 states and 4883 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-20 14:43:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:36,959 INFO L93 Difference]: Finished difference Result 3688 states and 5241 transitions. [2023-12-20 14:43:36,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:36,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2023-12-20 14:43:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:36,975 INFO L225 Difference]: With dead ends: 3688 [2023-12-20 14:43:36,975 INFO L226 Difference]: Without dead ends: 2693 [2023-12-20 14:43:36,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:36,977 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 55 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:36,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 486 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:36,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2023-12-20 14:43:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2693. [2023-12-20 14:43:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2222 states have (on average 1.4635463546354635) internal successors, (3252), 2262 states have internal predecessors, (3252), 280 states have call successors, (280), 166 states have call predecessors, (280), 190 states have return successors, (430), 272 states have call predecessors, (430), 280 states have call successors, (430) [2023-12-20 14:43:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3962 transitions. [2023-12-20 14:43:37,124 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3962 transitions. Word has length 92 [2023-12-20 14:43:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:37,124 INFO L495 AbstractCegarLoop]: Abstraction has 2693 states and 3962 transitions. [2023-12-20 14:43:37,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-20 14:43:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3962 transitions. [2023-12-20 14:43:37,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 14:43:37,129 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:37,129 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:37,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:37,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:37,336 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:37,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:37,337 INFO L85 PathProgramCache]: Analyzing trace with hash -880498830, now seen corresponding path program 1 times [2023-12-20 14:43:37,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:37,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907598280] [2023-12-20 14:43:37,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:37,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:37,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:37,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:37,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:37,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:37,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:43:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:37,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:37,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 14:43:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-20 14:43:37,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:37,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907598280] [2023-12-20 14:43:37,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907598280] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:37,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033992972] [2023-12-20 14:43:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:37,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:37,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:37,441 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:37,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 14:43:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:37,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:37,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-20 14:43:37,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:37,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033992972] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:37,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:37,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-20 14:43:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057428787] [2023-12-20 14:43:37,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:37,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:37,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:37,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:37,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:37,638 INFO L87 Difference]: Start difference. First operand 2693 states and 3962 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-20 14:43:37,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:37,937 INFO L93 Difference]: Finished difference Result 7964 states and 11847 transitions. [2023-12-20 14:43:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:37,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2023-12-20 14:43:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:37,960 INFO L225 Difference]: With dead ends: 7964 [2023-12-20 14:43:37,961 INFO L226 Difference]: Without dead ends: 5281 [2023-12-20 14:43:37,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:37,970 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 134 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:37,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 295 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5281 states. [2023-12-20 14:43:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5281 to 5251. [2023-12-20 14:43:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5251 states, 4334 states have (on average 1.45523765574527) internal successors, (6307), 4413 states have internal predecessors, (6307), 538 states have call successors, (538), 330 states have call predecessors, (538), 378 states have return successors, (822), 515 states have call predecessors, (822), 538 states have call successors, (822) [2023-12-20 14:43:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5251 states to 5251 states and 7667 transitions. [2023-12-20 14:43:38,253 INFO L78 Accepts]: Start accepts. Automaton has 5251 states and 7667 transitions. Word has length 99 [2023-12-20 14:43:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:38,253 INFO L495 AbstractCegarLoop]: Abstraction has 5251 states and 7667 transitions. [2023-12-20 14:43:38,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-20 14:43:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 5251 states and 7667 transitions. [2023-12-20 14:43:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 14:43:38,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:38,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:38,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:38,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-20 14:43:38,465 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:38,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:38,466 INFO L85 PathProgramCache]: Analyzing trace with hash -715203438, now seen corresponding path program 1 times [2023-12-20 14:43:38,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:38,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144530120] [2023-12-20 14:43:38,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:38,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:38,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:38,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:38,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:43:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:38,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 14:43:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-20 14:43:38,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:38,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144530120] [2023-12-20 14:43:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144530120] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:38,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:38,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 14:43:38,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528100698] [2023-12-20 14:43:38,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:38,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 14:43:38,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:38,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 14:43:38,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:38,587 INFO L87 Difference]: Start difference. First operand 5251 states and 7667 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-20 14:43:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:39,179 INFO L93 Difference]: Finished difference Result 11584 states and 17359 transitions. [2023-12-20 14:43:39,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 14:43:39,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2023-12-20 14:43:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:39,202 INFO L225 Difference]: With dead ends: 11584 [2023-12-20 14:43:39,202 INFO L226 Difference]: Without dead ends: 6343 [2023-12-20 14:43:39,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-20 14:43:39,217 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 138 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:39,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 382 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:43:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2023-12-20 14:43:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 5307. [2023-12-20 14:43:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5307 states, 4390 states have (on average 1.4430523917995444) internal successors, (6335), 4469 states have internal predecessors, (6335), 538 states have call successors, (538), 330 states have call predecessors, (538), 378 states have return successors, (822), 515 states have call predecessors, (822), 538 states have call successors, (822) [2023-12-20 14:43:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 7695 transitions. [2023-12-20 14:43:39,561 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 7695 transitions. Word has length 99 [2023-12-20 14:43:39,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:39,561 INFO L495 AbstractCegarLoop]: Abstraction has 5307 states and 7695 transitions. [2023-12-20 14:43:39,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-20 14:43:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 7695 transitions. [2023-12-20 14:43:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 14:43:39,567 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:39,567 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:39,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-20 14:43:39,567 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:39,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:39,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1759570514, now seen corresponding path program 1 times [2023-12-20 14:43:39,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:39,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720162495] [2023-12-20 14:43:39,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:39,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:39,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:39,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:39,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:39,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:39,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:39,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:43:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:39,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:39,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 14:43:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-20 14:43:39,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720162495] [2023-12-20 14:43:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720162495] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824284015] [2023-12-20 14:43:39,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:39,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:39,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:39,643 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:39,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 14:43:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:39,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:39,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-20 14:43:39,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:39,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824284015] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:39,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:39,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:39,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470738923] [2023-12-20 14:43:39,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:39,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:39,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:39,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:39,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:39,736 INFO L87 Difference]: Start difference. First operand 5307 states and 7695 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 14:43:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:40,305 INFO L93 Difference]: Finished difference Result 15583 states and 22735 transitions. [2023-12-20 14:43:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:40,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2023-12-20 14:43:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:40,326 INFO L225 Difference]: With dead ends: 15583 [2023-12-20 14:43:40,326 INFO L226 Difference]: Without dead ends: 6268 [2023-12-20 14:43:40,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:40,348 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 144 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:40,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 449 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2023-12-20 14:43:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 6268. [2023-12-20 14:43:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6268 states, 5188 states have (on average 1.4406322282189667) internal successors, (7474), 5275 states have internal predecessors, (7474), 633 states have call successors, (633), 390 states have call predecessors, (633), 446 states have return successors, (972), 610 states have call predecessors, (972), 633 states have call successors, (972) [2023-12-20 14:43:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 9079 transitions. [2023-12-20 14:43:40,752 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 9079 transitions. Word has length 99 [2023-12-20 14:43:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:40,752 INFO L495 AbstractCegarLoop]: Abstraction has 6268 states and 9079 transitions. [2023-12-20 14:43:40,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 14:43:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 9079 transitions. [2023-12-20 14:43:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-20 14:43:40,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:40,760 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:40,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:40,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:40,981 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:40,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:40,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1670722888, now seen corresponding path program 1 times [2023-12-20 14:43:40,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:40,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285634944] [2023-12-20 14:43:40,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:40,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:41,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:41,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:41,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:41,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:41,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:41,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:43:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:41,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 14:43:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:41,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 14:43:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-12-20 14:43:41,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285634944] [2023-12-20 14:43:41,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285634944] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923707086] [2023-12-20 14:43:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:41,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:41,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:41,119 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:41,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 14:43:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:41,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:41,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-20 14:43:41,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:41,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923707086] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:41,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:41,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-20 14:43:41,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69877508] [2023-12-20 14:43:41,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:41,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:41,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:41,311 INFO L87 Difference]: Start difference. First operand 6268 states and 9079 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 14:43:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:41,811 INFO L93 Difference]: Finished difference Result 13026 states and 19068 transitions. [2023-12-20 14:43:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 127 [2023-12-20 14:43:41,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:41,839 INFO L225 Difference]: With dead ends: 13026 [2023-12-20 14:43:41,840 INFO L226 Difference]: Without dead ends: 9120 [2023-12-20 14:43:41,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:41,852 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 94 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:41,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 299 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9120 states. [2023-12-20 14:43:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9120 to 9060. [2023-12-20 14:43:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9060 states, 7515 states have (on average 1.439387890884897) internal successors, (10817), 7636 states have internal predecessors, (10817), 901 states have call successors, (901), 563 states have call predecessors, (901), 643 states have return successors, (1353), 868 states have call predecessors, (1353), 901 states have call successors, (1353) [2023-12-20 14:43:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9060 states to 9060 states and 13071 transitions. [2023-12-20 14:43:42,378 INFO L78 Accepts]: Start accepts. Automaton has 9060 states and 13071 transitions. Word has length 127 [2023-12-20 14:43:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:42,379 INFO L495 AbstractCegarLoop]: Abstraction has 9060 states and 13071 transitions. [2023-12-20 14:43:42,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 14:43:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 9060 states and 13071 transitions. [2023-12-20 14:43:42,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-20 14:43:42,393 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:42,393 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:42,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:42,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:42,600 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:42,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:42,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1558039379, now seen corresponding path program 1 times [2023-12-20 14:43:42,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:42,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892681152] [2023-12-20 14:43:42,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:42,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 14:43:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 14:43:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-20 14:43:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 14:43:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-20 14:43:42,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:42,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892681152] [2023-12-20 14:43:42,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892681152] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:42,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926698315] [2023-12-20 14:43:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:42,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:42,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:42,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:42,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 14:43:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:42,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:42,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-20 14:43:42,951 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926698315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:42,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092759354] [2023-12-20 14:43:42,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:42,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:42,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:42,953 INFO L87 Difference]: Start difference. First operand 9060 states and 13071 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 14:43:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:43,417 INFO L93 Difference]: Finished difference Result 19074 states and 27782 transitions. [2023-12-20 14:43:43,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:43,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 143 [2023-12-20 14:43:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:43,452 INFO L225 Difference]: With dead ends: 19074 [2023-12-20 14:43:43,453 INFO L226 Difference]: Without dead ends: 10025 [2023-12-20 14:43:43,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:43,480 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 127 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:43,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 185 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:43,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10025 states. [2023-12-20 14:43:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10025 to 10025. [2023-12-20 14:43:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10025 states, 8372 states have (on average 1.388676540850454) internal successors, (11626), 8503 states have internal predecessors, (11626), 926 states have call successors, (926), 626 states have call predecessors, (926), 726 states have return successors, (1401), 903 states have call predecessors, (1401), 926 states have call successors, (1401) [2023-12-20 14:43:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10025 states to 10025 states and 13953 transitions. [2023-12-20 14:43:44,315 INFO L78 Accepts]: Start accepts. Automaton has 10025 states and 13953 transitions. Word has length 143 [2023-12-20 14:43:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:44,315 INFO L495 AbstractCegarLoop]: Abstraction has 10025 states and 13953 transitions. [2023-12-20 14:43:44,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 14:43:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 10025 states and 13953 transitions. [2023-12-20 14:43:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-20 14:43:44,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:44,330 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:44,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:44,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:44,536 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:44,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash -396985077, now seen corresponding path program 1 times [2023-12-20 14:43:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:44,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82366174] [2023-12-20 14:43:44,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:44,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 14:43:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 14:43:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-20 14:43:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 14:43:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-20 14:43:44,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:44,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82366174] [2023-12-20 14:43:44,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82366174] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:44,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287705190] [2023-12-20 14:43:44,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:44,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:44,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:44,642 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:44,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 14:43:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:44,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 14:43:44,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-20 14:43:44,755 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:44,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287705190] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:44,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:44,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:44,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610121744] [2023-12-20 14:43:44,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:44,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:44,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:44,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:44,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:44,756 INFO L87 Difference]: Start difference. First operand 10025 states and 13953 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-20 14:43:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:45,308 INFO L93 Difference]: Finished difference Result 21119 states and 29216 transitions. [2023-12-20 14:43:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:45,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 143 [2023-12-20 14:43:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:45,346 INFO L225 Difference]: With dead ends: 21119 [2023-12-20 14:43:45,346 INFO L226 Difference]: Without dead ends: 11105 [2023-12-20 14:43:45,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:45,364 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 150 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:45,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 304 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:45,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11105 states. [2023-12-20 14:43:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11105 to 10812. [2023-12-20 14:43:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10812 states, 9103 states have (on average 1.3421948808085247) internal successors, (12218), 9224 states have internal predecessors, (12218), 924 states have call successors, (924), 684 states have call predecessors, (924), 784 states have return successors, (1397), 911 states have call predecessors, (1397), 924 states have call successors, (1397) [2023-12-20 14:43:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10812 states to 10812 states and 14539 transitions. [2023-12-20 14:43:45,886 INFO L78 Accepts]: Start accepts. Automaton has 10812 states and 14539 transitions. Word has length 143 [2023-12-20 14:43:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:45,886 INFO L495 AbstractCegarLoop]: Abstraction has 10812 states and 14539 transitions. [2023-12-20 14:43:45,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-20 14:43:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 10812 states and 14539 transitions. [2023-12-20 14:43:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-20 14:43:45,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:45,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:45,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:46,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-20 14:43:46,107 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:46,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:46,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1880101965, now seen corresponding path program 1 times [2023-12-20 14:43:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:46,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026686978] [2023-12-20 14:43:46,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:46,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:43:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 14:43:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 14:43:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 14:43:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-20 14:43:46,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:46,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026686978] [2023-12-20 14:43:46,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026686978] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:46,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204200133] [2023-12-20 14:43:46,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:46,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:46,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:46,200 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:46,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 14:43:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:46,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:46,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-20 14:43:46,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:46,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204200133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:46,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:46,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:46,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629015487] [2023-12-20 14:43:46,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:46,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:46,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:46,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:46,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:46,324 INFO L87 Difference]: Start difference. First operand 10812 states and 14539 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 14:43:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:47,001 INFO L93 Difference]: Finished difference Result 29394 states and 39520 transitions. [2023-12-20 14:43:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:47,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2023-12-20 14:43:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:47,055 INFO L225 Difference]: With dead ends: 29394 [2023-12-20 14:43:47,055 INFO L226 Difference]: Without dead ends: 18593 [2023-12-20 14:43:47,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:47,078 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 135 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:47,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 439 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:47,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18593 states. [2023-12-20 14:43:47,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18593 to 18579. [2023-12-20 14:43:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18579 states, 15661 states have (on average 1.329544728944512) internal successors, (20822), 15873 states have internal predecessors, (20822), 1561 states have call successors, (1561), 1176 states have call predecessors, (1561), 1356 states have return successors, (2433), 1545 states have call predecessors, (2433), 1561 states have call successors, (2433) [2023-12-20 14:43:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18579 states to 18579 states and 24816 transitions. [2023-12-20 14:43:47,928 INFO L78 Accepts]: Start accepts. Automaton has 18579 states and 24816 transitions. Word has length 144 [2023-12-20 14:43:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:47,928 INFO L495 AbstractCegarLoop]: Abstraction has 18579 states and 24816 transitions. [2023-12-20 14:43:47,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 14:43:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 18579 states and 24816 transitions. [2023-12-20 14:43:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-20 14:43:47,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:47,960 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:47,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:48,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-20 14:43:48,167 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:48,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:48,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1887934140, now seen corresponding path program 1 times [2023-12-20 14:43:48,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:48,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521780873] [2023-12-20 14:43:48,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:48,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:43:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 14:43:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-20 14:43:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 14:43:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-20 14:43:48,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:48,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521780873] [2023-12-20 14:43:48,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521780873] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:48,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239690860] [2023-12-20 14:43:48,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:48,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:48,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:48,261 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:48,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 14:43:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:48,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:48,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-20 14:43:48,437 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:48,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239690860] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:48,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638273955] [2023-12-20 14:43:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:48,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:48,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:48,438 INFO L87 Difference]: Start difference. First operand 18579 states and 24816 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 14:43:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:49,125 INFO L93 Difference]: Finished difference Result 26995 states and 36328 transitions. [2023-12-20 14:43:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:49,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 144 [2023-12-20 14:43:49,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:49,145 INFO L225 Difference]: With dead ends: 26995 [2023-12-20 14:43:49,146 INFO L226 Difference]: Without dead ends: 8278 [2023-12-20 14:43:49,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:49,175 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 106 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:49,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 176 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2023-12-20 14:43:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 7702. [2023-12-20 14:43:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7702 states, 6507 states have (on average 1.2906101121868756) internal successors, (8398), 6568 states have internal predecessors, (8398), 644 states have call successors, (644), 494 states have call predecessors, (644), 550 states have return successors, (861), 643 states have call predecessors, (861), 644 states have call successors, (861) [2023-12-20 14:43:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7702 states to 7702 states and 9903 transitions. [2023-12-20 14:43:49,710 INFO L78 Accepts]: Start accepts. Automaton has 7702 states and 9903 transitions. Word has length 144 [2023-12-20 14:43:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:49,711 INFO L495 AbstractCegarLoop]: Abstraction has 7702 states and 9903 transitions. [2023-12-20 14:43:49,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 14:43:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 7702 states and 9903 transitions. [2023-12-20 14:43:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-20 14:43:49,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:49,720 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:49,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:49,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-20 14:43:49,927 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:49,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash -642866549, now seen corresponding path program 1 times [2023-12-20 14:43:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:49,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674451400] [2023-12-20 14:43:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:49,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:43:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 14:43:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 14:43:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-12-20 14:43:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-12-20 14:43:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2023-12-20 14:43:50,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:50,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674451400] [2023-12-20 14:43:50,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674451400] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:50,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997655353] [2023-12-20 14:43:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:50,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:50,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:50,061 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:50,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-20 14:43:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:50,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:50,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-20 14:43:50,221 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:50,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997655353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:50,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:50,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:50,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484554824] [2023-12-20 14:43:50,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:50,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:50,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:50,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:50,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:50,223 INFO L87 Difference]: Start difference. First operand 7702 states and 9903 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-20 14:43:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:50,582 INFO L93 Difference]: Finished difference Result 14138 states and 18514 transitions. [2023-12-20 14:43:50,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:50,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 178 [2023-12-20 14:43:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:50,600 INFO L225 Difference]: With dead ends: 14138 [2023-12-20 14:43:50,601 INFO L226 Difference]: Without dead ends: 6757 [2023-12-20 14:43:50,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:50,614 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 122 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:50,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 177 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:50,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2023-12-20 14:43:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 6164. [2023-12-20 14:43:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6164 states, 5215 states have (on average 1.2473633748801534) internal successors, (6505), 5260 states have internal predecessors, (6505), 512 states have call successors, (512), 396 states have call predecessors, (512), 436 states have return successors, (651), 509 states have call predecessors, (651), 512 states have call successors, (651) [2023-12-20 14:43:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6164 states to 6164 states and 7668 transitions. [2023-12-20 14:43:50,946 INFO L78 Accepts]: Start accepts. Automaton has 6164 states and 7668 transitions. Word has length 178 [2023-12-20 14:43:50,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:50,946 INFO L495 AbstractCegarLoop]: Abstraction has 6164 states and 7668 transitions. [2023-12-20 14:43:50,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-20 14:43:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 6164 states and 7668 transitions. [2023-12-20 14:43:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-20 14:43:50,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:50,953 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:50,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:51,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-20 14:43:51,159 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:51,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:51,159 INFO L85 PathProgramCache]: Analyzing trace with hash 392034281, now seen corresponding path program 1 times [2023-12-20 14:43:51,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:51,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825170527] [2023-12-20 14:43:51,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:51,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:43:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 14:43:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 14:43:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-12-20 14:43:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-12-20 14:43:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-12-20 14:43:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825170527] [2023-12-20 14:43:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825170527] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528442631] [2023-12-20 14:43:51,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:51,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:51,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:51,253 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:51,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-20 14:43:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:51,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:51,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-20 14:43:51,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:51,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528442631] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:51,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:51,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:51,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102515647] [2023-12-20 14:43:51,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:51,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:51,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:51,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:51,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:51,401 INFO L87 Difference]: Start difference. First operand 6164 states and 7668 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-20 14:43:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:51,831 INFO L93 Difference]: Finished difference Result 17247 states and 21613 transitions. [2023-12-20 14:43:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:51,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 178 [2023-12-20 14:43:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:51,859 INFO L225 Difference]: With dead ends: 17247 [2023-12-20 14:43:51,859 INFO L226 Difference]: Without dead ends: 11094 [2023-12-20 14:43:51,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:51,872 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 129 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:51,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 419 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11094 states. [2023-12-20 14:43:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11094 to 11092. [2023-12-20 14:43:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11092 states, 9344 states have (on average 1.2350171232876712) internal successors, (11540), 9428 states have internal predecessors, (11540), 955 states have call successors, (955), 724 states have call predecessors, (955), 792 states have return successors, (1344), 943 states have call predecessors, (1344), 955 states have call successors, (1344) [2023-12-20 14:43:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11092 states to 11092 states and 13839 transitions. [2023-12-20 14:43:52,456 INFO L78 Accepts]: Start accepts. Automaton has 11092 states and 13839 transitions. Word has length 178 [2023-12-20 14:43:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:52,457 INFO L495 AbstractCegarLoop]: Abstraction has 11092 states and 13839 transitions. [2023-12-20 14:43:52,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-20 14:43:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 11092 states and 13839 transitions. [2023-12-20 14:43:52,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-20 14:43:52,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:52,464 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:52,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:52,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-20 14:43:52,671 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:52,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1461843753, now seen corresponding path program 1 times [2023-12-20 14:43:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128160863] [2023-12-20 14:43:52,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:52,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 14:43:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 14:43:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-20 14:43:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 14:43:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-12-20 14:43:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-12-20 14:43:52,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:52,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128160863] [2023-12-20 14:43:52,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128160863] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:52,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424650655] [2023-12-20 14:43:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:52,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:52,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:52,773 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:52,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-20 14:43:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:52,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 14:43:52,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-20 14:43:52,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:52,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424650655] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:52,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:52,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:52,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638981772] [2023-12-20 14:43:52,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:52,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:52,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:52,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:52,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:52,910 INFO L87 Difference]: Start difference. First operand 11092 states and 13839 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-20 14:43:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:53,359 INFO L93 Difference]: Finished difference Result 18986 states and 24239 transitions. [2023-12-20 14:43:53,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:53,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 179 [2023-12-20 14:43:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:53,384 INFO L225 Difference]: With dead ends: 18986 [2023-12-20 14:43:53,384 INFO L226 Difference]: Without dead ends: 11102 [2023-12-20 14:43:53,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:53,399 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 117 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:53,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 399 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11102 states. [2023-12-20 14:43:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11102 to 11084. [2023-12-20 14:43:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11084 states, 9336 states have (on average 1.2122964867180805) internal successors, (11318), 9420 states have internal predecessors, (11318), 955 states have call successors, (955), 724 states have call predecessors, (955), 792 states have return successors, (1344), 943 states have call predecessors, (1344), 955 states have call successors, (1344) [2023-12-20 14:43:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11084 states to 11084 states and 13617 transitions. [2023-12-20 14:43:54,031 INFO L78 Accepts]: Start accepts. Automaton has 11084 states and 13617 transitions. Word has length 179 [2023-12-20 14:43:54,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:54,031 INFO L495 AbstractCegarLoop]: Abstraction has 11084 states and 13617 transitions. [2023-12-20 14:43:54,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-20 14:43:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 11084 states and 13617 transitions. [2023-12-20 14:43:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-20 14:43:54,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:54,039 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:54,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:54,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-20 14:43:54,255 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:54,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1197244821, now seen corresponding path program 1 times [2023-12-20 14:43:54,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:54,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980771383] [2023-12-20 14:43:54,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:54,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 14:43:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 14:43:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 14:43:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 14:43:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-12-20 14:43:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-20 14:43:54,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:54,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980771383] [2023-12-20 14:43:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980771383] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879289086] [2023-12-20 14:43:54,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:54,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:54,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:54,365 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:54,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-20 14:43:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:54,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 14:43:54,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-20 14:43:54,545 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:54,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879289086] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:54,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:54,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738611154] [2023-12-20 14:43:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:54,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:54,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:54,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:54,547 INFO L87 Difference]: Start difference. First operand 11084 states and 13617 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-20 14:43:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:55,007 INFO L93 Difference]: Finished difference Result 19159 states and 24107 transitions. [2023-12-20 14:43:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:55,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 181 [2023-12-20 14:43:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:55,030 INFO L225 Difference]: With dead ends: 19159 [2023-12-20 14:43:55,030 INFO L226 Difference]: Without dead ends: 11009 [2023-12-20 14:43:55,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:55,047 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 92 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:55,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 364 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states. [2023-12-20 14:43:55,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 10964. [2023-12-20 14:43:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10964 states, 9228 states have (on average 1.1870394451668833) internal successors, (10954), 9306 states have internal predecessors, (10954), 955 states have call successors, (955), 724 states have call predecessors, (955), 780 states have return successors, (1326), 937 states have call predecessors, (1326), 955 states have call successors, (1326) [2023-12-20 14:43:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10964 states to 10964 states and 13235 transitions. [2023-12-20 14:43:55,677 INFO L78 Accepts]: Start accepts. Automaton has 10964 states and 13235 transitions. Word has length 181 [2023-12-20 14:43:55,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:55,677 INFO L495 AbstractCegarLoop]: Abstraction has 10964 states and 13235 transitions. [2023-12-20 14:43:55,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-20 14:43:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10964 states and 13235 transitions. [2023-12-20 14:43:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-20 14:43:55,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:55,685 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:55,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:55,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:55,892 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:55,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:55,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1422560057, now seen corresponding path program 1 times [2023-12-20 14:43:55,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:55,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573321683] [2023-12-20 14:43:55,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:55,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:55,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:55,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:55,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:55,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:55,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:55,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 14:43:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:55,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 14:43:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:55,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 14:43:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:55,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 14:43:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 14:43:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-20 14:43:56,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:56,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573321683] [2023-12-20 14:43:56,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573321683] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:56,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336116246] [2023-12-20 14:43:56,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:56,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:56,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:56,021 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:56,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-20 14:43:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:56,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 14:43:56,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-12-20 14:43:56,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:56,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336116246] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:56,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:56,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-20 14:43:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699137237] [2023-12-20 14:43:56,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:56,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:43:56,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:56,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:43:56,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:43:56,193 INFO L87 Difference]: Start difference. First operand 10964 states and 13235 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-20 14:43:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:56,756 INFO L93 Difference]: Finished difference Result 21916 states and 26716 transitions. [2023-12-20 14:43:56,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 14:43:56,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 183 [2023-12-20 14:43:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:56,778 INFO L225 Difference]: With dead ends: 21916 [2023-12-20 14:43:56,778 INFO L226 Difference]: Without dead ends: 10964 [2023-12-20 14:43:56,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-20 14:43:56,794 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 165 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:56,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 233 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10964 states. [2023-12-20 14:43:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10964 to 10964. [2023-12-20 14:43:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10964 states, 9228 states have (on average 1.1540962288686607) internal successors, (10650), 9306 states have internal predecessors, (10650), 955 states have call successors, (955), 724 states have call predecessors, (955), 780 states have return successors, (1326), 937 states have call predecessors, (1326), 955 states have call successors, (1326) [2023-12-20 14:43:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10964 states to 10964 states and 12931 transitions. [2023-12-20 14:43:57,459 INFO L78 Accepts]: Start accepts. Automaton has 10964 states and 12931 transitions. Word has length 183 [2023-12-20 14:43:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:57,460 INFO L495 AbstractCegarLoop]: Abstraction has 10964 states and 12931 transitions. [2023-12-20 14:43:57,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-20 14:43:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 10964 states and 12931 transitions. [2023-12-20 14:43:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-20 14:43:57,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:57,468 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:57,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-20 14:43:57,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:57,674 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:57,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash -996005559, now seen corresponding path program 1 times [2023-12-20 14:43:57,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:57,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543396883] [2023-12-20 14:43:57,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 14:43:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 14:43:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 14:43:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 14:43:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 14:43:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-20 14:43:57,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:57,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543396883] [2023-12-20 14:43:57,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543396883] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:57,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199592299] [2023-12-20 14:43:57,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:57,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:57,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:57,793 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:57,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-20 14:43:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:57,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 14:43:57,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-12-20 14:43:57,992 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:57,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199592299] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:57,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:57,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-20 14:43:57,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826134349] [2023-12-20 14:43:57,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:57,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:43:57,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:57,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:43:57,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:43:57,994 INFO L87 Difference]: Start difference. First operand 10964 states and 12931 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-20 14:43:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:58,605 INFO L93 Difference]: Finished difference Result 16488 states and 19654 transitions. [2023-12-20 14:43:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 14:43:58,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 183 [2023-12-20 14:43:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:58,624 INFO L225 Difference]: With dead ends: 16488 [2023-12-20 14:43:58,624 INFO L226 Difference]: Without dead ends: 8873 [2023-12-20 14:43:58,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-20 14:43:58,635 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 161 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:58,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 226 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2023-12-20 14:43:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 6824. [2023-12-20 14:43:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6824 states, 5756 states have (on average 1.1320361362056983) internal successors, (6516), 5794 states have internal predecessors, (6516), 599 states have call successors, (599), 444 states have call predecessors, (599), 468 states have return successors, (807), 587 states have call predecessors, (807), 599 states have call successors, (807) [2023-12-20 14:43:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6824 states to 6824 states and 7922 transitions. [2023-12-20 14:43:58,998 INFO L78 Accepts]: Start accepts. Automaton has 6824 states and 7922 transitions. Word has length 183 [2023-12-20 14:43:58,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:58,999 INFO L495 AbstractCegarLoop]: Abstraction has 6824 states and 7922 transitions. [2023-12-20 14:43:58,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-20 14:43:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 6824 states and 7922 transitions. [2023-12-20 14:43:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-20 14:43:59,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:59,004 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:59,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:59,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:59,206 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:59,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:59,206 INFO L85 PathProgramCache]: Analyzing trace with hash -657718009, now seen corresponding path program 1 times [2023-12-20 14:43:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:59,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451598101] [2023-12-20 14:43:59,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:59,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:43:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:43:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 14:43:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 14:43:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 14:43:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 14:43:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 14:43:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-20 14:43:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:59,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451598101] [2023-12-20 14:43:59,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451598101] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:59,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32839989] [2023-12-20 14:43:59,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:59,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:59,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:59,354 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:59,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-20 14:43:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:59,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 14:43:59,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2023-12-20 14:43:59,469 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:59,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32839989] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:59,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:59,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-20 14:43:59,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779716418] [2023-12-20 14:43:59,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:59,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:59,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:59,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:59,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:59,471 INFO L87 Difference]: Start difference. First operand 6824 states and 7922 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-20 14:43:59,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:59,677 INFO L93 Difference]: Finished difference Result 9723 states and 11306 transitions. [2023-12-20 14:43:59,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 14:43:59,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 183 [2023-12-20 14:43:59,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:59,681 INFO L225 Difference]: With dead ends: 9723 [2023-12-20 14:43:59,681 INFO L226 Difference]: Without dead ends: 1918 [2023-12-20 14:43:59,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:59,689 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 11 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:59,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 422 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2023-12-20 14:43:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1918. [2023-12-20 14:43:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1613 states have (on average 1.1035337879727216) internal successors, (1780), 1625 states have internal predecessors, (1780), 174 states have call successors, (174), 122 states have call predecessors, (174), 130 states have return successors, (189), 171 states have call predecessors, (189), 174 states have call successors, (189) [2023-12-20 14:43:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2143 transitions. [2023-12-20 14:43:59,784 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2143 transitions. Word has length 183 [2023-12-20 14:43:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:59,784 INFO L495 AbstractCegarLoop]: Abstraction has 1918 states and 2143 transitions. [2023-12-20 14:43:59,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-20 14:43:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2143 transitions. [2023-12-20 14:43:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-20 14:43:59,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:59,786 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:59,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:59,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:59,992 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:59,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:59,992 INFO L85 PathProgramCache]: Analyzing trace with hash 677916105, now seen corresponding path program 1 times [2023-12-20 14:43:59,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:59,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064877505] [2023-12-20 14:43:59,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:59,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:44:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:44:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:44:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:44:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:44:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:44:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 14:44:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 14:44:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:44:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 14:44:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:44:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 14:44:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:44:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 14:44:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:44:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-20 14:44:00,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:44:00,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064877505] [2023-12-20 14:44:00,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064877505] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:44:00,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:44:00,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:44:00,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687843957] [2023-12-20 14:44:00,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:44:00,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:44:00,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:44:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:44:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:44:00,157 INFO L87 Difference]: Start difference. First operand 1918 states and 2143 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-20 14:44:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:44:00,964 INFO L93 Difference]: Finished difference Result 2141 states and 2384 transitions. [2023-12-20 14:44:00,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 14:44:00,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 183 [2023-12-20 14:44:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:44:00,965 INFO L225 Difference]: With dead ends: 2141 [2023-12-20 14:44:00,965 INFO L226 Difference]: Without dead ends: 0 [2023-12-20 14:44:00,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-12-20 14:44:00,968 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 631 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 14:44:00,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 631 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 14:44:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-20 14:44:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-20 14:44:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 14:44:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-20 14:44:00,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2023-12-20 14:44:00,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:44:00,971 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-20 14:44:00,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-20 14:44:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-20 14:44:00,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-20 14:44:00,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-20 14:44:00,974 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-20 14:44:00,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-20 14:44:00,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-20 14:44:45,479 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 820 830) no Hoare annotation was computed. [2023-12-20 14:44:45,479 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 820 830) no Hoare annotation was computed. [2023-12-20 14:44:45,480 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 820 830) the Hoare annotation is: (let ((.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (= |old(~t2_st~0)| ~t2_st~0))) (let ((.cse22 (not (= ~m_pc~0 ~t1_pc~0))) (.cse23 (< 0 ~t1_pc~0)) (.cse24 (< ~E_1~0 2)) (.cse15 (not (= ~t2_pc~0 1))) (.cse20 (< |old(~m_st~0)| 2)) (.cse0 (< ~T1_E~0 2)) (.cse2 (< ~E_2~0 2)) (.cse3 (and .cse25 (= ~m_st~0 |old(~m_st~0)|) .cse26)) (.cse5 (< |old(~t1_st~0)| 2)) (.cse6 (not (= ~t1_pc~0 1))) (.cse18 (= ~m_pc~0 1)) (.cse14 (< ~T2_E~0 2)) (.cse17 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 0))) (.cse7 (< ~E_M~0 2)) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (< |old(~t2_st~0)| 2)) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse19 (< 0 ~t2_pc~0)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse21 (= ~E_2~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse19 .cse16) (or .cse1 .cse3 .cse4 .cse8 .cse10 .cse11 .cse18 .cse12 .cse13 .cse20 .cse16 .cse21) (or .cse0 .cse22 .cse1 .cse23 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse16) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse19 .cse24 .cse14 .cse16 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse24 .cse14 .cse15 (not (= (+ ~local~0 1) ~token~0)) .cse16 .cse21) (or .cse0 .cse22 .cse1 .cse23 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 (not (= ~token~0 (+ 2 ~local~0))) .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse24 .cse14 .cse15 .cse16) (or .cse1 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse19 .cse16 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse18 .cse12 .cse13 .cse19 .cse14 .cse16 .cse17) (or .cse1 (and (<= ~t1_pc~0 0) (<= ~m_pc~0 0)) (and .cse25 (= ~m_st~0 0) .cse26) .cse4 .cse7 .cse8 .cse9 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0))) .cse10 .cse11 .cse12 .cse13 .cse19 (not (= |old(~m_st~0)| 0)) .cse16 .cse21)))) [2023-12-20 14:44:45,480 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2023-12-20 14:44:45,480 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2023-12-20 14:44:45,480 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2023-12-20 14:44:45,480 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 84 108) the Hoare annotation is: (let ((.cse13 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (let ((.cse2 (and .cse13 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (= ~m_pc~0 1)) (.cse10 (not (= ~q_free~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (= ~E_2~0 0)) (.cse11 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (not (= ~c_dr_pc~0 0))) (.cse12 (and .cse13 (= ~c_dr_st~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0)) (< |old(~p_dw_st~0)| 2) .cse8) (or .cse0 .cse1 (not (= ~p_num_write~0 1)) .cse9 .cse2 .cse3 (not (= ~p_dw_pc~0 0)) .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse10 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse12 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse8) (or .cse11 .cse9 .cse12)))) [2023-12-20 14:44:45,480 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2023-12-20 14:44:45,480 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2023-12-20 14:44:45,480 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2023-12-20 14:44:45,480 INFO L899 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2023-12-20 14:44:45,480 INFO L899 garLoopResultBuilder]: For program point L61(lines 49 63) no Hoare annotation was computed. [2023-12-20 14:44:45,480 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2023-12-20 14:44:45,481 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2023-12-20 14:44:45,481 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2023-12-20 14:44:45,481 INFO L899 garLoopResultBuilder]: For program point L80(lines 68 82) no Hoare annotation was computed. [2023-12-20 14:44:45,481 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2023-12-20 14:44:45,481 INFO L899 garLoopResultBuilder]: For program point L729-1(lines 713 746) no Hoare annotation was computed. [2023-12-20 14:44:45,481 INFO L899 garLoopResultBuilder]: For program point L719-1(lines 713 746) no Hoare annotation was computed. [2023-12-20 14:44:45,481 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 710 747) the Hoare annotation is: (let ((.cse5 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse23 (= ~m_pc~0 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse22 (< ~m_st~0 2)) (.cse0 (< ~t1_st~0 2)) (.cse12 (< 0 ~t2_pc~0)) (.cse25 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse24 (< 0 ~t1_pc~0)) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (< |old(~E_1~0)| 2)) (.cse11 (< |old(~E_M~0)| 2)) (.cse13 (< |old(~T2_E~0)| 2)) (.cse14 (not (= ~m_st~0 0))) (.cse15 (< |old(~E_2~0)| 2)) (.cse20 (not (= ~t2_pc~0 1))) (.cse21 (< ~t2_st~0 2)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (< |old(~T1_E~0)| 2)) (.cse18 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 (not (= ~token~0 (+ 2 ~local~0))) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse1 (and (<= ~t1_pc~0 0) (<= ~m_pc~0 0)) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21 .cse16 .cse18) (or .cse1 .cse2 .cse22 .cse4 .cse6 .cse7 .cse23 .cse8 .cse9 (= |old(~E_2~0)| 0) .cse16 .cse18) (or .cse1 .cse24 .cse2 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse1 .cse2 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse15 .cse21 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21 .cse16 .cse18) (or .cse0 .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 (not (= (+ ~local~0 1) ~token~0)) .cse16 .cse17 .cse18) (or .cse1 .cse24 .cse2 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18 .cse19))) [2023-12-20 14:44:45,481 INFO L899 garLoopResultBuilder]: For program point L734-1(lines 713 746) no Hoare annotation was computed. [2023-12-20 14:44:45,481 INFO L899 garLoopResultBuilder]: For program point L724-1(lines 713 746) no Hoare annotation was computed. [2023-12-20 14:44:45,481 INFO L899 garLoopResultBuilder]: For program point L714-1(lines 713 746) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 710 747) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L739-1(lines 710 747) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L803-2(lines 803 807) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 561) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L585(lines 573 587) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 545) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 536 545) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 583) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L574-2(lines 574 583) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L537(lines 537 542) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L566(lines 554 568) no Hoare annotation was computed. [2023-12-20 14:44:45,482 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 786 819) the Hoare annotation is: (let ((.cse29 (= |old(~t1_st~0)| ~t1_st~0)) (.cse30 (= |old(~t2_st~0)| ~t2_st~0))) (let ((.cse26 (not (= ~m_pc~0 ~t1_pc~0))) (.cse28 (not (= (+ ~local~0 1) ~token~0))) (.cse4 (not (= ~token~0 (+ 2 ~local~0)))) (.cse27 (< 0 ~t1_pc~0)) (.cse24 (< |old(~m_st~0)| 2)) (.cse16 (< ~E_1~0 2)) (.cse18 (not (= ~t2_pc~0 1))) (.cse0 (< ~T1_E~0 2)) (.cse3 (< ~E_2~0 2)) (.cse20 (and .cse29 (= ~m_st~0 |old(~m_st~0)|) .cse30)) (.cse6 (< |old(~t1_st~0)| 2)) (.cse7 (not (= ~t1_pc~0 1))) (.cse22 (= ~m_pc~0 1)) (.cse17 (< ~T2_E~0 2)) (.cse21 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (and .cse29 (= ~m_st~0 0) .cse30)) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse8 (< ~E_M~0 2)) (.cse9 (not (= ~p_num_write~0 0))) (.cse10 (< |old(~t2_st~0)| 2)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse23 (< 0 ~t2_pc~0)) (.cse15 (not (= |old(~m_st~0)| 0))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse25 (= ~E_2~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse21) (or .cse1 .cse3 .cse20 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse13 .cse14 .cse23 .cse19) (or .cse1 .cse20 .cse5 .cse9 .cse11 .cse12 .cse22 .cse13 .cse14 .cse24 .cse19 .cse25) (or .cse0 .cse26 .cse1 .cse27 .cse3 .cse20 .cse5 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse23 .cse17 .cse19) (or .cse0 .cse1 .cse20 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse24 .cse23 .cse16 .cse17 .cse19 .cse25) (or .cse0 .cse1 .cse20 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse28 .cse19 .cse25) (or .cse0 .cse26 .cse1 .cse27 .cse3 .cse20 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse27 .cse3 .cse20 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse28 .cse19) (or .cse0 .cse1 .cse3 .cse20 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse27 .cse3 .cse20 .cse5 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse24 .cse23 .cse16 .cse17 .cse19) (or .cse1 .cse20 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse23 .cse19 .cse25) (or .cse0 .cse1 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse22 .cse13 .cse14 .cse23 .cse17 .cse19 .cse21) (or .cse1 (and (<= ~t1_pc~0 0) (<= ~m_pc~0 0)) .cse2 .cse5 .cse8 .cse9 .cse10 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0))) .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse19 .cse25)))) [2023-12-20 14:44:45,482 INFO L899 garLoopResultBuilder]: For program point L575(lines 575 580) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 786 819) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L555(lines 555 564) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L555-2(lines 555 564) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L811-2(lines 786 819) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L547(lines 535 549) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 589 596) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 589 596) the Hoare annotation is: true [2023-12-20 14:44:45,483 INFO L895 garLoopResultBuilder]: At program point L895(line 895) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L895-1(line 895) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 109 151) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 671) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L664-2(lines 664 671) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L500(lines 500 508) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L467(lines 467 471) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2023-12-20 14:44:45,483 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L899 garLoopResultBuilder]: For program point L897(lines 897 902) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L899 garLoopResultBuilder]: For program point L864-1(lines 843 876) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 460 495) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L895 garLoopResultBuilder]: At program point L931(line 931) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,484 INFO L899 garLoopResultBuilder]: For program point L931-1(line 931) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 605) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L899 garLoopResultBuilder]: For program point L601-2(lines 600 618) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L899 garLoopResultBuilder]: For program point L503(lines 503 507) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L895 garLoopResultBuilder]: At program point L437(line 437) the Hoare annotation is: (let ((.cse5 (not (= ~m_pc~0 1))) (.cse12 (<= ~t2_pc~0 0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse17 (= ~token~0 ~local~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse15 (<= 2 ~T2_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~q_free~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse20 (= ~t2_pc~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse17 .cse12) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse19 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse13 .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse20 .cse8 .cse9 .cse10 .cse17 .cse11) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse19 .cse16 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11))) [2023-12-20 14:44:45,484 INFO L899 garLoopResultBuilder]: For program point L437-1(line 437) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 908 966) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 416 459) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 321 349) no Hoare annotation was computed. [2023-12-20 14:44:45,484 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (= ~q_free~0 0)) (.cse7 (not (= ~E_2~0 0))) (.cse1 (= ~c_dr_pc~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1) (and .cse0 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse1 (= ~p_num_write~0 1) .cse8 .cse9 .cse10))) [2023-12-20 14:44:45,485 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2023-12-20 14:44:45,485 INFO L895 garLoopResultBuilder]: At program point L935(line 935) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,485 INFO L895 garLoopResultBuilder]: At program point L935-1(line 935) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,485 INFO L899 garLoopResultBuilder]: For program point L869-1(lines 840 877) no Hoare annotation was computed. [2023-12-20 14:44:45,485 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 0)) (.cse15 (= ~p_num_write~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse1 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= ~q_free~0 0)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse12 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse13 (= ~q_free~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse17 (= ~p_dw_st~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse1 .cse18 .cse8 .cse9 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse1 .cse18 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse8 .cse9 .cse11))) [2023-12-20 14:44:45,485 INFO L899 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2023-12-20 14:44:45,485 INFO L895 garLoopResultBuilder]: At program point L936(line 936) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,485 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 645 709) no Hoare annotation was computed. [2023-12-20 14:44:45,485 INFO L899 garLoopResultBuilder]: For program point L606-1(lines 600 618) no Hoare annotation was computed. [2023-12-20 14:44:45,486 INFO L895 garLoopResultBuilder]: At program point L937(line 937) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,486 INFO L899 garLoopResultBuilder]: For program point L904(lines 893 906) no Hoare annotation was computed. [2023-12-20 14:44:45,486 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 153 209) no Hoare annotation was computed. [2023-12-20 14:44:45,486 INFO L895 garLoopResultBuilder]: At program point L475-1(lines 475 488) the Hoare annotation is: (let ((.cse6 (<= 2 ~m_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (<= 2 ~T2_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse18 (= ~m_st~0 0)) (.cse17 (not (= ~m_pc~0 1))) (.cse5 (= ~q_free~0 0)) (.cse15 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~token~0 ~local~0)) (.cse11 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse6 (not (= ~E_2~0 0)) .cse8 .cse9 .cse10) (and (= ~t1_pc~0 1) .cse0 .cse13 .cse14 .cse1 .cse2 (= (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse16 .cse8 .cse9 .cse10) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 .cse18 .cse17 .cse5 .cse15 .cse7 .cse8 .cse9 .cse10 .cse19 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 .cse18 .cse17 .cse5 .cse15 .cse7 .cse16 .cse8 .cse9 .cse10 .cse19 .cse11))) [2023-12-20 14:44:45,486 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2023-12-20 14:44:45,486 INFO L899 garLoopResultBuilder]: For program point transmit2_returnLabel#1(lines 496 531) no Hoare annotation was computed. [2023-12-20 14:44:45,486 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 248 301) no Hoare annotation was computed. [2023-12-20 14:44:45,486 INFO L899 garLoopResultBuilder]: For program point L675-1(lines 651 703) no Hoare annotation was computed. [2023-12-20 14:44:45,486 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2023-12-20 14:44:45,486 INFO L899 garLoopResultBuilder]: For program point L940(line 940) no Hoare annotation was computed. [2023-12-20 14:44:45,486 INFO L895 garLoopResultBuilder]: At program point L511-1(lines 511 524) the Hoare annotation is: (let ((.cse10 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= ~m_pc~0 ~t1_pc~0)) (.cse8 (<= 2 ~E_M~0)) (.cse16 (= ~m_st~0 0)) (.cse17 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse20 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse16 .cse17 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse5 .cse6 .cse7 .cse17 .cse9 .cse10 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse11 .cse12 (= ~t2_pc~0 1) (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse16 .cse17 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18))) [2023-12-20 14:44:45,486 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 431 452) the Hoare annotation is: (let ((.cse5 (not (= ~m_pc~0 1))) (.cse19 (= ~token~0 ~local~0)) (.cse20 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse12 (<= ~t2_pc~0 0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse15 (<= 2 ~E_1~0)) (.cse16 (<= 2 ~T2_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~q_free~0 0)) (.cse17 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse18 (= ~t2_pc~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse15 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse18 .cse8 .cse9 .cse10 .cse19 .cse11) (and .cse0 .cse15 .cse16 .cse1 .cse2 .cse3 .cse20 .cse4 .cse6 .cse21 .cse17 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11) (and .cse13 .cse14 .cse0 .cse15 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse19 .cse12) (and .cse0 .cse15 .cse16 .cse1 .cse2 .cse3 .cse20 .cse4 .cse6 .cse21 .cse17 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse13 .cse14 .cse0 .cse15 .cse16 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse18 (= ~token~0 (+ 2 ~local~0)) .cse8 .cse9 .cse10 .cse11))) [2023-12-20 14:44:45,486 INFO L895 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 0)) (.cse15 (= ~p_num_write~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse1 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= ~q_free~0 0)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse12 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse13 (= ~q_free~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse17 (= ~p_dw_st~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse1 .cse18 .cse8 .cse9 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse1 .cse18 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse8 .cse9 .cse11))) [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L611-1(lines 597 619) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L942(lines 942 951) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L942-2(lines 942 951) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L678(lines 678 685) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L678-2(lines 678 685) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L844(lines 844 848) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L844-2(lines 843 876) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L317(lines 306 319) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 210 227) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 985) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L895 garLoopResultBuilder]: At program point L946(line 946) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L946-1(line 946) no Hoare annotation was computed. [2023-12-20 14:44:45,487 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~c_num_read~0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~q_free~0 1) (not (= ~m_pc~0 1)) (not (= ~E_2~0 0)) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~E_1~0 2) (<= 2 ~p_dw_st~0) (= ~M_E~0 2)) [2023-12-20 14:44:45,487 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2023-12-20 14:44:45,488 INFO L895 garLoopResultBuilder]: At program point L485(line 485) the Hoare annotation is: (let ((.cse16 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0))) (.cse15 (<= 2 ~t2_st~0)) (.cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~T2_E~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~m_st~0)) (.cse10 (not (= ~E_2~0 0))) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t2_pc~0 1) .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse18) (and .cse1 .cse4 .cse5 .cse6 .cse7 (= ~m_st~0 0) .cse16 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse18 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18))) [2023-12-20 14:44:45,488 INFO L899 garLoopResultBuilder]: For program point L485-1(line 485) no Hoare annotation was computed. [2023-12-20 14:44:45,488 INFO L899 garLoopResultBuilder]: For program point L981(lines 981 984) no Hoare annotation was computed. [2023-12-20 14:44:45,488 INFO L899 garLoopResultBuilder]: For program point L849-1(lines 843 876) no Hoare annotation was computed. [2023-12-20 14:44:45,488 INFO L899 garLoopResultBuilder]: For program point L420(lines 420 428) no Hoare annotation was computed. [2023-12-20 14:44:45,488 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~T2_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (<= ~t1_pc~0 0) (<= 2 ~E_2~0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-12-20 14:44:45,488 INFO L899 garLoopResultBuilder]: For program point L916-1(line 916) no Hoare annotation was computed. [2023-12-20 14:44:45,488 INFO L895 garLoopResultBuilder]: At program point L652(line 652) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,488 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-20 14:44:45,488 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 0)) (.cse15 (= ~p_num_write~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse1 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= ~q_free~0 0)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse12 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse13 (= ~q_free~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse17 (= ~p_dw_st~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse1 .cse18 .cse8 .cse9 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse1 .cse18 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse8 .cse9 .cse11))) [2023-12-20 14:44:45,488 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2023-12-20 14:44:45,488 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2023-12-20 14:44:45,488 INFO L895 garLoopResultBuilder]: At program point L521(line 521) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_free~0 0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 (<= 2 ~E_1~0) (<= 2 ~T2_E~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~T1_E~0) (<= 2 ~E_2~0) (= ~t2_pc~0 1) (= ~token~0 (+ 2 ~local~0)) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (not (= ~m_pc~0 1)) .cse4 .cse5 (not (= ~E_2~0 0)) .cse6 .cse7 .cse8))) [2023-12-20 14:44:45,488 INFO L899 garLoopResultBuilder]: For program point L521-1(line 521) no Hoare annotation was computed. [2023-12-20 14:44:45,489 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2023-12-20 14:44:45,489 INFO L895 garLoopResultBuilder]: At program point L125-1(lines 125 145) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse1 (= ~c_dr_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse6 (not (= ~m_pc~0 1))) (.cse11 (= ~q_free~0 0)) (.cse7 (not (= ~E_2~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1) (and (= ~c_num_read~0 ~p_num_write~0) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse11 .cse7 .cse8 .cse9 .cse10) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse1 (= ~c_last_read~0 ~p_last_write~0) .cse8 .cse9 .cse10) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse6 .cse11 .cse7 .cse8 .cse9 .cse10))) [2023-12-20 14:44:45,489 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse1 (<= 2 ~T2_E~0)) (.cse7 (= ~m_st~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~E_2~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse8 (= ~q_free~0 0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_M~0 2)) (.cse15 (= ~E_1~0 2)) (.cse16 (= ~M_E~0 2)) (.cse17 (<= ~t2_pc~0 0))) (or (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 2 ~t2_st~0) .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse8 (<= 2 ~m_st~0) (not (= ~E_2~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,489 INFO L895 garLoopResultBuilder]: At program point L918-1(line 918) the Hoare annotation is: (let ((.cse1 (<= 2 ~T2_E~0)) (.cse7 (= ~m_st~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~E_2~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse8 (= ~q_free~0 0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_M~0 2)) (.cse15 (= ~E_1~0 2)) (.cse16 (= ~M_E~0 2)) (.cse17 (<= ~t2_pc~0 0))) (or (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 2 ~t2_st~0) .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse8 (<= 2 ~m_st~0) (not (= ~E_2~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,489 INFO L899 garLoopResultBuilder]: For program point L654(line 654) no Hoare annotation was computed. [2023-12-20 14:44:45,489 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-12-20 14:44:45,489 INFO L899 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2023-12-20 14:44:45,489 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2023-12-20 14:44:45,489 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2023-12-20 14:44:45,489 INFO L895 garLoopResultBuilder]: At program point L919(line 919) the Hoare annotation is: (let ((.cse1 (<= 2 ~T2_E~0)) (.cse7 (= ~m_st~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~E_2~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse8 (= ~q_free~0 0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_M~0 2)) (.cse15 (= ~E_1~0 2)) (.cse16 (= ~M_E~0 2)) (.cse17 (<= ~t2_pc~0 0))) (or (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 2 ~t2_st~0) .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse8 (<= 2 ~m_st~0) (not (= ~E_2~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,489 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2023-12-20 14:44:45,489 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 135) no Hoare annotation was computed. [2023-12-20 14:44:45,489 INFO L899 garLoopResultBuilder]: For program point L854-1(lines 843 876) no Hoare annotation was computed. [2023-12-20 14:44:45,489 INFO L899 garLoopResultBuilder]: For program point L656(lines 656 660) no Hoare annotation was computed. [2023-12-20 14:44:45,490 INFO L895 garLoopResultBuilder]: At program point L689-1(lines 651 703) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,490 INFO L899 garLoopResultBuilder]: For program point L656-1(lines 651 703) no Hoare annotation was computed. [2023-12-20 14:44:45,490 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-12-20 14:44:45,490 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2023-12-20 14:44:45,490 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-20 14:44:45,490 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2023-12-20 14:44:45,490 INFO L899 garLoopResultBuilder]: For program point L955(lines 955 959) no Hoare annotation was computed. [2023-12-20 14:44:45,490 INFO L895 garLoopResultBuilder]: At program point L923-1(lines 923 960) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-20 14:44:45,490 INFO L899 garLoopResultBuilder]: For program point L692(lines 692 699) no Hoare annotation was computed. [2023-12-20 14:44:45,490 INFO L899 garLoopResultBuilder]: For program point L692-2(lines 692 699) no Hoare annotation was computed. [2023-12-20 14:44:45,490 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2023-12-20 14:44:45,490 INFO L899 garLoopResultBuilder]: For program point $Ultimate##104(lines 445 451) no Hoare annotation was computed. [2023-12-20 14:44:45,490 INFO L899 garLoopResultBuilder]: For program point L859-1(lines 843 876) no Hoare annotation was computed. [2023-12-20 14:44:45,490 INFO L899 garLoopResultBuilder]: For program point L661-1(lines 651 703) no Hoare annotation was computed. [2023-12-20 14:44:45,490 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 0)) (.cse15 (= ~p_num_write~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse1 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= ~q_free~0 0)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse12 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse13 (= ~q_free~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse17 (= ~p_dw_st~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse1 .cse18 .cse8 .cse9 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse1 .cse18 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse8 .cse9 .cse11))) [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 472) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2023-12-20 14:44:45,491 INFO L895 garLoopResultBuilder]: At program point L200-1(lines 168 203) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~q_free~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (not (= ~E_2~0 0))) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_st~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse5 (= ~q_free~0 0) .cse6 .cse8 .cse9 .cse11 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse10))) [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point L244(lines 231 246) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 228 247) the Hoare annotation is: true [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point L641(lines 623 643) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 637) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point L628(lines 628 638) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 639) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 620 644) the Hoare annotation is: true [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 620 644) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point L762-1(lines 751 784) no Hoare annotation was computed. [2023-12-20 14:44:45,491 INFO L899 garLoopResultBuilder]: For program point L752-1(lines 751 784) no Hoare annotation was computed. [2023-12-20 14:44:45,492 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 748 785) the Hoare annotation is: (let ((.cse5 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse23 (= ~m_pc~0 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse22 (< ~m_st~0 2)) (.cse0 (< ~t1_st~0 2)) (.cse12 (< 0 ~t2_pc~0)) (.cse25 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse24 (< 0 ~t1_pc~0)) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (< |old(~E_1~0)| 2)) (.cse11 (< |old(~E_M~0)| 2)) (.cse13 (< |old(~T2_E~0)| 2)) (.cse14 (not (= ~m_st~0 0))) (.cse15 (< |old(~E_2~0)| 2)) (.cse20 (not (= ~t2_pc~0 1))) (.cse21 (< ~t2_st~0 2)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (< |old(~T1_E~0)| 2)) (.cse18 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 (not (= ~token~0 (+ 2 ~local~0))) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse1 (and (<= ~t1_pc~0 0) (<= ~m_pc~0 0)) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21 .cse16 .cse18) (or .cse1 .cse2 .cse22 .cse4 .cse6 .cse7 .cse23 .cse8 .cse9 (= |old(~E_2~0)| 0) .cse16 .cse18) (or .cse1 .cse24 .cse2 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse1 .cse2 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse15 .cse21 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21 .cse16 .cse18) (or .cse0 .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 (not (= (+ ~local~0 1) ~token~0)) .cse16 .cse17 .cse18) (or .cse1 .cse24 .cse2 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18 .cse19))) [2023-12-20 14:44:45,492 INFO L899 garLoopResultBuilder]: For program point L777-1(lines 748 785) no Hoare annotation was computed. [2023-12-20 14:44:45,492 INFO L899 garLoopResultBuilder]: For program point L767-1(lines 751 784) no Hoare annotation was computed. [2023-12-20 14:44:45,492 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 748 785) no Hoare annotation was computed. [2023-12-20 14:44:45,492 INFO L899 garLoopResultBuilder]: For program point L757-1(lines 751 784) no Hoare annotation was computed. [2023-12-20 14:44:45,492 INFO L899 garLoopResultBuilder]: For program point L772-1(lines 751 784) no Hoare annotation was computed. [2023-12-20 14:44:45,494 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:44:45,495 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 14:44:45,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 02:44:45 BoogieIcfgContainer [2023-12-20 14:44:45,525 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 14:44:45,525 INFO L158 Benchmark]: Toolchain (without parser) took 82333.60ms. Allocated memory was 209.7MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 152.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2023-12-20 14:44:45,526 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 209.7MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 14:44:45,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.63ms. Allocated memory is still 209.7MB. Free memory was 152.4MB in the beginning and 135.0MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-20 14:44:45,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.08ms. Allocated memory is still 209.7MB. Free memory was 135.0MB in the beginning and 131.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 14:44:45,526 INFO L158 Benchmark]: Boogie Preprocessor took 47.11ms. Allocated memory is still 209.7MB. Free memory was 131.9MB in the beginning and 128.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 14:44:45,526 INFO L158 Benchmark]: RCFGBuilder took 677.83ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 128.7MB in the beginning and 207.1MB in the end (delta: -78.3MB). Peak memory consumption was 30.6MB. Max. memory is 8.0GB. [2023-12-20 14:44:45,526 INFO L158 Benchmark]: TraceAbstraction took 81287.37ms. Allocated memory was 251.7MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 206.5MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-12-20 14:44:45,527 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.51ms. Allocated memory is still 209.7MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.63ms. Allocated memory is still 209.7MB. Free memory was 152.4MB in the beginning and 135.0MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.08ms. Allocated memory is still 209.7MB. Free memory was 135.0MB in the beginning and 131.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.11ms. Allocated memory is still 209.7MB. Free memory was 131.9MB in the beginning and 128.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 677.83ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 128.7MB in the beginning and 207.1MB in the end (delta: -78.3MB). Peak memory consumption was 30.6MB. Max. memory is 8.0GB. * TraceAbstraction took 81287.37ms. Allocated memory was 251.7MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 206.5MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 390]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 181 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 81.2s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 44.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9455 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9226 mSDsluCounter, 15584 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9230 mSDsCounter, 1087 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11009 IncrementalHoareTripleChecker+Invalid, 12096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1087 mSolverCounterUnsat, 6354 mSDtfsCounter, 11009 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3279 GetRequests, 3035 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18579occurred in iteration=24, InterpolantAutomatonStates: 226, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 7339 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 12085 PreInvPairs, 13328 NumberOfFragments, 18556 HoareAnnotationTreeSize, 12085 FormulaSimplifications, 36744 FormulaSimplificationTreeSizeReduction, 15.4s HoareSimplificationTime, 39 FormulaSimplificationsInter, 171445 FormulaSimplificationTreeSizeReductionInter, 28.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 5828 NumberOfCodeBlocks, 5828 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 5897 ConstructedInterpolants, 0 QuantifiedInterpolants, 10016 SizeOfPredicates, 3 NumberOfNonLiveVariables, 8650 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 52 InterpolantComputations, 32 PerfectInterpolantSequences, 3122/3474 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0)) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) - InvariantResult [Line: 923]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0)) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0))) || ((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && ((0 < t1_pc) || (0 < m_pc))) && (q_free == 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0)) && ((m_pc < 1) || ((t1_pc <= 1) && (2 <= m_pc))))) || (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0))) - InvariantResult [Line: 475]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0)) || ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) || (((((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) - InvariantResult [Line: 651]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0)) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0))) || ((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && ((0 < t1_pc) || (0 < m_pc))) && (q_free == 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0)) && ((m_pc < 1) || ((t1_pc <= 1) && (2 <= m_pc))))) || (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0))) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((c_dr_st == 2) && (c_dr_pc == 0)) || (((((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (p_dw_st == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 2) && (c_dr_pc == 0)) || (((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((c_dr_st == 2) && (c_dr_pc == 0)) || (((((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (p_dw_st == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) RESULT: Ultimate proved your program to be correct! [2023-12-20 14:44:45,540 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...