/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/systemc/mem_slave_tlm.2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 11:11:47,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 11:11:47,577 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-21 11:11:47,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 11:11:47,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 11:11:47,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 11:11:47,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 11:11:47,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 11:11:47,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 11:11:47,599 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 11:11:47,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 11:11:47,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 11:11:47,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 11:11:47,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 11:11:47,601 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 11:11:47,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 11:11:47,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 11:11:47,602 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 11:11:47,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 11:11:47,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 11:11:47,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 11:11:47,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 11:11:47,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 11:11:47,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 11:11:47,604 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 11:11:47,604 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 11:11:47,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 11:11:47,605 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 11:11:47,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 11:11:47,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 11:11:47,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 11:11:47,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 11:11:47,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:11:47,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 11:11:47,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 11:11:47,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 11:11:47,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 11:11:47,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 11:11:47,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 11:11:47,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 11:11:47,607 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 11:11:47,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 11:11:47,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 11:11:47,607 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-21 11:11:47,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 11:11:47,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 11:11:47,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 11:11:47,843 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 11:11:47,843 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 11:11:47,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/mem_slave_tlm.2.cil.c [2023-12-21 11:11:48,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 11:11:49,154 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 11:11:49,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.2.cil.c [2023-12-21 11:11:49,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e408c01e/95cfd9302c7c466989b4719bdc097dff/FLAG79f58b42b [2023-12-21 11:11:49,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e408c01e/95cfd9302c7c466989b4719bdc097dff [2023-12-21 11:11:49,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 11:11:49,181 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 11:11:49,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 11:11:49,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 11:11:49,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 11:11:49,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c51196f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49, skipping insertion in model container [2023-12-21 11:11:49,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,239 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 11:11:49,369 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.2.cil.c[646,659] [2023-12-21 11:11:49,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:11:49,468 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 11:11:49,483 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.2.cil.c[646,659] [2023-12-21 11:11:49,555 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:11:49,571 INFO L206 MainTranslator]: Completed translation [2023-12-21 11:11:49,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49 WrapperNode [2023-12-21 11:11:49,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 11:11:49,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 11:11:49,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 11:11:49,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 11:11:49,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,630 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 852 [2023-12-21 11:11:49,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 11:11:49,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 11:11:49,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 11:11:49,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 11:11:49,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,660 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-21 11:11:49,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 11:11:49,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 11:11:49,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 11:11:49,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 11:11:49,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (1/1) ... [2023-12-21 11:11:49,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:11:49,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:49,753 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-21 11:11:49,775 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-21 11:11:49,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 11:11:49,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 11:11:49,782 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-21 11:11:49,782 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-21 11:11:49,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 11:11:49,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 11:11:49,883 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 11:11:49,884 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 11:11:50,570 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 11:11:50,631 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 11:11:50,631 INFO L309 CfgBuilder]: Removed 13 assume(true) statements. [2023-12-21 11:11:50,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:11:50 BoogieIcfgContainer [2023-12-21 11:11:50,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 11:11:50,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 11:11:50,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 11:11:50,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 11:11:50,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:11:49" (1/3) ... [2023-12-21 11:11:50,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2126fdc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:11:50, skipping insertion in model container [2023-12-21 11:11:50,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:49" (2/3) ... [2023-12-21 11:11:50,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2126fdc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:11:50, skipping insertion in model container [2023-12-21 11:11:50,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:11:50" (3/3) ... [2023-12-21 11:11:50,639 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2023-12-21 11:11:50,652 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 11:11:50,652 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 11:11:50,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 11:11:50,706 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;@4fdb4abd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 11:11:50,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 11:11:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 241 states have (on average 1.937759336099585) internal successors, (467), 247 states have internal predecessors, (467), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 11:11:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 11:11:50,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:50,721 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] [2023-12-21 11:11:50,721 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:50,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:50,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1846885785, now seen corresponding path program 1 times [2023-12-21 11:11:50,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:50,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603621109] [2023-12-21 11:11:50,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:50,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:50,983 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-21 11:11:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:50,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603621109] [2023-12-21 11:11:50,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603621109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:50,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:50,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 11:11:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555301420] [2023-12-21 11:11:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:50,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:50,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:51,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:51,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:51,018 INFO L87 Difference]: Start difference. First operand has 249 states, 241 states have (on average 1.937759336099585) internal successors, (467), 247 states have internal predecessors, (467), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:51,350 INFO L93 Difference]: Finished difference Result 656 states and 1255 transitions. [2023-12-21 11:11:51,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:51,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-21 11:11:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:51,371 INFO L225 Difference]: With dead ends: 656 [2023-12-21 11:11:51,371 INFO L226 Difference]: Without dead ends: 407 [2023-12-21 11:11:51,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:51,382 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 243 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:51,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 694 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:11:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-12-21 11:11:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 400. [2023-12-21 11:11:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 394 states have (on average 1.6370558375634519) internal successors, (645), 398 states have internal predecessors, (645), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 650 transitions. [2023-12-21 11:11:51,463 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 650 transitions. Word has length 26 [2023-12-21 11:11:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:51,463 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 650 transitions. [2023-12-21 11:11:51,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 650 transitions. [2023-12-21 11:11:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 11:11:51,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:51,472 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] [2023-12-21 11:11:51,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 11:11:51,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:51,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:51,473 INFO L85 PathProgramCache]: Analyzing trace with hash 242253487, now seen corresponding path program 1 times [2023-12-21 11:11:51,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564104367] [2023-12-21 11:11:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:51,554 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-21 11:11:51,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:51,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564104367] [2023-12-21 11:11:51,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564104367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:51,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:51,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:11:51,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798837030] [2023-12-21 11:11:51,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:51,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:51,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:51,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:51,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:51,566 INFO L87 Difference]: Start difference. First operand 400 states and 650 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:51,702 INFO L93 Difference]: Finished difference Result 1048 states and 1728 transitions. [2023-12-21 11:11:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:51,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-21 11:11:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:51,706 INFO L225 Difference]: With dead ends: 1048 [2023-12-21 11:11:51,706 INFO L226 Difference]: Without dead ends: 661 [2023-12-21 11:11:51,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:51,708 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 308 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:51,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 924 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2023-12-21 11:11:51,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 654. [2023-12-21 11:11:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 648 states have (on average 1.6682098765432098) internal successors, (1081), 652 states have internal predecessors, (1081), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1086 transitions. [2023-12-21 11:11:51,731 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1086 transitions. Word has length 36 [2023-12-21 11:11:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:51,731 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 1086 transitions. [2023-12-21 11:11:51,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1086 transitions. [2023-12-21 11:11:51,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 11:11:51,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:51,733 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-21 11:11:51,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 11:11:51,733 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:51,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1958989152, now seen corresponding path program 1 times [2023-12-21 11:11:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:51,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727049664] [2023-12-21 11:11:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:51,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:51,790 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-21 11:11:51,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:51,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727049664] [2023-12-21 11:11:51,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727049664] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:51,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:51,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 11:11:51,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679141707] [2023-12-21 11:11:51,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:51,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:51,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:51,793 INFO L87 Difference]: Start difference. First operand 654 states and 1086 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:51,872 INFO L93 Difference]: Finished difference Result 1644 states and 2735 transitions. [2023-12-21 11:11:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:51,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-21 11:11:51,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:51,877 INFO L225 Difference]: With dead ends: 1644 [2023-12-21 11:11:51,877 INFO L226 Difference]: Without dead ends: 1014 [2023-12-21 11:11:51,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:51,879 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 332 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:51,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 734 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2023-12-21 11:11:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1003. [2023-12-21 11:11:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 997 states have (on average 1.6639919759277833) internal successors, (1659), 1001 states have internal predecessors, (1659), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1664 transitions. [2023-12-21 11:11:51,910 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1664 transitions. Word has length 37 [2023-12-21 11:11:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:51,910 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1664 transitions. [2023-12-21 11:11:51,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1664 transitions. [2023-12-21 11:11:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-21 11:11:51,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:51,912 INFO L195 NwaCegarLoop]: trace histogram [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-21 11:11:51,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 11:11:51,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:51,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1906881250, now seen corresponding path program 1 times [2023-12-21 11:11:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:51,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697624870] [2023-12-21 11:11:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:52,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:52,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697624870] [2023-12-21 11:11:52,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697624870] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:52,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:52,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:11:52,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10118570] [2023-12-21 11:11:52,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:52,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:11:52,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:52,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:11:52,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:11:52,006 INFO L87 Difference]: Start difference. First operand 1003 states and 1664 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:52,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:52,452 INFO L93 Difference]: Finished difference Result 3542 states and 5892 transitions. [2023-12-21 11:11:52,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:11:52,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-12-21 11:11:52,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:52,464 INFO L225 Difference]: With dead ends: 3542 [2023-12-21 11:11:52,464 INFO L226 Difference]: Without dead ends: 2563 [2023-12-21 11:11:52,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-21 11:11:52,475 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 1097 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:52,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 1435 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:11:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2023-12-21 11:11:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2077. [2023-12-21 11:11:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2077 states, 2071 states have (on average 1.6605504587155964) internal successors, (3439), 2075 states have internal predecessors, (3439), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 3444 transitions. [2023-12-21 11:11:52,577 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 3444 transitions. Word has length 43 [2023-12-21 11:11:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:52,578 INFO L495 AbstractCegarLoop]: Abstraction has 2077 states and 3444 transitions. [2023-12-21 11:11:52,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 3444 transitions. [2023-12-21 11:11:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 11:11:52,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:52,580 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] [2023-12-21 11:11:52,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 11:11:52,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:52,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1797812072, now seen corresponding path program 1 times [2023-12-21 11:11:52,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:52,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971755586] [2023-12-21 11:11:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:52,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:52,691 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-21 11:11:52,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:52,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971755586] [2023-12-21 11:11:52,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971755586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:52,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:52,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:11:52,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106677206] [2023-12-21 11:11:52,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:52,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:11:52,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:52,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:11:52,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:11:52,693 INFO L87 Difference]: Start difference. First operand 2077 states and 3444 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:53,084 INFO L93 Difference]: Finished difference Result 6074 states and 9947 transitions. [2023-12-21 11:11:53,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:11:53,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-21 11:11:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:53,101 INFO L225 Difference]: With dead ends: 6074 [2023-12-21 11:11:53,101 INFO L226 Difference]: Without dead ends: 4015 [2023-12-21 11:11:53,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-21 11:11:53,107 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 700 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:53,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 931 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:11:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4015 states. [2023-12-21 11:11:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4015 to 3665. [2023-12-21 11:11:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3665 states, 3659 states have (on average 1.624487564908445) internal successors, (5944), 3663 states have internal predecessors, (5944), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 5949 transitions. [2023-12-21 11:11:53,229 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 5949 transitions. Word has length 50 [2023-12-21 11:11:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:53,231 INFO L495 AbstractCegarLoop]: Abstraction has 3665 states and 5949 transitions. [2023-12-21 11:11:53,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:53,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 5949 transitions. [2023-12-21 11:11:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 11:11:53,232 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:53,233 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] [2023-12-21 11:11:53,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 11:11:53,233 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:53,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:53,234 INFO L85 PathProgramCache]: Analyzing trace with hash 346972065, now seen corresponding path program 1 times [2023-12-21 11:11:53,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:53,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328292936] [2023-12-21 11:11:53,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:53,284 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-21 11:11:53,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:53,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328292936] [2023-12-21 11:11:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328292936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:53,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:53,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 11:11:53,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243792695] [2023-12-21 11:11:53,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:53,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:53,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:53,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:53,286 INFO L87 Difference]: Start difference. First operand 3665 states and 5949 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:53,445 INFO L93 Difference]: Finished difference Result 8702 states and 14082 transitions. [2023-12-21 11:11:53,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:53,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-21 11:11:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:53,463 INFO L225 Difference]: With dead ends: 8702 [2023-12-21 11:11:53,464 INFO L226 Difference]: Without dead ends: 5059 [2023-12-21 11:11:53,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:53,470 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 347 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:53,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 633 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5059 states. [2023-12-21 11:11:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5059 to 4783. [2023-12-21 11:11:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4777 states have (on average 1.6043541971948923) internal successors, (7664), 4781 states have internal predecessors, (7664), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 7669 transitions. [2023-12-21 11:11:53,660 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 7669 transitions. Word has length 50 [2023-12-21 11:11:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:53,662 INFO L495 AbstractCegarLoop]: Abstraction has 4783 states and 7669 transitions. [2023-12-21 11:11:53,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 7669 transitions. [2023-12-21 11:11:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-21 11:11:53,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:53,664 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] [2023-12-21 11:11:53,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 11:11:53,665 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:53,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:53,665 INFO L85 PathProgramCache]: Analyzing trace with hash 524791694, now seen corresponding path program 1 times [2023-12-21 11:11:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:53,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849717877] [2023-12-21 11:11:53,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:53,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:53,728 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-21 11:11:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849717877] [2023-12-21 11:11:53,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849717877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:53,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:11:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665966265] [2023-12-21 11:11:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:53,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:53,731 INFO L87 Difference]: Start difference. First operand 4783 states and 7669 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:54,084 INFO L93 Difference]: Finished difference Result 11559 states and 18617 transitions. [2023-12-21 11:11:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-21 11:11:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:54,109 INFO L225 Difference]: With dead ends: 11559 [2023-12-21 11:11:54,109 INFO L226 Difference]: Without dead ends: 6798 [2023-12-21 11:11:54,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:54,117 INFO L413 NwaCegarLoop]: 522 mSDtfsCounter, 233 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:54,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 783 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:11:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6798 states. [2023-12-21 11:11:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6798 to 5531. [2023-12-21 11:11:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5531 states, 5525 states have (on average 1.5491402714932128) internal successors, (8559), 5529 states have internal predecessors, (8559), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 8564 transitions. [2023-12-21 11:11:54,338 INFO L78 Accepts]: Start accepts. Automaton has 5531 states and 8564 transitions. Word has length 55 [2023-12-21 11:11:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:54,338 INFO L495 AbstractCegarLoop]: Abstraction has 5531 states and 8564 transitions. [2023-12-21 11:11:54,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5531 states and 8564 transitions. [2023-12-21 11:11:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-21 11:11:54,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:54,341 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] [2023-12-21 11:11:54,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 11:11:54,341 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:54,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1311066694, now seen corresponding path program 1 times [2023-12-21 11:11:54,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:54,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890254167] [2023-12-21 11:11:54,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:54,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:54,429 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-21 11:11:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890254167] [2023-12-21 11:11:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890254167] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:54,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:54,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 11:11:54,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339330868] [2023-12-21 11:11:54,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:54,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:54,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:54,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:54,431 INFO L87 Difference]: Start difference. First operand 5531 states and 8564 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:54,616 INFO L93 Difference]: Finished difference Result 10906 states and 16906 transitions. [2023-12-21 11:11:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:54,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-12-21 11:11:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:54,647 INFO L225 Difference]: With dead ends: 10906 [2023-12-21 11:11:54,648 INFO L226 Difference]: Without dead ends: 5397 [2023-12-21 11:11:54,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:54,657 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 324 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:54,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 397 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2023-12-21 11:11:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 5397. [2023-12-21 11:11:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5397 states, 5391 states have (on average 1.5288443702467074) internal successors, (8242), 5395 states have internal predecessors, (8242), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5397 states to 5397 states and 8247 transitions. [2023-12-21 11:11:54,824 INFO L78 Accepts]: Start accepts. Automaton has 5397 states and 8247 transitions. Word has length 57 [2023-12-21 11:11:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:54,824 INFO L495 AbstractCegarLoop]: Abstraction has 5397 states and 8247 transitions. [2023-12-21 11:11:54,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5397 states and 8247 transitions. [2023-12-21 11:11:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 11:11:54,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:54,827 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] [2023-12-21 11:11:54,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 11:11:54,827 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:54,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1296691314, now seen corresponding path program 1 times [2023-12-21 11:11:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:54,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004341028] [2023-12-21 11:11:54,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:54,875 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-21 11:11:54,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:54,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004341028] [2023-12-21 11:11:54,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004341028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:54,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:54,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:11:54,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705339823] [2023-12-21 11:11:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:54,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:54,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:54,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:54,878 INFO L87 Difference]: Start difference. First operand 5397 states and 8247 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:55,053 INFO L93 Difference]: Finished difference Result 10419 states and 16042 transitions. [2023-12-21 11:11:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:55,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-21 11:11:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:55,063 INFO L225 Difference]: With dead ends: 10419 [2023-12-21 11:11:55,063 INFO L226 Difference]: Without dead ends: 5044 [2023-12-21 11:11:55,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:55,069 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 150 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:55,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 824 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:55,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5044 states. [2023-12-21 11:11:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5044 to 4377. [2023-12-21 11:11:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4377 states, 4371 states have (on average 1.5536490505605125) internal successors, (6791), 4375 states have internal predecessors, (6791), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4377 states to 4377 states and 6796 transitions. [2023-12-21 11:11:55,183 INFO L78 Accepts]: Start accepts. Automaton has 4377 states and 6796 transitions. Word has length 58 [2023-12-21 11:11:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:55,184 INFO L495 AbstractCegarLoop]: Abstraction has 4377 states and 6796 transitions. [2023-12-21 11:11:55,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4377 states and 6796 transitions. [2023-12-21 11:11:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-21 11:11:55,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:55,185 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] [2023-12-21 11:11:55,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 11:11:55,186 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:55,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:55,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1299520037, now seen corresponding path program 1 times [2023-12-21 11:11:55,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:55,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911544315] [2023-12-21 11:11:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:55,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:55,246 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-21 11:11:55,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:55,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911544315] [2023-12-21 11:11:55,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911544315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:55,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:55,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:11:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937849984] [2023-12-21 11:11:55,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:55,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:11:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:11:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:11:55,247 INFO L87 Difference]: Start difference. First operand 4377 states and 6796 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:55,777 INFO L93 Difference]: Finished difference Result 12782 states and 19835 transitions. [2023-12-21 11:11:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 11:11:55,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-21 11:11:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:55,798 INFO L225 Difference]: With dead ends: 12782 [2023-12-21 11:11:55,798 INFO L226 Difference]: Without dead ends: 8607 [2023-12-21 11:11:55,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-21 11:11:55,803 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 908 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:55,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 2171 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:11:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8607 states. [2023-12-21 11:11:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8607 to 5921. [2023-12-21 11:11:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5921 states, 5915 states have (on average 1.555874894336433) internal successors, (9203), 5919 states have internal predecessors, (9203), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5921 states to 5921 states and 9208 transitions. [2023-12-21 11:11:55,974 INFO L78 Accepts]: Start accepts. Automaton has 5921 states and 9208 transitions. Word has length 60 [2023-12-21 11:11:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:55,975 INFO L495 AbstractCegarLoop]: Abstraction has 5921 states and 9208 transitions. [2023-12-21 11:11:55,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 5921 states and 9208 transitions. [2023-12-21 11:11:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-21 11:11:55,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:55,976 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-21 11:11:55,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 11:11:55,977 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:55,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:55,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1129675064, now seen corresponding path program 1 times [2023-12-21 11:11:55,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:55,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244087897] [2023-12-21 11:11:55,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:55,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:56,067 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-21 11:11:56,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:56,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244087897] [2023-12-21 11:11:56,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244087897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:56,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:56,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:11:56,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704036100] [2023-12-21 11:11:56,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:56,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:11:56,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:56,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:11:56,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:11:56,069 INFO L87 Difference]: Start difference. First operand 5921 states and 9208 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:56,403 INFO L93 Difference]: Finished difference Result 14290 states and 22055 transitions. [2023-12-21 11:11:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 11:11:56,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-21 11:11:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:56,417 INFO L225 Difference]: With dead ends: 14290 [2023-12-21 11:11:56,417 INFO L226 Difference]: Without dead ends: 8571 [2023-12-21 11:11:56,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-21 11:11:56,424 INFO L413 NwaCegarLoop]: 496 mSDtfsCounter, 812 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:56,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 2704 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8571 states. [2023-12-21 11:11:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8571 to 6261. [2023-12-21 11:11:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6261 states, 6255 states have (on average 1.5448441247002398) internal successors, (9663), 6259 states have internal predecessors, (9663), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6261 states to 6261 states and 9668 transitions. [2023-12-21 11:11:56,606 INFO L78 Accepts]: Start accepts. Automaton has 6261 states and 9668 transitions. Word has length 61 [2023-12-21 11:11:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:56,606 INFO L495 AbstractCegarLoop]: Abstraction has 6261 states and 9668 transitions. [2023-12-21 11:11:56,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 6261 states and 9668 transitions. [2023-12-21 11:11:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 11:11:56,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:56,610 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2023-12-21 11:11:56,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 11:11:56,611 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:56,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:56,611 INFO L85 PathProgramCache]: Analyzing trace with hash 60038850, now seen corresponding path program 1 times [2023-12-21 11:11:56,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:56,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97567216] [2023-12-21 11:11:56,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:56,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:56,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:56,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97567216] [2023-12-21 11:11:56,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97567216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:56,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:56,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 11:11:56,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776650342] [2023-12-21 11:11:56,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:56,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:56,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:56,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:56,641 INFO L87 Difference]: Start difference. First operand 6261 states and 9668 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:56,885 INFO L93 Difference]: Finished difference Result 13273 states and 20446 transitions. [2023-12-21 11:11:56,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:56,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-12-21 11:11:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:56,897 INFO L225 Difference]: With dead ends: 13273 [2023-12-21 11:11:56,898 INFO L226 Difference]: Without dead ends: 7032 [2023-12-21 11:11:56,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:56,905 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 126 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:56,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 732 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:56,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2023-12-21 11:11:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 6946. [2023-12-21 11:11:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6946 states, 6940 states have (on average 1.5377521613832854) internal successors, (10672), 6944 states have internal predecessors, (10672), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6946 states to 6946 states and 10677 transitions. [2023-12-21 11:11:57,126 INFO L78 Accepts]: Start accepts. Automaton has 6946 states and 10677 transitions. Word has length 74 [2023-12-21 11:11:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:57,126 INFO L495 AbstractCegarLoop]: Abstraction has 6946 states and 10677 transitions. [2023-12-21 11:11:57,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 6946 states and 10677 transitions. [2023-12-21 11:11:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-21 11:11:57,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:57,128 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-21 11:11:57,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 11:11:57,129 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:57,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash -891791990, now seen corresponding path program 1 times [2023-12-21 11:11:57,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:57,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417473227] [2023-12-21 11:11:57,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:57,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:57,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:57,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417473227] [2023-12-21 11:11:57,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417473227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:57,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:57,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:11:57,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952217675] [2023-12-21 11:11:57,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:57,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:11:57,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:57,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:11:57,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:11:57,179 INFO L87 Difference]: Start difference. First operand 6946 states and 10677 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:57,685 INFO L93 Difference]: Finished difference Result 18015 states and 27410 transitions. [2023-12-21 11:11:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:11:57,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2023-12-21 11:11:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:57,707 INFO L225 Difference]: With dead ends: 18015 [2023-12-21 11:11:57,707 INFO L226 Difference]: Without dead ends: 10956 [2023-12-21 11:11:57,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-21 11:11:57,716 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 604 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:57,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1119 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:11:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10956 states. [2023-12-21 11:11:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10956 to 9663. [2023-12-21 11:11:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9663 states, 9657 states have (on average 1.5003624313969142) internal successors, (14489), 9661 states have internal predecessors, (14489), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9663 states to 9663 states and 14494 transitions. [2023-12-21 11:11:57,986 INFO L78 Accepts]: Start accepts. Automaton has 9663 states and 14494 transitions. Word has length 85 [2023-12-21 11:11:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:57,986 INFO L495 AbstractCegarLoop]: Abstraction has 9663 states and 14494 transitions. [2023-12-21 11:11:57,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 9663 states and 14494 transitions. [2023-12-21 11:11:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-21 11:11:57,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:57,989 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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-21 11:11:57,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 11:11:57,989 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:57,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1043685481, now seen corresponding path program 1 times [2023-12-21 11:11:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:57,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639099410] [2023-12-21 11:11:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:57,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:58,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:58,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639099410] [2023-12-21 11:11:58,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639099410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:58,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:58,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:11:58,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106900104] [2023-12-21 11:11:58,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:58,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:58,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:58,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:58,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:58,038 INFO L87 Difference]: Start difference. First operand 9663 states and 14494 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:58,247 INFO L93 Difference]: Finished difference Result 13764 states and 20698 transitions. [2023-12-21 11:11:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:58,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-12-21 11:11:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:58,253 INFO L225 Difference]: With dead ends: 13764 [2023-12-21 11:11:58,253 INFO L226 Difference]: Without dead ends: 4111 [2023-12-21 11:11:58,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:58,262 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 319 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:58,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 461 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2023-12-21 11:11:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 4053. [2023-12-21 11:11:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4053 states, 4047 states have (on average 1.4000494193229553) internal successors, (5666), 4051 states have internal predecessors, (5666), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 5671 transitions. [2023-12-21 11:11:58,373 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 5671 transitions. Word has length 91 [2023-12-21 11:11:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:58,373 INFO L495 AbstractCegarLoop]: Abstraction has 4053 states and 5671 transitions. [2023-12-21 11:11:58,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 5671 transitions. [2023-12-21 11:11:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-21 11:11:58,374 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:58,374 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:58,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 11:11:58,375 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:58,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:58,375 INFO L85 PathProgramCache]: Analyzing trace with hash -907817551, now seen corresponding path program 1 times [2023-12-21 11:11:58,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:58,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748362643] [2023-12-21 11:11:58,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:58,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:58,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:58,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748362643] [2023-12-21 11:11:58,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748362643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:58,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:58,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:11:58,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368090139] [2023-12-21 11:11:58,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:58,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:11:58,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:58,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:11:58,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:58,437 INFO L87 Difference]: Start difference. First operand 4053 states and 5671 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:58,684 INFO L93 Difference]: Finished difference Result 9560 states and 13356 transitions. [2023-12-21 11:11:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:11:58,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2023-12-21 11:11:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:58,695 INFO L225 Difference]: With dead ends: 9560 [2023-12-21 11:11:58,695 INFO L226 Difference]: Without dead ends: 5671 [2023-12-21 11:11:58,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-21 11:11:58,704 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 521 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:58,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2121 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:58,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5671 states. [2023-12-21 11:11:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5671 to 4055. [2023-12-21 11:11:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4055 states, 4049 states have (on average 1.3968881205235861) internal successors, (5656), 4053 states have internal predecessors, (5656), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 5661 transitions. [2023-12-21 11:11:58,872 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 5661 transitions. Word has length 95 [2023-12-21 11:11:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:58,872 INFO L495 AbstractCegarLoop]: Abstraction has 4055 states and 5661 transitions. [2023-12-21 11:11:58,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 5661 transitions. [2023-12-21 11:11:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-21 11:11:58,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:58,875 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:58,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 11:11:58,875 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:58,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:58,875 INFO L85 PathProgramCache]: Analyzing trace with hash -886618612, now seen corresponding path program 1 times [2023-12-21 11:11:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:58,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192937125] [2023-12-21 11:11:58,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:58,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:58,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192937125] [2023-12-21 11:11:58,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192937125] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:58,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402120256] [2023-12-21 11:11:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:58,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:58,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:58,946 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-21 11:11:58,951 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-21 11:11:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:59,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:11:59,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:11:59,167 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:11:59,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402120256] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:59,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:11:59,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-12-21 11:11:59,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68965271] [2023-12-21 11:11:59,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:59,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:59,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:59,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:59,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:11:59,169 INFO L87 Difference]: Start difference. First operand 4055 states and 5661 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:59,344 INFO L93 Difference]: Finished difference Result 5190 states and 7234 transitions. [2023-12-21 11:11:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:59,344 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2023-12-21 11:11:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:59,353 INFO L225 Difference]: With dead ends: 5190 [2023-12-21 11:11:59,353 INFO L226 Difference]: Without dead ends: 5186 [2023-12-21 11:11:59,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 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-21 11:11:59,355 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 215 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:59,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 719 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:59,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2023-12-21 11:11:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5048. [2023-12-21 11:11:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5048 states, 5042 states have (on average 1.400833002776676) internal successors, (7063), 5046 states have internal predecessors, (7063), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5048 states to 5048 states and 7068 transitions. [2023-12-21 11:11:59,560 INFO L78 Accepts]: Start accepts. Automaton has 5048 states and 7068 transitions. Word has length 97 [2023-12-21 11:11:59,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:59,560 INFO L495 AbstractCegarLoop]: Abstraction has 5048 states and 7068 transitions. [2023-12-21 11:11:59,560 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 5048 states and 7068 transitions. [2023-12-21 11:11:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-21 11:11:59,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:59,564 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:11:59,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 11:11:59,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-21 11:11:59,770 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:59,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1357555119, now seen corresponding path program 1 times [2023-12-21 11:11:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:59,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608561830] [2023-12-21 11:11:59,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:59,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:59,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608561830] [2023-12-21 11:11:59,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608561830] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:59,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590007203] [2023-12-21 11:11:59,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:59,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:59,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:59,872 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-21 11:11:59,897 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-21 11:12:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:00,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:12:00,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:00,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:12:00,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590007203] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:00,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:12:00,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-12-21 11:12:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475957032] [2023-12-21 11:12:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:00,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:12:00,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:12:00,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:00,090 INFO L87 Difference]: Start difference. First operand 5048 states and 7068 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:00,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:00,266 INFO L93 Difference]: Finished difference Result 8964 states and 12614 transitions. [2023-12-21 11:12:00,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:12:00,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2023-12-21 11:12:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:00,273 INFO L225 Difference]: With dead ends: 8964 [2023-12-21 11:12:00,274 INFO L226 Difference]: Without dead ends: 3927 [2023-12-21 11:12:00,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:00,279 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 245 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:00,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 380 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:12:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2023-12-21 11:12:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 3592. [2023-12-21 11:12:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3592 states, 3586 states have (on average 1.377579475738985) internal successors, (4940), 3590 states have internal predecessors, (4940), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 4945 transitions. [2023-12-21 11:12:00,399 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 4945 transitions. Word has length 148 [2023-12-21 11:12:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:00,399 INFO L495 AbstractCegarLoop]: Abstraction has 3592 states and 4945 transitions. [2023-12-21 11:12:00,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 4945 transitions. [2023-12-21 11:12:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-21 11:12:00,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:00,402 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:12:00,413 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-21 11:12:00,610 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,SelfDestructingSolverStorable16 [2023-12-21 11:12:00,611 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:00,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2041407437, now seen corresponding path program 1 times [2023-12-21 11:12:00,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:00,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835740101] [2023-12-21 11:12:00,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:00,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:00,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:00,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835740101] [2023-12-21 11:12:00,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835740101] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:00,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558200773] [2023-12-21 11:12:00,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:00,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:00,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:00,745 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-21 11:12:00,764 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-21 11:12:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:00,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:12:00,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 11:12:00,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:12:00,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558200773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:00,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:12:00,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-21 11:12:00,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407510898] [2023-12-21 11:12:00,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:00,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:12:00,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:00,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:12:00,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:00,911 INFO L87 Difference]: Start difference. First operand 3592 states and 4945 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:01,047 INFO L93 Difference]: Finished difference Result 7021 states and 9712 transitions. [2023-12-21 11:12:01,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:12:01,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2023-12-21 11:12:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:01,053 INFO L225 Difference]: With dead ends: 7021 [2023-12-21 11:12:01,053 INFO L226 Difference]: Without dead ends: 3592 [2023-12-21 11:12:01,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 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-21 11:12:01,056 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 255 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:01,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 352 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:12:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2023-12-21 11:12:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 3592. [2023-12-21 11:12:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3592 states, 3586 states have (on average 1.3385387618516453) internal successors, (4800), 3590 states have internal predecessors, (4800), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 4805 transitions. [2023-12-21 11:12:01,198 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 4805 transitions. Word has length 151 [2023-12-21 11:12:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:01,198 INFO L495 AbstractCegarLoop]: Abstraction has 3592 states and 4805 transitions. [2023-12-21 11:12:01,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 4805 transitions. [2023-12-21 11:12:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-21 11:12:01,200 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:01,200 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:12:01,233 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-21 11:12:01,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-21 11:12:01,405 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:01,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:01,406 INFO L85 PathProgramCache]: Analyzing trace with hash -293733516, now seen corresponding path program 1 times [2023-12-21 11:12:01,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:01,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414610720] [2023-12-21 11:12:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:01,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:01,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:01,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414610720] [2023-12-21 11:12:01,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414610720] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:01,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182854600] [2023-12-21 11:12:01,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:01,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:01,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:01,515 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-21 11:12:01,519 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-21 11:12:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:01,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:12:01,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 11:12:01,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:12:01,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182854600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:01,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:12:01,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-21 11:12:01,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386862627] [2023-12-21 11:12:01,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:01,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:12:01,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:01,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:12:01,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:01,658 INFO L87 Difference]: Start difference. First operand 3592 states and 4805 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:01,985 INFO L93 Difference]: Finished difference Result 8294 states and 11265 transitions. [2023-12-21 11:12:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:12:01,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2023-12-21 11:12:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:01,994 INFO L225 Difference]: With dead ends: 8294 [2023-12-21 11:12:01,994 INFO L226 Difference]: Without dead ends: 4865 [2023-12-21 11:12:01,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 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-21 11:12:01,998 INFO L413 NwaCegarLoop]: 386 mSDtfsCounter, 190 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:01,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 578 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:12:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2023-12-21 11:12:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 4541. [2023-12-21 11:12:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4541 states, 4535 states have (on average 1.3016538037486218) internal successors, (5903), 4539 states have internal predecessors, (5903), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 5908 transitions. [2023-12-21 11:12:02,122 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 5908 transitions. Word has length 152 [2023-12-21 11:12:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:02,123 INFO L495 AbstractCegarLoop]: Abstraction has 4541 states and 5908 transitions. [2023-12-21 11:12:02,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 5908 transitions. [2023-12-21 11:12:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-21 11:12:02,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:02,125 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:02,136 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-21 11:12:02,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:02,334 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:02,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash -132077224, now seen corresponding path program 1 times [2023-12-21 11:12:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:02,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416489808] [2023-12-21 11:12:02,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:02,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:02,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:02,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416489808] [2023-12-21 11:12:02,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416489808] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:02,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640551357] [2023-12-21 11:12:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:02,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:02,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:02,579 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-21 11:12:02,582 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-21 11:12:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:02,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 11:12:02,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:02,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:12:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:03,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640551357] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:12:03,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:12:03,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2023-12-21 11:12:03,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996409167] [2023-12-21 11:12:03,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:12:03,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 11:12:03,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:03,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 11:12:03,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-21 11:12:03,006 INFO L87 Difference]: Start difference. First operand 4541 states and 5908 transitions. Second operand has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:03,498 INFO L93 Difference]: Finished difference Result 12750 states and 16603 transitions. [2023-12-21 11:12:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 11:12:03,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2023-12-21 11:12:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:03,514 INFO L225 Difference]: With dead ends: 12750 [2023-12-21 11:12:03,514 INFO L226 Difference]: Without dead ends: 8372 [2023-12-21 11:12:03,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2023-12-21 11:12:03,521 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 892 mSDsluCounter, 3520 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 4027 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:03,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 4027 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:12:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8372 states. [2023-12-21 11:12:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8372 to 7057. [2023-12-21 11:12:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7057 states, 7051 states have (on average 1.3149907814494397) internal successors, (9272), 7055 states have internal predecessors, (9272), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7057 states to 7057 states and 9277 transitions. [2023-12-21 11:12:03,765 INFO L78 Accepts]: Start accepts. Automaton has 7057 states and 9277 transitions. Word has length 154 [2023-12-21 11:12:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:03,765 INFO L495 AbstractCegarLoop]: Abstraction has 7057 states and 9277 transitions. [2023-12-21 11:12:03,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 7057 states and 9277 transitions. [2023-12-21 11:12:03,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-12-21 11:12:03,768 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:03,768 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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-21 11:12:03,776 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-21 11:12:03,975 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-21 11:12:03,975 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:03,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 308126803, now seen corresponding path program 1 times [2023-12-21 11:12:03,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:03,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926208365] [2023-12-21 11:12:03,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 98 proven. 99 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-21 11:12:04,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:04,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926208365] [2023-12-21 11:12:04,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926208365] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:04,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852931082] [2023-12-21 11:12:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:04,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:04,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:04,251 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-21 11:12:04,271 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-21 11:12:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:04,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 11:12:04,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-21 11:12:04,612 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:12:04,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852931082] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:04,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:12:04,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2023-12-21 11:12:04,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397383411] [2023-12-21 11:12:04,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:04,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:12:04,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:04,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:12:04,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:12:04,614 INFO L87 Difference]: Start difference. First operand 7057 states and 9277 transitions. Second operand has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:04,982 INFO L93 Difference]: Finished difference Result 14750 states and 19332 transitions. [2023-12-21 11:12:04,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 11:12:04,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2023-12-21 11:12:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:04,996 INFO L225 Difference]: With dead ends: 14750 [2023-12-21 11:12:04,996 INFO L226 Difference]: Without dead ends: 7853 [2023-12-21 11:12:05,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-12-21 11:12:05,004 INFO L413 NwaCegarLoop]: 683 mSDtfsCounter, 968 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:05,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 2091 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:12:05,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7853 states. [2023-12-21 11:12:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7853 to 6941. [2023-12-21 11:12:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6941 states, 6935 states have (on average 1.313914924297044) internal successors, (9112), 6939 states have internal predecessors, (9112), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6941 states to 6941 states and 9117 transitions. [2023-12-21 11:12:05,312 INFO L78 Accepts]: Start accepts. Automaton has 6941 states and 9117 transitions. Word has length 249 [2023-12-21 11:12:05,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:05,312 INFO L495 AbstractCegarLoop]: Abstraction has 6941 states and 9117 transitions. [2023-12-21 11:12:05,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 6941 states and 9117 transitions. [2023-12-21 11:12:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2023-12-21 11:12:05,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:05,316 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:05,323 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-21 11:12:05,520 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-21 11:12:05,520 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:05,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:05,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1590507305, now seen corresponding path program 1 times [2023-12-21 11:12:05,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:05,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129763329] [2023-12-21 11:12:05,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:05,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-21 11:12:05,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:05,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129763329] [2023-12-21 11:12:05,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129763329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:05,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:05,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:12:05,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490515506] [2023-12-21 11:12:05,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:05,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:12:05,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:05,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:12:05,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:12:05,614 INFO L87 Difference]: Start difference. First operand 6941 states and 9117 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:05,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:05,770 INFO L93 Difference]: Finished difference Result 7759 states and 10041 transitions. [2023-12-21 11:12:05,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:12:05,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 250 [2023-12-21 11:12:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:05,772 INFO L225 Difference]: With dead ends: 7759 [2023-12-21 11:12:05,773 INFO L226 Difference]: Without dead ends: 874 [2023-12-21 11:12:05,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:12:05,779 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 124 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:05,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 344 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:12:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2023-12-21 11:12:05,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2023-12-21 11:12:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 868 states have (on average 1.087557603686636) internal successors, (944), 870 states have internal predecessors, (944), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 947 transitions. [2023-12-21 11:12:05,822 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 947 transitions. Word has length 250 [2023-12-21 11:12:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:05,822 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 947 transitions. [2023-12-21 11:12:05,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 947 transitions. [2023-12-21 11:12:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-12-21 11:12:05,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:05,826 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:05,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 11:12:05,826 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:05,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash -985731691, now seen corresponding path program 1 times [2023-12-21 11:12:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541927221] [2023-12-21 11:12:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-21 11:12:05,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:05,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541927221] [2023-12-21 11:12:05,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541927221] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:05,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:05,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:12:05,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125488587] [2023-12-21 11:12:05,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:05,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:12:05,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:05,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:12:05,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:12:05,986 INFO L87 Difference]: Start difference. First operand 872 states and 947 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:06,118 INFO L93 Difference]: Finished difference Result 1169 states and 1268 transitions. [2023-12-21 11:12:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:12:06,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2023-12-21 11:12:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:06,121 INFO L225 Difference]: With dead ends: 1169 [2023-12-21 11:12:06,121 INFO L226 Difference]: Without dead ends: 885 [2023-12-21 11:12:06,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-21 11:12:06,123 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 215 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:06,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1344 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:12:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2023-12-21 11:12:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 870. [2023-12-21 11:12:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 866 states have (on average 1.0831408775981524) internal successors, (938), 868 states have internal predecessors, (938), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 941 transitions. [2023-12-21 11:12:06,155 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 941 transitions. Word has length 251 [2023-12-21 11:12:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:06,156 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 941 transitions. [2023-12-21 11:12:06,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 941 transitions. [2023-12-21 11:12:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-12-21 11:12:06,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:06,158 INFO L195 NwaCegarLoop]: trace histogram [5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:06,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-21 11:12:06,159 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:06,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:06,159 INFO L85 PathProgramCache]: Analyzing trace with hash 7829070, now seen corresponding path program 1 times [2023-12-21 11:12:06,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:06,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91979105] [2023-12-21 11:12:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-21 11:12:06,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:06,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91979105] [2023-12-21 11:12:06,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91979105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:06,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:06,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:12:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206302582] [2023-12-21 11:12:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:06,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:12:06,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:06,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:12:06,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:12:06,255 INFO L87 Difference]: Start difference. First operand 870 states and 941 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:06,333 INFO L93 Difference]: Finished difference Result 1147 states and 1237 transitions. [2023-12-21 11:12:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 11:12:06,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 252 [2023-12-21 11:12:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:06,335 INFO L225 Difference]: With dead ends: 1147 [2023-12-21 11:12:06,335 INFO L226 Difference]: Without dead ends: 859 [2023-12-21 11:12:06,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-21 11:12:06,336 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 170 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:06,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 768 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:12:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2023-12-21 11:12:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 853. [2023-12-21 11:12:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 850 states have (on average 1.0658823529411765) internal successors, (906), 851 states have internal predecessors, (906), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 908 transitions. [2023-12-21 11:12:06,369 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 908 transitions. Word has length 252 [2023-12-21 11:12:06,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:06,370 INFO L495 AbstractCegarLoop]: Abstraction has 853 states and 908 transitions. [2023-12-21 11:12:06,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:06,370 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 908 transitions. [2023-12-21 11:12:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2023-12-21 11:12:06,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:06,374 INFO L195 NwaCegarLoop]: trace histogram [6, 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, 3, 3, 3, 3, 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, 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, 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, 1, 1, 1, 1, 1, 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-21 11:12:06,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-21 11:12:06,374 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:06,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1534330045, now seen corresponding path program 1 times [2023-12-21 11:12:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:06,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271597366] [2023-12-21 11:12:06,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 37 proven. 137 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-21 11:12:07,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:07,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271597366] [2023-12-21 11:12:07,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271597366] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:07,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463545944] [2023-12-21 11:12:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:07,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:07,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:07,206 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-21 11:12:07,228 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-21 11:12:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:07,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-21 11:12:07,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-21 11:12:07,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:12:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 15 proven. 143 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-21 11:12:08,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463545944] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:12:08,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:12:08,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 28 [2023-12-21 11:12:08,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792384814] [2023-12-21 11:12:08,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:12:08,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 11:12:08,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:08,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 11:12:08,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2023-12-21 11:12:08,299 INFO L87 Difference]: Start difference. First operand 853 states and 908 transitions. Second operand has 28 states, 28 states have (on average 13.928571428571429) internal successors, (390), 28 states have internal predecessors, (390), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:08,837 INFO L93 Difference]: Finished difference Result 867 states and 921 transitions. [2023-12-21 11:12:08,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 11:12:08,837 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 13.928571428571429) internal successors, (390), 28 states have internal predecessors, (390), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 308 [2023-12-21 11:12:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:08,839 INFO L225 Difference]: With dead ends: 867 [2023-12-21 11:12:08,839 INFO L226 Difference]: Without dead ends: 864 [2023-12-21 11:12:08,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 608 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=1603, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 11:12:08,840 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 722 mSDsluCounter, 5646 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 6000 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:08,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 6000 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:12:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2023-12-21 11:12:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 853. [2023-12-21 11:12:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 850 states have (on average 1.0647058823529412) internal successors, (905), 851 states have internal predecessors, (905), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 907 transitions. [2023-12-21 11:12:08,876 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 907 transitions. Word has length 308 [2023-12-21 11:12:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:08,876 INFO L495 AbstractCegarLoop]: Abstraction has 853 states and 907 transitions. [2023-12-21 11:12:08,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 13.928571428571429) internal successors, (390), 28 states have internal predecessors, (390), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 907 transitions. [2023-12-21 11:12:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2023-12-21 11:12:08,881 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:08,881 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:08,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-21 11:12:09,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:09,087 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:09,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:09,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1966940543, now seen corresponding path program 1 times [2023-12-21 11:12:09,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:09,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963870915] [2023-12-21 11:12:09,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:09,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-21 11:12:09,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:09,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963870915] [2023-12-21 11:12:09,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963870915] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:09,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292218752] [2023-12-21 11:12:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:09,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:09,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:09,466 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-21 11:12:09,489 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-21 11:12:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:09,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 11:12:09,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-21 11:12:09,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:12:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-21 11:12:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292218752] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:12:09,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:12:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2023-12-21 11:12:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135177619] [2023-12-21 11:12:09,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:12:09,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 11:12:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 11:12:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-21 11:12:09,924 INFO L87 Difference]: Start difference. First operand 853 states and 907 transitions. Second operand has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:10,119 INFO L93 Difference]: Finished difference Result 958 states and 1015 transitions. [2023-12-21 11:12:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 11:12:10,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2023-12-21 11:12:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:10,121 INFO L225 Difference]: With dead ends: 958 [2023-12-21 11:12:10,121 INFO L226 Difference]: Without dead ends: 860 [2023-12-21 11:12:10,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 707 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2023-12-21 11:12:10,122 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 421 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:10,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 2173 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:12:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2023-12-21 11:12:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 852. [2023-12-21 11:12:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 850 states have (on average 1.06) internal successors, (901), 850 states have internal predecessors, (901), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 902 transitions. [2023-12-21 11:12:10,157 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 902 transitions. Word has length 352 [2023-12-21 11:12:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:10,157 INFO L495 AbstractCegarLoop]: Abstraction has 852 states and 902 transitions. [2023-12-21 11:12:10,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 902 transitions. [2023-12-21 11:12:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2023-12-21 11:12:10,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:10,163 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 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] [2023-12-21 11:12:10,173 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-21 11:12:10,370 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,SelfDestructingSolverStorable25 [2023-12-21 11:12:10,371 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:10,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:10,372 INFO L85 PathProgramCache]: Analyzing trace with hash -711226123, now seen corresponding path program 1 times [2023-12-21 11:12:10,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:10,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160753000] [2023-12-21 11:12:10,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:10,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 72 proven. 342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-21 11:12:11,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:11,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160753000] [2023-12-21 11:12:11,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160753000] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:11,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470889565] [2023-12-21 11:12:11,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:11,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:11,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:11,284 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-21 11:12:11,304 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-21 11:12:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:11,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-21 11:12:11,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 89 proven. 325 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-21 11:12:12,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:12:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 20 proven. 394 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-21 11:12:12,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470889565] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:12:12,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:12:12,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 33 [2023-12-21 11:12:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965060868] [2023-12-21 11:12:12,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:12:12,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-21 11:12:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:12,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-21 11:12:12,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 11:12:12,859 INFO L87 Difference]: Start difference. First operand 852 states and 902 transitions. Second operand has 33 states, 33 states have (on average 18.96969696969697) internal successors, (626), 33 states have internal predecessors, (626), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:13,648 INFO L93 Difference]: Finished difference Result 860 states and 910 transitions. [2023-12-21 11:12:13,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-21 11:12:13,649 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 18.96969696969697) internal successors, (626), 33 states have internal predecessors, (626), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 410 [2023-12-21 11:12:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:13,650 INFO L225 Difference]: With dead ends: 860 [2023-12-21 11:12:13,650 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 11:12:13,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 812 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=290, Invalid=2902, Unknown=0, NotChecked=0, Total=3192 [2023-12-21 11:12:13,652 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 833 mSDsluCounter, 10472 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 10956 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:13,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 10956 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 11:12:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 11:12:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 11:12:13,653 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-21 11:12:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 11:12:13,653 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 410 [2023-12-21 11:12:13,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:13,654 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 11:12:13,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 18.96969696969697) internal successors, (626), 33 states have internal predecessors, (626), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 11:12:13,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 11:12:13,656 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 11:12:13,666 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-21 11:12:13,866 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,SelfDestructingSolverStorable26 [2023-12-21 11:12:13,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 11:12:24,170 WARN L293 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 260 DAG size of output: 377 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-21 11:12:53,815 WARN L293 SmtUtils]: Spent 28.99s on a formula simplification. DAG size of input: 199 DAG size of output: 287 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-21 11:13:05,079 INFO L899 garLoopResultBuilder]: For program point L762(lines 762 766) no Hoare annotation was computed. [2023-12-21 11:13:05,079 INFO L899 garLoopResultBuilder]: For program point $Ultimate##406(lines 769 813) no Hoare annotation was computed. [2023-12-21 11:13:05,079 INFO L899 garLoopResultBuilder]: For program point L696(lines 696 700) no Hoare annotation was computed. [2023-12-21 11:13:05,079 INFO L899 garLoopResultBuilder]: For program point $Ultimate##412(lines 777 812) no Hoare annotation was computed. [2023-12-21 11:13:05,079 INFO L899 garLoopResultBuilder]: For program point L1093(lines 1093 1097) no Hoare annotation was computed. [2023-12-21 11:13:05,079 INFO L899 garLoopResultBuilder]: For program point $Ultimate##418(lines 785 811) no Hoare annotation was computed. [2023-12-21 11:13:05,079 INFO L899 garLoopResultBuilder]: For program point L631(lines 623 640) no Hoare annotation was computed. [2023-12-21 11:13:05,079 INFO L899 garLoopResultBuilder]: For program point $Ultimate##424(lines 793 810) no Hoare annotation was computed. [2023-12-21 11:13:05,079 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2023-12-21 11:13:05,080 INFO L895 garLoopResultBuilder]: At program point L500-2(lines 500 528) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 (<= 1 ~a_t~0) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 .cse10) (and .cse0 (= ~c_req_type~0 0) .cse1 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) .cse2 (= ~req_tt_a~0 0) .cse3 .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse9 .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-12-21 11:13:05,080 INFO L899 garLoopResultBuilder]: For program point s_run_returnLabel#1(lines 856 1117) no Hoare annotation was computed. [2023-12-21 11:13:05,080 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2023-12-21 11:13:05,080 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 240) no Hoare annotation was computed. [2023-12-21 11:13:05,080 INFO L899 garLoopResultBuilder]: For program point L1227(lines 1175 1354) no Hoare annotation was computed. [2023-12-21 11:13:05,080 INFO L899 garLoopResultBuilder]: For program point $Ultimate##430(lines 801 809) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point L501(lines 500 528) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point L369(lines 139 485) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point L1228(lines 1228 1232) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point $Ultimate##200(lines 369 377) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point $Ultimate##442(lines 823 831) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point $Ultimate##606(lines 1276 1320) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point L1031(lines 1005 1032) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point $Ultimate##612(lines 1284 1319) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point $Ultimate##618(lines 1292 1318) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point L569(lines 569 622) no Hoare annotation was computed. [2023-12-21 11:13:05,081 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 135) no Hoare annotation was computed. [2023-12-21 11:13:05,082 INFO L899 garLoopResultBuilder]: For program point L834(lines 834 840) no Hoare annotation was computed. [2023-12-21 11:13:05,082 INFO L899 garLoopResultBuilder]: For program point L834-1(lines 834 840) no Hoare annotation was computed. [2023-12-21 11:13:05,082 INFO L899 garLoopResultBuilder]: For program point $Ultimate##624(lines 1300 1317) no Hoare annotation was computed. [2023-12-21 11:13:05,082 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 574) no Hoare annotation was computed. [2023-12-21 11:13:05,082 INFO L899 garLoopResultBuilder]: For program point m_run_returnLabel#1(lines 90 849) no Hoare annotation was computed. [2023-12-21 11:13:05,082 INFO L899 garLoopResultBuilder]: For program point $Ultimate##630(lines 1308 1316) no Hoare annotation was computed. [2023-12-21 11:13:05,082 INFO L899 garLoopResultBuilder]: For program point L1100(lines 1092 1109) no Hoare annotation was computed. [2023-12-21 11:13:05,082 INFO L895 garLoopResultBuilder]: At program point L836(line 836) the Hoare annotation is: false [2023-12-21 11:13:05,082 INFO L899 garLoopResultBuilder]: For program point $Ultimate##642(lines 1330 1338) no Hoare annotation was computed. [2023-12-21 11:13:05,082 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 774) no Hoare annotation was computed. [2023-12-21 11:13:05,082 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 708) no Hoare annotation was computed. [2023-12-21 11:13:05,082 INFO L899 garLoopResultBuilder]: For program point L110(lines 110 134) no Hoare annotation was computed. [2023-12-21 11:13:05,082 INFO L899 garLoopResultBuilder]: For program point L1101(lines 1101 1105) no Hoare annotation was computed. [2023-12-21 11:13:05,083 INFO L899 garLoopResultBuilder]: For program point L1301(lines 1301 1305) no Hoare annotation was computed. [2023-12-21 11:13:05,083 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 248) no Hoare annotation was computed. [2023-12-21 11:13:05,083 INFO L899 garLoopResultBuilder]: For program point L971(lines 971 975) no Hoare annotation was computed. [2023-12-21 11:13:05,083 INFO L899 garLoopResultBuilder]: For program point L179(lines 149 180) no Hoare annotation was computed. [2023-12-21 11:13:05,083 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 133) no Hoare annotation was computed. [2023-12-21 11:13:05,083 INFO L899 garLoopResultBuilder]: For program point L1038(lines 1038 1091) no Hoare annotation was computed. [2023-12-21 11:13:05,083 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2023-12-21 11:13:05,083 INFO L899 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2023-12-21 11:13:05,083 INFO L895 garLoopResultBuilder]: At program point L643-2(lines 643 671) the Hoare annotation is: (let ((.cse12 (= ~c_req_a~0 1)) (.cse20 (= ~req_tt_a~0 1)) (.cse21 (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (.cse16 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (.cse10 (= ~c_req_type~0 0)) (.cse17 (= ~c_req_a~0 0)) (.cse18 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse13 (= ~s_memory0~0 50)) (.cse5 (= ~c_empty_req~0 1)) (.cse8 (= ~m_run_pc~0 6)) (.cse14 (= ~a_t~0 0)) (.cse19 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse15 (= ~s_memory1~0 51)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (<= 0 ~a_t~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse11 .cse12 .cse13 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse3 .cse6 .cse7 .cse8 .cse14 .cse9 .cse15 .cse16) (and .cse10 .cse0 .cse17 .cse11 .cse18 .cse13 .cse3 .cse4 .cse6 .cse7 .cse19 .cse9 .cse15) (and .cse10 .cse0 .cse11 .cse12 .cse20 .cse13 .cse3 .cse4 .cse6 .cse7 .cse8 .cse21 .cse9 .cse15 .cse16) (and .cse10 .cse0 .cse11 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) .cse12 .cse2 .cse20 .cse13 .cse3 .cse5 .cse6 .cse8 .cse21 .cse9 .cse15 .cse16) (and .cse10 .cse0 .cse17 .cse11 (= ~c_rsp_d~0 50) .cse2 .cse18 (= ~req_tt_a~0 0) .cse13 .cse3 .cse5 .cse6 .cse8 .cse14 .cse19 .cse9 .cse15) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9))) [2023-12-21 11:13:05,083 INFO L899 garLoopResultBuilder]: For program point L644(lines 643 671) no Hoare annotation was computed. [2023-12-21 11:13:05,084 INFO L899 garLoopResultBuilder]: For program point L578(lines 578 582) no Hoare annotation was computed. [2023-12-21 11:13:05,084 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 132) no Hoare annotation was computed. [2023-12-21 11:13:05,084 INFO L899 garLoopResultBuilder]: For program point L909(lines 883 910) no Hoare annotation was computed. [2023-12-21 11:13:05,084 INFO L895 garLoopResultBuilder]: At program point L183-2(lines 183 211) the Hoare annotation is: (let ((.cse2 (= ~s_run_pc~0 0)) (.cse14 (= ~c_req_type~0 0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse15 (= ~c_req_a~0 0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse0 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse16 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse10 .cse11 .cse3 .cse4 .cse5 (= ~m_run_pc~0 3) .cse12 .cse13 (= ~c_req_d~0 50) (= |ULTIMATE.start_m_run_~req_a~0#1| 1)) (and .cse14 .cse8 .cse15 .cse9 .cse0 .cse2 .cse16 .cse11 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7) (and .cse14 .cse8 .cse15 .cse9 .cse0 .cse1 .cse16 .cse10 .cse11 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7))) [2023-12-21 11:13:05,084 INFO L899 garLoopResultBuilder]: For program point L778(lines 778 782) no Hoare annotation was computed. [2023-12-21 11:13:05,084 INFO L899 garLoopResultBuilder]: For program point L712(lines 712 716) no Hoare annotation was computed. [2023-12-21 11:13:05,084 INFO L899 garLoopResultBuilder]: For program point L184(lines 183 211) no Hoare annotation was computed. [2023-12-21 11:13:05,084 INFO L899 garLoopResultBuilder]: For program point L1308(lines 1260 1349) no Hoare annotation was computed. [2023-12-21 11:13:05,084 INFO L899 garLoopResultBuilder]: For program point L1242(lines 1242 1246) no Hoare annotation was computed. [2023-12-21 11:13:05,084 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 131) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point L978(lines 970 987) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point L384(lines 384 388) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point L1309(lines 1309 1313) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point L1177(lines 1177 1181) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point L1177-2(lines 1175 1354) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 983) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point L451(lines 139 485) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 456) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 130) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point L1047(lines 1047 1051) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point $Ultimate##299(lines 577 621) no Hoare annotation was computed. [2023-12-21 11:13:05,085 INFO L899 garLoopResultBuilder]: For program point L916(lines 916 969) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point L322(lines 292 323) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 921) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point L719(lines 490 842) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point L1182-1(lines 1175 1354) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 129) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point L786(lines 786 790) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point L720(lines 720 724) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point L391(lines 383 400) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point $Ultimate##494(lines 940 966) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point $Ultimate##251(lines 451 459) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point L259(lines 139 485) no Hoare annotation was computed. [2023-12-21 11:13:05,086 INFO L899 garLoopResultBuilder]: For program point L1250(lines 1250 1254) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point L392(lines 392 396) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point $Ultimate##263(lines 473 481) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point L1055(lines 1055 1059) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point L329(lines 329 382) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1192) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point $Ultimate##212(lines 391 399) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point L990(lines 990 1004) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point $Ultimate##227(lines 419 463) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point L925(lines 925 929) no Hoare annotation was computed. [2023-12-21 11:13:05,087 INFO L899 garLoopResultBuilder]: For program point L529(lines 499 530) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point $Ultimate##233(lines 427 462) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point $Ultimate##239(lines 435 461) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point L1323(lines 1323 1327) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point $Ultimate##482(lines 924 968) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point L1125(lines 1124 1165) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point $Ultimate##488(lines 932 967) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point $Ultimate##245(lines 443 460) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 72) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 470) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point L136(lines 106 848) no Hoare annotation was computed. [2023-12-21 11:13:05,088 INFO L899 garLoopResultBuilder]: For program point $Ultimate##305(lines 585 620) no Hoare annotation was computed. [2023-12-21 11:13:05,089 INFO L895 garLoopResultBuilder]: At program point L533-2(lines 533 561) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 (<= 1 ~a_t~0) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 .cse10) (and .cse0 (= ~c_req_type~0 0) .cse1 (= ~c_req_a~0 0) .cse2 (= ~c_rsp_d~0 50) .cse3 (= ~req_tt_a~0 0) .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse9 .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-12-21 11:13:05,089 INFO L899 garLoopResultBuilder]: For program point L996(lines 996 1003) no Hoare annotation was computed. [2023-12-21 11:13:05,089 INFO L899 garLoopResultBuilder]: For program point $Ultimate##311(lines 593 619) no Hoare annotation was computed. [2023-12-21 11:13:05,089 INFO L899 garLoopResultBuilder]: For program point $Ultimate##317(lines 601 618) no Hoare annotation was computed. [2023-12-21 11:13:05,089 INFO L899 garLoopResultBuilder]: For program point $Ultimate##556(lines 1046 1090) no Hoare annotation was computed. [2023-12-21 11:13:05,089 INFO L899 garLoopResultBuilder]: For program point L534(lines 533 561) no Hoare annotation was computed. [2023-12-21 11:13:05,089 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 408) no Hoare annotation was computed. [2023-12-21 11:13:05,089 INFO L899 garLoopResultBuilder]: For program point L402-1(lines 402 408) no Hoare annotation was computed. [2023-12-21 11:13:05,089 INFO L899 garLoopResultBuilder]: For program point L1129(lines 1129 1133) no Hoare annotation was computed. [2023-12-21 11:13:05,089 INFO L899 garLoopResultBuilder]: For program point $Ultimate##562(lines 1054 1089) no Hoare annotation was computed. [2023-12-21 11:13:05,089 INFO L899 garLoopResultBuilder]: For program point L1129-1(lines 1124 1165) no Hoare annotation was computed. [2023-12-21 11:13:05,089 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: false [2023-12-21 11:13:05,090 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 67 72) no Hoare annotation was computed. [2023-12-21 11:13:05,090 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2023-12-21 11:13:05,090 INFO L899 garLoopResultBuilder]: For program point $Ultimate##323(lines 609 617) no Hoare annotation was computed. [2023-12-21 11:13:05,090 INFO L899 garLoopResultBuilder]: For program point L1196(lines 1196 1200) no Hoare annotation was computed. [2023-12-21 11:13:05,090 INFO L895 garLoopResultBuilder]: At program point L139-2(lines 139 485) the Hoare annotation is: (let ((.cse3 (= ~s_memory0~0 50)) (.cse8 (= ~m_run_pc~0 3)) (.cse13 (= ~s_run_pc~0 0)) (.cse11 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~c_req_a~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse9 (= ~a_t~0 0)) (.cse14 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse15 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~c_req_d~0 50)) (and .cse11 .cse0 .cse12 .cse13 .cse2 .cse5 .cse6 .cse7 .cse9 .cse14 .cse10 .cse15) (and (= 51 ~c_req_d~0) .cse0 (<= 1 ~a_t~0) .cse1 (<= 2 |ULTIMATE.start_m_run_~a~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (= ~s_memory1~0 51)) (and .cse1 .cse13 .cse2 .cse5 .cse6 .cse7 .cse14 .cse15) (and .cse11 .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse14 .cse10 .cse15))) [2023-12-21 11:13:05,090 INFO L899 garLoopResultBuilder]: For program point L866(lines 866 878) no Hoare annotation was computed. [2023-12-21 11:13:05,090 INFO L899 garLoopResultBuilder]: For program point L734(lines 734 738) no Hoare annotation was computed. [2023-12-21 11:13:05,090 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 606) no Hoare annotation was computed. [2023-12-21 11:13:05,090 INFO L895 garLoopResultBuilder]: At program point L404(line 404) the Hoare annotation is: false [2023-12-21 11:13:05,090 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2023-12-21 11:13:05,090 INFO L899 garLoopResultBuilder]: For program point L140(lines 139 485) no Hoare annotation was computed. [2023-12-21 11:13:05,090 INFO L899 garLoopResultBuilder]: For program point L933(lines 933 937) no Hoare annotation was computed. [2023-12-21 11:13:05,090 INFO L899 garLoopResultBuilder]: For program point $Ultimate##500(lines 948 965) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point L801(lines 490 842) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point $Ultimate##506(lines 956 964) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point L1330(lines 1260 1349) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 806) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point $Ultimate##518(lines 978 986) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point L1331(lines 1331 1335) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 877) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point L473(lines 465 482) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point L672(lines 642 673) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point L1135(lines 1124 1165) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point L1268(lines 1268 1321) no Hoare annotation was computed. [2023-12-21 11:13:05,091 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 84) no Hoare annotation was computed. [2023-12-21 11:13:05,092 INFO L899 garLoopResultBuilder]: For program point L872(lines 872 876) no Hoare annotation was computed. [2023-12-21 11:13:05,092 INFO L899 garLoopResultBuilder]: For program point L1269(lines 1269 1273) no Hoare annotation was computed. [2023-12-21 11:13:05,092 INFO L899 garLoopResultBuilder]: For program point L212(lines 182 213) no Hoare annotation was computed. [2023-12-21 11:13:05,092 INFO L899 garLoopResultBuilder]: For program point L1071(lines 1071 1075) no Hoare annotation was computed. [2023-12-21 11:13:05,092 INFO L899 garLoopResultBuilder]: For program point L741(lines 733 750) no Hoare annotation was computed. [2023-12-21 11:13:05,092 INFO L899 garLoopResultBuilder]: For program point L609(lines 490 842) no Hoare annotation was computed. [2023-12-21 11:13:05,092 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 464) no Hoare annotation was computed. [2023-12-21 11:13:05,092 INFO L899 garLoopResultBuilder]: For program point L1204(lines 1204 1208) no Hoare annotation was computed. [2023-12-21 11:13:05,092 INFO L899 garLoopResultBuilder]: For program point L81(lines 81 84) no Hoare annotation was computed. [2023-12-21 11:13:05,092 INFO L895 garLoopResultBuilder]: At program point L1006-1(lines 1006 1030) the Hoare annotation is: (let ((.cse13 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse9 (= ~a_t~0 0)) (.cse15 (= ~c_req_d~0 50)) (.cse14 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse16 (<= 1 ~a_t~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 6)) (.cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse3 .cse4 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse3 .cse5 .cse13 .cse6 .cse7 .cse14 .cse9 .cse11 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse14 .cse9 .cse11 .cse15) (and (= 51 ~c_req_d~0) .cse1 .cse2 .cse16 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse16 (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12))) [2023-12-21 11:13:05,092 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 746) no Hoare annotation was computed. [2023-12-21 11:13:05,092 INFO L899 garLoopResultBuilder]: For program point L610(lines 610 614) no Hoare annotation was computed. [2023-12-21 11:13:05,093 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 416) no Hoare annotation was computed. [2023-12-21 11:13:05,093 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 350) no Hoare annotation was computed. [2023-12-21 11:13:05,093 INFO L899 garLoopResultBuilder]: For program point L1139(lines 1139 1146) no Hoare annotation was computed. [2023-12-21 11:13:05,093 INFO L899 garLoopResultBuilder]: For program point L1007(lines 1006 1030) no Hoare annotation was computed. [2023-12-21 11:13:05,093 INFO L899 garLoopResultBuilder]: For program point L941(lines 941 945) no Hoare annotation was computed. [2023-12-21 11:13:05,093 INFO L899 garLoopResultBuilder]: For program point L281(lines 273 290) no Hoare annotation was computed. [2023-12-21 11:13:05,093 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2023-12-21 11:13:05,093 INFO L895 garLoopResultBuilder]: At program point L150-2(lines 150 178) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse3 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse13 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse15 (= ~m_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (not (= ~c_m_lock~0 1))) (.cse7 (= 2 ~s_run_pc~0)) (.cse8 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse3 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse4 .cse16 .cse5 .cse9 .cse10 .cse11 .cse13 .cse15) (and .cse1 .cse4 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) .cse5 (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_run_pc~0 3) .cse12 .cse14 (= ~c_req_d~0 50) (= |ULTIMATE.start_m_run_~req_a~0#1| 1)))) [2023-12-21 11:13:05,093 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: false [2023-12-21 11:13:05,093 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 77 87) no Hoare annotation was computed. [2023-12-21 11:13:05,093 INFO L899 garLoopResultBuilder]: For program point L679(lines 679 732) no Hoare annotation was computed. [2023-12-21 11:13:05,093 INFO L899 garLoopResultBuilder]: For program point L151(lines 150 178) no Hoare annotation was computed. [2023-12-21 11:13:05,093 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 684) no Hoare annotation was computed. [2023-12-21 11:13:05,094 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 1172 1355) no Hoare annotation was computed. [2023-12-21 11:13:05,094 INFO L899 garLoopResultBuilder]: For program point L219(lines 219 272) no Hoare annotation was computed. [2023-12-21 11:13:05,094 INFO L899 garLoopResultBuilder]: For program point L1078(lines 881 1111) no Hoare annotation was computed. [2023-12-21 11:13:05,094 INFO L899 garLoopResultBuilder]: For program point L1343(lines 1343 1347) no Hoare annotation was computed. [2023-12-21 11:13:05,094 INFO L895 garLoopResultBuilder]: At program point L1343-1(lines 1260 1349) the Hoare annotation is: (let ((.cse2 (<= 1 ~a_t~0)) (.cse14 (not (= ~c_m_lock~0 1))) (.cse17 (= ~m_run_pc~0 0)) (.cse18 (= ~s_run_pc~0 0)) (.cse12 (= ~c_req_type~0 0)) (.cse13 (= ~c_req_a~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse5 (= ~s_memory0~0 50)) (.cse16 (= ~a_t~0 0)) (.cse11 (= ~s_memory1~0 51)) (.cse19 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse20 (= ~m_run_pc~0 6)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~m_run_st~0 0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse15 .cse16 .cse10 .cse17) (and .cse13 .cse3 .cse18 .cse14 .cse7 .cse8 .cse15 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 (= ~c_req_d~0 50)) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse19 .cse8 .cse15 .cse20 .cse10) (and .cse12 .cse0 .cse1 .cse2 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse18 .cse14 .cse7 .cse8 .cse15 .cse16 .cse10 .cse17) (and .cse13 .cse3 .cse18 .cse4 .cse8 .cse15 .cse9 (not .cse12)) (and .cse6 .cse7 .cse8 .cse15 .cse9) (and .cse12 .cse0 .cse13 .cse1 (= ~c_rsp_d~0 50) .cse3 (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse16 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse19 .cse7 .cse8 .cse15 .cse20 .cse10) (and .cse0 .cse3 .cse4 .cse6 .cse8 .cse15 .cse9))) [2023-12-21 11:13:05,094 INFO L899 garLoopResultBuilder]: For program point L1277(lines 1277 1281) no Hoare annotation was computed. [2023-12-21 11:13:05,094 INFO L899 garLoopResultBuilder]: For program point L220(lines 220 224) no Hoare annotation was computed. [2023-12-21 11:13:05,094 INFO L899 garLoopResultBuilder]: For program point L1079(lines 1079 1083) no Hoare annotation was computed. [2023-12-21 11:13:05,094 INFO L895 garLoopResultBuilder]: At program point L881-1(lines 881 1111) the Hoare annotation is: (let ((.cse3 (<= 1 ~a_t~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse15 (= ~c_empty_rsp~0 1)) (.cse12 (= ~m_run_pc~0 3)) (.cse17 (= ~c_req_d~0 50)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse13 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse16 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= 51 ~c_req_d~0) .cse1 .cse2 .cse3 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse4 .cse6 .cse7 .cse12 .cse10 .cse11) (and .cse0 .cse1 .cse13 .cse14 (not (= ~c_m_lock~0 1)) .cse6 .cse7 .cse15 .cse16 .cse10 (= ~m_run_pc~0 0)) (and .cse1 .cse2 .cse4 .cse6 (= |ULTIMATE.start_s_run_~req_d~1#1| 50) .cse7 .cse12 .cse16 .cse10 .cse17) (and .cse1 .cse13 .cse2 (= ~c_req_type~0 1) .cse14 (= ~s_run_pc~0 0) .cse7 .cse15 .cse12 .cse16 .cse10 .cse17) (and .cse0 .cse1 .cse13 .cse2 (= ~c_rsp_d~0 50) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse4 .cse5 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11))) [2023-12-21 11:13:05,094 INFO L899 garLoopResultBuilder]: For program point L1212(lines 1212 1216) no Hoare annotation was computed. [2023-12-21 11:13:05,095 INFO L899 garLoopResultBuilder]: For program point L816(lines 816 820) no Hoare annotation was computed. [2023-12-21 11:13:05,095 INFO L899 garLoopResultBuilder]: For program point $Ultimate##176(lines 337 381) no Hoare annotation was computed. [2023-12-21 11:13:05,095 INFO L899 garLoopResultBuilder]: For program point L486(lines 138 487) no Hoare annotation was computed. [2023-12-21 11:13:05,095 INFO L899 garLoopResultBuilder]: For program point L420(lines 420 424) no Hoare annotation was computed. [2023-12-21 11:13:05,095 INFO L899 garLoopResultBuilder]: For program point L354(lines 354 358) no Hoare annotation was computed. [2023-12-21 11:13:05,095 INFO L899 garLoopResultBuilder]: For program point L949(lines 949 953) no Hoare annotation was computed. [2023-12-21 11:13:05,095 INFO L899 garLoopResultBuilder]: For program point $Ultimate##182(lines 345 380) no Hoare annotation was computed. [2023-12-21 11:13:05,095 INFO L899 garLoopResultBuilder]: For program point $Ultimate##188(lines 353 379) no Hoare annotation was computed. [2023-12-21 11:13:05,095 INFO L899 garLoopResultBuilder]: For program point $Ultimate##50(lines 1249 1257) no Hoare annotation was computed. [2023-12-21 11:13:05,095 INFO L895 garLoopResultBuilder]: At program point L884-1(lines 884 908) the Hoare annotation is: (let ((.cse17 (= 51 ~c_req_d~0)) (.cse3 (<= 1 ~a_t~0)) (.cse4 (= ~c_req_a~0 1)) (.cse5 (= ~req_tt_a~0 1)) (.cse21 (= ~c_req_type~0 1)) (.cse14 (not (= ~s_run_st~0 0))) (.cse15 (= ~c_empty_rsp~0 1)) (.cse16 (= ~m_run_pc~0 3)) (.cse22 (= ~c_req_d~0 50)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse18 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse19 (= ~req_tt_a~0 0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= 2 ~s_run_pc~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse20 (= ~a_t~0 0)) (.cse11 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 (= 51 ~c_rsp_d~0) .cse4 (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) .cse5 (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse7 .cse8 .cse9 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse6 .cse8 .cse9 .cse16 .cse12 .cse13) (and .cse0 .cse1 .cse18 .cse2 .cse14 .cse19 .cse6 .cse7 .cse9 .cse15 .cse10 .cse20 .cse12 .cse13) (and .cse17 .cse1 .cse2 .cse21 .cse3 .cse4 .cse14 .cse6 .cse7 .cse9 .cse15 .cse16 .cse12) (and .cse1 .cse18 .cse2 .cse21 .cse14 .cse7 .cse9 .cse15 .cse16 .cse20 .cse12 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse18 .cse14 (not (= ~c_m_lock~0 1)) .cse8 .cse9 .cse15 .cse20 .cse12 (= ~m_run_pc~0 0)) (and .cse1 .cse2 .cse6 .cse8 (= |ULTIMATE.start_s_run_~req_d~1#1| 50) .cse9 .cse16 .cse20 .cse12 .cse22) (and .cse1 .cse18 .cse2 .cse21 .cse14 (= ~s_run_pc~0 0) .cse9 .cse15 .cse16 .cse20 .cse12 .cse22) (and .cse0 .cse1 .cse18 .cse2 (= ~c_rsp_d~0 50) .cse19 (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse6 .cse7 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13))) [2023-12-21 11:13:05,095 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 758) no Hoare annotation was computed. [2023-12-21 11:13:05,095 INFO L899 garLoopResultBuilder]: For program point L752-1(lines 752 758) no Hoare annotation was computed. [2023-12-21 11:13:05,096 INFO L899 garLoopResultBuilder]: For program point $Ultimate##194(lines 361 378) no Hoare annotation was computed. [2023-12-21 11:13:05,096 INFO L899 garLoopResultBuilder]: For program point L885(lines 884 908) no Hoare annotation was computed. [2023-12-21 11:13:05,096 INFO L895 garLoopResultBuilder]: At program point L1150(lines 1124 1165) the Hoare annotation is: (let ((.cse19 (<= 0 ~a_t~0)) (.cse25 (= 51 ~c_req_d~0)) (.cse24 (= ~req_tt_a~0 0)) (.cse3 (<= 1 ~a_t~0)) (.cse4 (= ~c_req_a~0 1)) (.cse6 (= ~req_tt_a~0 1)) (.cse11 (= ~m_run_pc~0 6)) (.cse13 (= ~s_memory1~0 51)) (.cse15 (= ~s_run_pc~0 0)) (.cse7 (= ~s_memory0~0 50)) (.cse0 (= ~c_req_type~0 0)) (.cse5 (not (= ~s_run_st~0 0))) (.cse16 (not (= ~c_m_lock~0 1))) (.cse9 (= ~c_empty_req~0 1)) (.cse18 (= ~m_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse14 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse20 (= ~c_req_type~0 1)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse17 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 3)) (.cse22 (= ~a_t~0 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse23 (= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse5 .cse15 .cse16 .cse9 .cse10 .cse17 .cse18) (and .cse1 .cse5 .cse8 .cse19 .cse9 .cse10 .cse17 .cse11 .cse12) (and .cse1 .cse14 .cse2 .cse20 .cse15 .cse10 .cse17 .cse21 .cse22 .cse12 .cse23) (and .cse0 .cse1 .cse14 .cse2 .cse24 .cse7 .cse8 .cse10 .cse17 .cse11 .cse22 .cse12 .cse13) (and .cse1 .cse2 .cse5 .cse8 .cse19 .cse10 .cse17 .cse11 .cse12) (and .cse25 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse21 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse9 .cse10 .cse17 .cse22 .cse12 .cse18) (and .cse25 .cse1 .cse2 .cse20 .cse3 .cse4 .cse7 .cse8 .cse10 .cse17 .cse21 .cse12) (and .cse0 .cse1 .cse14 .cse2 (= ~c_rsp_d~0 50) .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13) (and .cse8 .cse9 .cse10 .cse17 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse1 .cse5 .cse8 .cse10 .cse17 .cse21) (and .cse14 .cse5 .cse15 .cse10 .cse17 .cse21 (not .cse0)) (and .cse1 .cse2 .cse5 .cse7 .cse8 .cse9 .cse10 .cse21 .cse22 .cse12 .cse23) (and .cse0 .cse1 .cse14 .cse5 .cse16 .cse8 .cse9 .cse10 .cse17 .cse22 .cse12 .cse18) (and .cse1 .cse14 .cse2 .cse20 .cse8 .cse10 .cse17 .cse21 .cse22 .cse12 .cse23))) [2023-12-21 11:13:05,096 INFO L895 garLoopResultBuilder]: At program point L754(line 754) the Hoare annotation is: false [2023-12-21 11:13:05,096 INFO L899 garLoopResultBuilder]: For program point L688(lines 688 692) no Hoare annotation was computed. [2023-12-21 11:13:05,096 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 1227 1235) no Hoare annotation was computed. [2023-12-21 11:13:05,096 INFO L899 garLoopResultBuilder]: For program point $Ultimate##32(lines 1219 1236) no Hoare annotation was computed. [2023-12-21 11:13:05,096 INFO L899 garLoopResultBuilder]: For program point $Ultimate##132(lines 243 269) no Hoare annotation was computed. [2023-12-21 11:13:05,096 INFO L895 garLoopResultBuilder]: At program point L490-2(lines 490 842) the Hoare annotation is: (let ((.cse4 (= ~s_memory0~0 50)) (.cse6 (= ~c_empty_req~0 1)) (.cse13 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory1~0 51)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~a_t~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse12 (<= 2 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (<= 2 ~c_m_ev~0))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse10) (and (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse3 .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 .cse8 .cse13 (= ~a_t~0 0) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10))) [2023-12-21 11:13:05,097 INFO L899 garLoopResultBuilder]: For program point $Ultimate##373(lines 711 728) no Hoare annotation was computed. [2023-12-21 11:13:05,097 INFO L899 garLoopResultBuilder]: For program point $Ultimate##379(lines 719 727) no Hoare annotation was computed. [2023-12-21 11:13:05,097 INFO L899 garLoopResultBuilder]: For program point $Ultimate##138(lines 251 268) no Hoare annotation was computed. [2023-12-21 11:13:05,097 INFO L899 garLoopResultBuilder]: For program point $Ultimate##26(lines 1211 1237) no Hoare annotation was computed. [2023-12-21 11:13:05,097 INFO L899 garLoopResultBuilder]: For program point L491(lines 490 842) no Hoare annotation was computed. [2023-12-21 11:13:05,097 INFO L899 garLoopResultBuilder]: For program point $Ultimate##144(lines 259 267) no Hoare annotation was computed. [2023-12-21 11:13:05,097 INFO L899 garLoopResultBuilder]: For program point $Ultimate##20(lines 1203 1238) no Hoare annotation was computed. [2023-12-21 11:13:05,097 INFO L895 garLoopResultBuilder]: At program point L293-2(lines 293 321) the Hoare annotation is: (let ((.cse11 (= 51 ~c_req_d~0)) (.cse13 (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (.cse12 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse15 (= ~c_empty_req~0 1)) (.cse16 (= ~m_run_pc~0 3)) (.cse14 (not (= ~s_run_st~0 0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse17 (= ~s_run_pc~0 0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 .cse3 (= ~c_req_a~0 1) .cse12 .cse4 (<= 0 ~a_t~0) .cse5 .cse6 .cse13 .cse9) (and .cse0 .cse14 .cse4 .cse5 .cse6) (and .cse11 .cse0 .cse2 (<= 1 ~a_t~0) .cse14 .cse12 .cse4 .cse15 .cse5 .cse16 .cse13 .cse9 (= ~s_memory1~0 51)) (and .cse0 .cse2 .cse14 .cse12 .cse4 .cse15 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10) (and .cse4 .cse15 .cse5 .cse6 .cse16) (and .cse1 .cse14 .cse17 .cse5 .cse6 (not (= ~c_req_type~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-12-21 11:13:05,097 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 628) no Hoare annotation was computed. [2023-12-21 11:13:05,097 INFO L899 garLoopResultBuilder]: For program point $Ultimate##391(lines 741 749) no Hoare annotation was computed. [2023-12-21 11:13:05,097 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 11:13:05,097 INFO L899 garLoopResultBuilder]: For program point L294(lines 293 321) no Hoare annotation was computed. [2023-12-21 11:13:05,097 INFO L899 garLoopResultBuilder]: For program point $Ultimate##14(lines 1195 1239) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point L1285(lines 1285 1289) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 232) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point $Ultimate##156(lines 281 289) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point L823(lines 815 832) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point L1220(lines 1220 1224) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point L1154(lines 1154 1161) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point $Ultimate##568(lines 1062 1088) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 1118 1171) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point L956(lines 881 1111) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point L824(lines 824 828) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2023-12-21 11:13:05,098 INFO L899 garLoopResultBuilder]: For program point $Ultimate##335(lines 631 639) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point $Ultimate##574(lines 1070 1087) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point L957(lines 957 961) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point $Ultimate##580(lines 1078 1086) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point L562(lines 532 563) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point $Ultimate##592(lines 1100 1108) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point $Ultimate##355(lines 687 731) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point L761(lines 761 814) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point $Ultimate##120(lines 227 271) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point $Ultimate##361(lines 695 730) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point $Ultimate##126(lines 235 270) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point $Ultimate##367(lines 703 729) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-12-21 11:13:05,099 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-12-21 11:13:05,099 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-12-21 11:13:05,102 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] [2023-12-21 11:13:05,104 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 11:13:05,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:13:05 BoogieIcfgContainer [2023-12-21 11:13:05,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 11:13:05,139 INFO L158 Benchmark]: Toolchain (without parser) took 75958.60ms. Allocated memory was 362.8MB in the beginning and 1.0GB in the end (delta: 681.6MB). Free memory was 308.7MB in the beginning and 625.9MB in the end (delta: -317.1MB). Peak memory consumption was 621.4MB. Max. memory is 8.0GB. [2023-12-21 11:13:05,139 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 211.8MB. Free memory is still 159.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 11:13:05,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.41ms. Allocated memory is still 362.8MB. Free memory was 308.3MB in the beginning and 287.2MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-21 11:13:05,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.83ms. Allocated memory is still 362.8MB. Free memory was 287.2MB in the beginning and 283.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 11:13:05,140 INFO L158 Benchmark]: Boogie Preprocessor took 82.22ms. Allocated memory is still 362.8MB. Free memory was 283.6MB in the beginning and 279.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 11:13:05,140 INFO L158 Benchmark]: RCFGBuilder took 918.16ms. Allocated memory is still 362.8MB. Free memory was 279.0MB in the beginning and 299.0MB in the end (delta: -20.0MB). Peak memory consumption was 30.6MB. Max. memory is 8.0GB. [2023-12-21 11:13:05,140 INFO L158 Benchmark]: TraceAbstraction took 74504.56ms. Allocated memory was 362.8MB in the beginning and 1.0GB in the end (delta: 681.6MB). Free memory was 298.5MB in the beginning and 625.9MB in the end (delta: -327.4MB). Peak memory consumption was 610.7MB. Max. memory is 8.0GB. [2023-12-21 11:13:05,141 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.10ms. Allocated memory is still 211.8MB. Free memory is still 159.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 390.41ms. Allocated memory is still 362.8MB. Free memory was 308.3MB in the beginning and 287.2MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.83ms. Allocated memory is still 362.8MB. Free memory was 287.2MB in the beginning and 283.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 82.22ms. Allocated memory is still 362.8MB. Free memory was 283.6MB in the beginning and 279.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 918.16ms. Allocated memory is still 362.8MB. Free memory was 279.0MB in the beginning and 299.0MB in the end (delta: -20.0MB). Peak memory consumption was 30.6MB. Max. memory is 8.0GB. * TraceAbstraction took 74504.56ms. Allocated memory was 362.8MB in the beginning and 1.0GB in the end (delta: 681.6MB). Free memory was 298.5MB in the beginning and 625.9MB in the end (delta: -327.4MB). Peak memory consumption was 610.7MB. 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: 20]: 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 2 procedures, 249 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.4s, OverallIterations: 27, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 51.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12274 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12274 mSDsluCounter, 46395 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34920 mSDsCounter, 542 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6072 IncrementalHoareTripleChecker+Invalid, 6614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 542 mSolverCounterUnsat, 11475 mSDtfsCounter, 6072 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3486 GetRequests, 3269 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9663occurred in iteration=13, InterpolantAutomatonStates: 197, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 14186 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 135 PreInvPairs, 288 NumberOfFragments, 3385 HoareAnnotationTreeSize, 135 FormulaSimplifications, 3290160 FormulaSimplificationTreeSizeReduction, 44.5s HoareSimplificationTime, 19 FormulaSimplificationsInter, 113764 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 5673 NumberOfCodeBlocks, 5673 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 6857 ConstructedInterpolants, 0 QuantifiedInterpolants, 18537 SizeOfPredicates, 48 NumberOfNonLiveVariables, 6224 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 40 InterpolantComputations, 23 PerfectInterpolantSequences, 2283/4127 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 1 specifications checked. All of them hold - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (1 <= a)) && (2 <= c_m_ev))) || (((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((((((((((req_a == 0) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && !((s_run_st == 0))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 1260]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 1124]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0)) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((req_a == 0) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (51 == req_d)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) - InvariantResult [Line: 643]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev) && (0 <= a)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev))) - InvariantResult [Line: 1006]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 500]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-21 11:13:05,164 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...