/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 01:01:05,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 01:01:05,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 01:01:05,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 01:01:05,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 01:01:05,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 01:01:05,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 01:01:05,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 01:01:05,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 01:01:05,927 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 01:01:05,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 01:01:05,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 01:01:05,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 01:01:05,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 01:01:05,928 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 01:01:05,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 01:01:05,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 01:01:05,929 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 01:01:05,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 01:01:05,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 01:01:05,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 01:01:05,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 01:01:05,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 01:01:05,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 01:01:05,935 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 01:01:05,935 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 01:01:05,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 01:01:05,936 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 01:01:05,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 01:01:05,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 01:01:05,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 01:01:05,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 01:01:05,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 01:01:05,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 01:01:05,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 01:01:05,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 01:01:05,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 01:01:05,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 01:01:05,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 01:01:05,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 01:01:05,938 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 01:01:05,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 01:01:05,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 01:01:05,941 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 -> true [2023-12-20 01:01:06,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 01:01:06,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 01:01:06,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 01:01:06,198 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 01:01:06,199 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 01:01:06,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2023-12-20 01:01:07,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 01:01:07,665 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 01:01:07,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2023-12-20 01:01:07,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31237202/3702506e58f942209b1454758cd95e93/FLAG4621c169a [2023-12-20 01:01:08,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31237202/3702506e58f942209b1454758cd95e93 [2023-12-20 01:01:08,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 01:01:08,060 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 01:01:08,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 01:01:08,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 01:01:08,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 01:01:08,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e102d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08, skipping insertion in model container [2023-12-20 01:01:08,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,100 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 01:01:08,274 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c[6787,6800] [2023-12-20 01:01:08,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 01:01:08,287 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 01:01:08,317 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c[6787,6800] [2023-12-20 01:01:08,318 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 01:01:08,331 INFO L206 MainTranslator]: Completed translation [2023-12-20 01:01:08,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08 WrapperNode [2023-12-20 01:01:08,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 01:01:08,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 01:01:08,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 01:01:08,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 01:01:08,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,377 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 241 [2023-12-20 01:01:08,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 01:01:08,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 01:01:08,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 01:01:08,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 01:01:08,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,430 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 01:01:08,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 01:01:08,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 01:01:08,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 01:01:08,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 01:01:08,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (1/1) ... [2023-12-20 01:01:08,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 01:01:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:01:08,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 01:01:08,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 01:01:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 01:01:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 01:01:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 01:01:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 01:01:08,575 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 01:01:08,576 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 01:01:08,870 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 01:01:08,915 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 01:01:08,916 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 01:01:08,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 01:01:08 BoogieIcfgContainer [2023-12-20 01:01:08,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 01:01:08,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 01:01:08,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 01:01:08,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 01:01:08,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 01:01:08" (1/3) ... [2023-12-20 01:01:08,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c8c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 01:01:08, skipping insertion in model container [2023-12-20 01:01:08,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 01:01:08" (2/3) ... [2023-12-20 01:01:08,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c8c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 01:01:08, skipping insertion in model container [2023-12-20 01:01:08,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 01:01:08" (3/3) ... [2023-12-20 01:01:08,935 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2023-12-20 01:01:08,951 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 01:01:08,952 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 01:01:08,990 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 01:01:08,996 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;@589033df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 01:01:08,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 01:01:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 61 states have (on average 1.7540983606557377) internal successors, (107), 62 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-20 01:01:09,006 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:09,007 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] [2023-12-20 01:01:09,008 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:09,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1278615738, now seen corresponding path program 1 times [2023-12-20 01:01:09,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:09,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389216948] [2023-12-20 01:01:09,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:09,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:09,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389216948] [2023-12-20 01:01:09,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389216948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:09,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:09,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 01:01:09,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285427657] [2023-12-20 01:01:09,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:09,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 01:01:09,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:09,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 01:01:09,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 01:01:09,437 INFO L87 Difference]: Start difference. First operand has 63 states, 61 states have (on average 1.7540983606557377) internal successors, (107), 62 states have internal predecessors, (107), 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) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:09,516 INFO L93 Difference]: Finished difference Result 106 states and 178 transitions. [2023-12-20 01:01:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 01:01:09,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) Word has length 22 [2023-12-20 01:01:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:09,529 INFO L225 Difference]: With dead ends: 106 [2023-12-20 01:01:09,530 INFO L226 Difference]: Without dead ends: 61 [2023-12-20 01:01:09,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 01:01:09,535 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:09,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 01:01:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-20 01:01:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-20 01:01:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2023-12-20 01:01:09,572 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 22 [2023-12-20 01:01:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:09,573 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2023-12-20 01:01:09,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2023-12-20 01:01:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-20 01:01:09,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:09,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:09,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 01:01:09,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:09,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:09,576 INFO L85 PathProgramCache]: Analyzing trace with hash 728852336, now seen corresponding path program 1 times [2023-12-20 01:01:09,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:09,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513103976] [2023-12-20 01:01:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:09,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:09,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513103976] [2023-12-20 01:01:09,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513103976] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:09,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:09,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 01:01:09,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567662489] [2023-12-20 01:01:09,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:09,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 01:01:09,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:09,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 01:01:09,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 01:01:09,771 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:09,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:09,887 INFO L93 Difference]: Finished difference Result 221 states and 341 transitions. [2023-12-20 01:01:09,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 01:01:09,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) Word has length 38 [2023-12-20 01:01:09,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:09,895 INFO L225 Difference]: With dead ends: 221 [2023-12-20 01:01:09,895 INFO L226 Difference]: Without dead ends: 181 [2023-12-20 01:01:09,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 01:01:09,897 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 360 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:09,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 315 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-20 01:01:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 99. [2023-12-20 01:01:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 146 transitions. [2023-12-20 01:01:09,922 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 146 transitions. Word has length 38 [2023-12-20 01:01:09,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:09,923 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 146 transitions. [2023-12-20 01:01:09,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 146 transitions. [2023-12-20 01:01:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-20 01:01:09,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:09,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:09,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 01:01:09,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:09,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:09,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1106554996, now seen corresponding path program 1 times [2023-12-20 01:01:09,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:09,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448738048] [2023-12-20 01:01:09,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:09,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:10,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:10,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448738048] [2023-12-20 01:01:10,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448738048] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:10,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:10,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 01:01:10,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237506171] [2023-12-20 01:01:10,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:10,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 01:01:10,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:10,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 01:01:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 01:01:10,164 INFO L87 Difference]: Start difference. First operand 99 states and 146 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:10,195 INFO L93 Difference]: Finished difference Result 107 states and 155 transitions. [2023-12-20 01:01:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 01:01:10,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) Word has length 39 [2023-12-20 01:01:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:10,198 INFO L225 Difference]: With dead ends: 107 [2023-12-20 01:01:10,198 INFO L226 Difference]: Without dead ends: 105 [2023-12-20 01:01:10,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 01:01:10,202 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:10,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 236 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-20 01:01:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2023-12-20 01:01:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 102 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2023-12-20 01:01:10,225 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 39 [2023-12-20 01:01:10,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:10,226 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2023-12-20 01:01:10,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2023-12-20 01:01:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-20 01:01:10,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:10,227 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] [2023-12-20 01:01:10,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 01:01:10,228 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:10,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:10,228 INFO L85 PathProgramCache]: Analyzing trace with hash -55503080, now seen corresponding path program 1 times [2023-12-20 01:01:10,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:10,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042159696] [2023-12-20 01:01:10,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:10,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:10,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042159696] [2023-12-20 01:01:10,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042159696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:10,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:10,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:01:10,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371702385] [2023-12-20 01:01:10,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:10,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:01:10,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:10,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:01:10,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:01:10,311 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:10,336 INFO L93 Difference]: Finished difference Result 253 states and 384 transitions. [2023-12-20 01:01:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:01:10,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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) Word has length 40 [2023-12-20 01:01:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:10,337 INFO L225 Difference]: With dead ends: 253 [2023-12-20 01:01:10,337 INFO L226 Difference]: Without dead ends: 171 [2023-12-20 01:01:10,340 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-20 01:01:10,348 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:10,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 137 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-20 01:01:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2023-12-20 01:01:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.4939759036144578) internal successors, (248), 166 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 248 transitions. [2023-12-20 01:01:10,362 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 248 transitions. Word has length 40 [2023-12-20 01:01:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:10,362 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 248 transitions. [2023-12-20 01:01:10,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2023-12-20 01:01:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-20 01:01:10,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:10,364 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] [2023-12-20 01:01:10,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 01:01:10,364 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:10,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1754619557, now seen corresponding path program 1 times [2023-12-20 01:01:10,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:10,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341338785] [2023-12-20 01:01:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:10,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:10,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:10,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341338785] [2023-12-20 01:01:10,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341338785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:10,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:10,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:01:10,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304800026] [2023-12-20 01:01:10,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:10,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:01:10,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:10,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:01:10,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:01:10,415 INFO L87 Difference]: Start difference. First operand 167 states and 248 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:10,441 INFO L93 Difference]: Finished difference Result 427 states and 646 transitions. [2023-12-20 01:01:10,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:01:10,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) Word has length 41 [2023-12-20 01:01:10,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:10,443 INFO L225 Difference]: With dead ends: 427 [2023-12-20 01:01:10,443 INFO L226 Difference]: Without dead ends: 281 [2023-12-20 01:01:10,444 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-20 01:01:10,445 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 44 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:10,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 161 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-12-20 01:01:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2023-12-20 01:01:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.4892086330935252) internal successors, (414), 278 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 414 transitions. [2023-12-20 01:01:10,465 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 414 transitions. Word has length 41 [2023-12-20 01:01:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:10,466 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 414 transitions. [2023-12-20 01:01:10,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 414 transitions. [2023-12-20 01:01:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-20 01:01:10,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:10,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, 1, 1, 1, 1, 1] [2023-12-20 01:01:10,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 01:01:10,473 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:10,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2066619003, now seen corresponding path program 1 times [2023-12-20 01:01:10,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:10,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765296367] [2023-12-20 01:01:10,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:10,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:10,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:10,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765296367] [2023-12-20 01:01:10,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765296367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:10,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:10,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:01:10,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434258521] [2023-12-20 01:01:10,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:10,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:01:10,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:10,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:01:10,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:01:10,523 INFO L87 Difference]: Start difference. First operand 279 states and 414 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:10,547 INFO L93 Difference]: Finished difference Result 731 states and 1088 transitions. [2023-12-20 01:01:10,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:01:10,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) Word has length 41 [2023-12-20 01:01:10,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:10,551 INFO L225 Difference]: With dead ends: 731 [2023-12-20 01:01:10,552 INFO L226 Difference]: Without dead ends: 473 [2023-12-20 01:01:10,554 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-20 01:01:10,555 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 48 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:10,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 174 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-12-20 01:01:10,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2023-12-20 01:01:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.4595744680851064) internal successors, (686), 470 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 686 transitions. [2023-12-20 01:01:10,589 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 686 transitions. Word has length 41 [2023-12-20 01:01:10,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:10,590 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 686 transitions. [2023-12-20 01:01:10,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,590 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 686 transitions. [2023-12-20 01:01:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-20 01:01:10,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:10,594 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] [2023-12-20 01:01:10,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 01:01:10,594 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:10,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:10,594 INFO L85 PathProgramCache]: Analyzing trace with hash -837991207, now seen corresponding path program 1 times [2023-12-20 01:01:10,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:10,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050729845] [2023-12-20 01:01:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:10,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:10,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:10,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050729845] [2023-12-20 01:01:10,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050729845] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:10,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:10,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:01:10,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077967608] [2023-12-20 01:01:10,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:10,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:01:10,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:10,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:01:10,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:01:10,654 INFO L87 Difference]: Start difference. First operand 471 states and 686 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:10,685 INFO L93 Difference]: Finished difference Result 918 states and 1356 transitions. [2023-12-20 01:01:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:01:10,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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) Word has length 42 [2023-12-20 01:01:10,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:10,688 INFO L225 Difference]: With dead ends: 918 [2023-12-20 01:01:10,688 INFO L226 Difference]: Without dead ends: 659 [2023-12-20 01:01:10,689 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-20 01:01:10,690 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:10,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 185 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2023-12-20 01:01:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2023-12-20 01:01:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 1.451219512195122) internal successors, (952), 656 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 952 transitions. [2023-12-20 01:01:10,714 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 952 transitions. Word has length 42 [2023-12-20 01:01:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:10,716 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 952 transitions. [2023-12-20 01:01:10,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 952 transitions. [2023-12-20 01:01:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-20 01:01:10,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:10,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:10,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 01:01:10,718 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:10,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:10,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2131350025, now seen corresponding path program 1 times [2023-12-20 01:01:10,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:10,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141533734] [2023-12-20 01:01:10,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:10,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-20 01:01:10,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:10,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141533734] [2023-12-20 01:01:10,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141533734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:10,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:10,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 01:01:10,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024868362] [2023-12-20 01:01:10,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:10,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 01:01:10,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:10,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 01:01:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 01:01:10,861 INFO L87 Difference]: Start difference. First operand 657 states and 952 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:10,938 INFO L93 Difference]: Finished difference Result 1517 states and 2240 transitions. [2023-12-20 01:01:10,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 01:01:10,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) Word has length 59 [2023-12-20 01:01:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:10,946 INFO L225 Difference]: With dead ends: 1517 [2023-12-20 01:01:10,946 INFO L226 Difference]: Without dead ends: 1195 [2023-12-20 01:01:10,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 01:01:10,949 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 232 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:10,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 348 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2023-12-20 01:01:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 969. [2023-12-20 01:01:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 1.4545454545454546) internal successors, (1408), 968 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1408 transitions. [2023-12-20 01:01:10,985 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1408 transitions. Word has length 59 [2023-12-20 01:01:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:10,986 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1408 transitions. [2023-12-20 01:01:10,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1408 transitions. [2023-12-20 01:01:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-20 01:01:10,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:10,987 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:10,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 01:01:10,988 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:10,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:10,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1689888535, now seen corresponding path program 1 times [2023-12-20 01:01:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:10,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530591386] [2023-12-20 01:01:10,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:10,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-20 01:01:11,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:11,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530591386] [2023-12-20 01:01:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530591386] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:11,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:11,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 01:01:11,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282183151] [2023-12-20 01:01:11,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:11,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 01:01:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:11,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 01:01:11,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 01:01:11,129 INFO L87 Difference]: Start difference. First operand 969 states and 1408 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:11,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:11,213 INFO L93 Difference]: Finished difference Result 1829 states and 2696 transitions. [2023-12-20 01:01:11,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 01:01:11,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) Word has length 59 [2023-12-20 01:01:11,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:11,219 INFO L225 Difference]: With dead ends: 1829 [2023-12-20 01:01:11,220 INFO L226 Difference]: Without dead ends: 1507 [2023-12-20 01:01:11,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 01:01:11,225 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 225 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:11,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 367 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2023-12-20 01:01:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1281. [2023-12-20 01:01:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.45625) internal successors, (1864), 1280 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1864 transitions. [2023-12-20 01:01:11,270 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1864 transitions. Word has length 59 [2023-12-20 01:01:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:11,271 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1864 transitions. [2023-12-20 01:01:11,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1864 transitions. [2023-12-20 01:01:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 01:01:11,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:11,273 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:11,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 01:01:11,273 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:11,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash 368266173, now seen corresponding path program 1 times [2023-12-20 01:01:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:11,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260192045] [2023-12-20 01:01:11,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:11,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:11,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:11,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260192045] [2023-12-20 01:01:11,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260192045] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:11,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:11,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:01:11,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353559029] [2023-12-20 01:01:11,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:11,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:01:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:01:11,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:01:11,358 INFO L87 Difference]: Start difference. First operand 1281 states and 1864 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:11,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:11,395 INFO L93 Difference]: Finished difference Result 2541 states and 3706 transitions. [2023-12-20 01:01:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:01:11,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) Word has length 60 [2023-12-20 01:01:11,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:11,400 INFO L225 Difference]: With dead ends: 2541 [2023-12-20 01:01:11,400 INFO L226 Difference]: Without dead ends: 1283 [2023-12-20 01:01:11,401 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-20 01:01:11,402 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 40 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:11,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 172 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2023-12-20 01:01:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1281. [2023-12-20 01:01:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.4375) internal successors, (1840), 1280 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1840 transitions. [2023-12-20 01:01:11,438 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1840 transitions. Word has length 60 [2023-12-20 01:01:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:11,438 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1840 transitions. [2023-12-20 01:01:11,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1840 transitions. [2023-12-20 01:01:11,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 01:01:11,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:11,439 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 01:01:11,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 01:01:11,439 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:11,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash 874551518, now seen corresponding path program 1 times [2023-12-20 01:01:11,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:11,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639145298] [2023-12-20 01:01:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:11,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:11,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:11,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639145298] [2023-12-20 01:01:11,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639145298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:11,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:11,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:01:11,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219600234] [2023-12-20 01:01:11,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:11,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:01:11,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:11,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:01:11,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:01:11,526 INFO L87 Difference]: Start difference. First operand 1281 states and 1840 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:11,551 INFO L93 Difference]: Finished difference Result 1913 states and 2750 transitions. [2023-12-20 01:01:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:01:11,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) Word has length 60 [2023-12-20 01:01:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:11,555 INFO L225 Difference]: With dead ends: 1913 [2023-12-20 01:01:11,555 INFO L226 Difference]: Without dead ends: 655 [2023-12-20 01:01:11,556 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-20 01:01:11,556 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 34 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:11,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-20 01:01:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 653. [2023-12-20 01:01:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 652 states have (on average 1.4110429447852761) internal successors, (920), 652 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 920 transitions. [2023-12-20 01:01:11,575 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 920 transitions. Word has length 60 [2023-12-20 01:01:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:11,575 INFO L495 AbstractCegarLoop]: Abstraction has 653 states and 920 transitions. [2023-12-20 01:01:11,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 920 transitions. [2023-12-20 01:01:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 01:01:11,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:11,576 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 01:01:11,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 01:01:11,577 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:11,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:11,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1468293505, now seen corresponding path program 1 times [2023-12-20 01:01:11,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:11,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462375086] [2023-12-20 01:01:11,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:11,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:13,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:13,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462375086] [2023-12-20 01:01:13,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462375086] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:01:13,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854645704] [2023-12-20 01:01:13,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:13,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:01:13,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:01:13,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:01:13,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 01:01:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:14,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-20 01:01:14,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:01:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 01:01:14,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:01:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 01:01:14,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854645704] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:01:14,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:01:14,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 16 [2023-12-20 01:01:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751217513] [2023-12-20 01:01:14,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:01:14,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-20 01:01:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-20 01:01:14,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-12-20 01:01:14,331 INFO L87 Difference]: Start difference. First operand 653 states and 920 transitions. Second operand has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:17,347 INFO L93 Difference]: Finished difference Result 4827 states and 6699 transitions. [2023-12-20 01:01:17,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-20 01:01:17,348 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 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) Word has length 60 [2023-12-20 01:01:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:17,362 INFO L225 Difference]: With dead ends: 4827 [2023-12-20 01:01:17,362 INFO L226 Difference]: Without dead ends: 4385 [2023-12-20 01:01:17,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=585, Invalid=2721, Unknown=0, NotChecked=0, Total=3306 [2023-12-20 01:01:17,365 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 2324 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2324 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:17,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2324 Valid, 1278 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-20 01:01:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4385 states. [2023-12-20 01:01:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4385 to 3045. [2023-12-20 01:01:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3045 states, 3044 states have (on average 1.3804204993429698) internal successors, (4202), 3044 states have internal predecessors, (4202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 4202 transitions. [2023-12-20 01:01:17,473 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 4202 transitions. Word has length 60 [2023-12-20 01:01:17,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:17,473 INFO L495 AbstractCegarLoop]: Abstraction has 3045 states and 4202 transitions. [2023-12-20 01:01:17,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 4202 transitions. [2023-12-20 01:01:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 01:01:17,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:17,475 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 01:01:17,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 01:01:17,681 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,SelfDestructingSolverStorable11 [2023-12-20 01:01:17,681 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:17,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:17,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1896028180, now seen corresponding path program 1 times [2023-12-20 01:01:17,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:17,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366165563] [2023-12-20 01:01:17,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:17,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 01:01:17,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:17,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366165563] [2023-12-20 01:01:17,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366165563] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:17,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:17,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 01:01:17,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114776666] [2023-12-20 01:01:17,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:17,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 01:01:17,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:17,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 01:01:17,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 01:01:17,752 INFO L87 Difference]: Start difference. First operand 3045 states and 4202 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:17,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:17,852 INFO L93 Difference]: Finished difference Result 4780 states and 6655 transitions. [2023-12-20 01:01:17,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 01:01:17,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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) Word has length 61 [2023-12-20 01:01:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:17,867 INFO L225 Difference]: With dead ends: 4780 [2023-12-20 01:01:17,867 INFO L226 Difference]: Without dead ends: 4217 [2023-12-20 01:01:17,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 01:01:17,870 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 216 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:17,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 350 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2023-12-20 01:01:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 3614. [2023-12-20 01:01:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3613 states have (on average 1.3794630500968723) internal successors, (4984), 3613 states have internal predecessors, (4984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 4984 transitions. [2023-12-20 01:01:17,984 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 4984 transitions. Word has length 61 [2023-12-20 01:01:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:17,984 INFO L495 AbstractCegarLoop]: Abstraction has 3614 states and 4984 transitions. [2023-12-20 01:01:17,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 4984 transitions. [2023-12-20 01:01:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-20 01:01:17,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:17,985 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 01:01:17,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 01:01:17,986 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:17,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:17,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1777210284, now seen corresponding path program 1 times [2023-12-20 01:01:17,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:17,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090716479] [2023-12-20 01:01:17,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:17,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:18,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:18,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090716479] [2023-12-20 01:01:18,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090716479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:18,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:18,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:01:18,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951122878] [2023-12-20 01:01:18,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:18,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:01:18,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:18,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:01:18,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:01:18,043 INFO L87 Difference]: Start difference. First operand 3614 states and 4984 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:18,124 INFO L93 Difference]: Finished difference Result 5423 states and 7448 transitions. [2023-12-20 01:01:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:01:18,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 62 [2023-12-20 01:01:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:18,131 INFO L225 Difference]: With dead ends: 5423 [2023-12-20 01:01:18,131 INFO L226 Difference]: Without dead ends: 1832 [2023-12-20 01:01:18,134 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-20 01:01:18,135 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 24 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:18,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 142 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2023-12-20 01:01:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1830. [2023-12-20 01:01:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1829 states have (on average 1.3340623291416074) internal successors, (2440), 1829 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2440 transitions. [2023-12-20 01:01:18,188 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2440 transitions. Word has length 62 [2023-12-20 01:01:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:18,188 INFO L495 AbstractCegarLoop]: Abstraction has 1830 states and 2440 transitions. [2023-12-20 01:01:18,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2440 transitions. [2023-12-20 01:01:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-20 01:01:18,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:18,189 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:18,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 01:01:18,189 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:18,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:18,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1434439608, now seen corresponding path program 1 times [2023-12-20 01:01:18,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:18,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414478731] [2023-12-20 01:01:18,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:18,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:18,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:18,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414478731] [2023-12-20 01:01:18,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414478731] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:01:18,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347037613] [2023-12-20 01:01:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:18,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:01:18,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:01:18,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:01:18,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 01:01:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:18,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-20 01:01:18,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:01:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:19,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:01:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347037613] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:01:20,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:01:20,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2023-12-20 01:01:20,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668792384] [2023-12-20 01:01:20,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:01:20,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-20 01:01:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:20,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-20 01:01:20,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2023-12-20 01:01:20,148 INFO L87 Difference]: Start difference. First operand 1830 states and 2440 transitions. Second operand has 27 states, 27 states have (on average 5.962962962962963) internal successors, (161), 26 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:20,790 INFO L93 Difference]: Finished difference Result 3760 states and 5021 transitions. [2023-12-20 01:01:20,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-20 01:01:20,791 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.962962962962963) internal successors, (161), 26 states have internal predecessors, (161), 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) Word has length 64 [2023-12-20 01:01:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:20,798 INFO L225 Difference]: With dead ends: 3760 [2023-12-20 01:01:20,798 INFO L226 Difference]: Without dead ends: 2196 [2023-12-20 01:01:20,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=387, Invalid=1419, Unknown=0, NotChecked=0, Total=1806 [2023-12-20 01:01:20,802 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 833 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:20,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 621 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 01:01:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2023-12-20 01:01:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 1911. [2023-12-20 01:01:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1910 states have (on average 1.33717277486911) internal successors, (2554), 1910 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2554 transitions. [2023-12-20 01:01:20,867 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2554 transitions. Word has length 64 [2023-12-20 01:01:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:20,868 INFO L495 AbstractCegarLoop]: Abstraction has 1911 states and 2554 transitions. [2023-12-20 01:01:20,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.962962962962963) internal successors, (161), 26 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2554 transitions. [2023-12-20 01:01:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-20 01:01:20,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:20,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:20,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 01:01:21,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-20 01:01:21,075 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:21,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2058939322, now seen corresponding path program 1 times [2023-12-20 01:01:21,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:21,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384876284] [2023-12-20 01:01:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:21,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:21,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:21,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384876284] [2023-12-20 01:01:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384876284] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:01:21,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773082301] [2023-12-20 01:01:21,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:21,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:01:21,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:01:21,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:01:21,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 01:01:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:21,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-20 01:01:21,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:01:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:22,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:01:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:24,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773082301] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:01:24,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:01:24,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 16] total 36 [2023-12-20 01:01:24,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11645101] [2023-12-20 01:01:24,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:01:24,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-20 01:01:24,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:24,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-20 01:01:24,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2023-12-20 01:01:24,462 INFO L87 Difference]: Start difference. First operand 1911 states and 2554 transitions. Second operand has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:31,312 INFO L93 Difference]: Finished difference Result 11916 states and 15784 transitions. [2023-12-20 01:01:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-12-20 01:01:31,313 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 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) Word has length 64 [2023-12-20 01:01:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:31,343 INFO L225 Difference]: With dead ends: 11916 [2023-12-20 01:01:31,343 INFO L226 Difference]: Without dead ends: 10039 [2023-12-20 01:01:31,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7521 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4285, Invalid=15455, Unknown=0, NotChecked=0, Total=19740 [2023-12-20 01:01:31,355 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 3927 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3927 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:31,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3927 Valid, 1205 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-20 01:01:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10039 states. [2023-12-20 01:01:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10039 to 8997. [2023-12-20 01:01:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8997 states, 8996 states have (on average 1.3279235215651402) internal successors, (11946), 8996 states have internal predecessors, (11946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8997 states to 8997 states and 11946 transitions. [2023-12-20 01:01:31,679 INFO L78 Accepts]: Start accepts. Automaton has 8997 states and 11946 transitions. Word has length 64 [2023-12-20 01:01:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:31,679 INFO L495 AbstractCegarLoop]: Abstraction has 8997 states and 11946 transitions. [2023-12-20 01:01:31,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 8997 states and 11946 transitions. [2023-12-20 01:01:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-20 01:01:31,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:31,681 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:31,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 01:01:31,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:01:31,888 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:31,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1858086330, now seen corresponding path program 1 times [2023-12-20 01:01:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:31,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537545925] [2023-12-20 01:01:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:31,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:31,943 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-20 01:01:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:31,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537545925] [2023-12-20 01:01:31,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537545925] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:31,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:31,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:01:31,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801409729] [2023-12-20 01:01:31,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:31,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:01:31,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:31,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:01:31,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:01:31,945 INFO L87 Difference]: Start difference. First operand 8997 states and 11946 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:32,185 INFO L93 Difference]: Finished difference Result 19900 states and 26394 transitions. [2023-12-20 01:01:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:01:32,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) Word has length 64 [2023-12-20 01:01:32,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:32,208 INFO L225 Difference]: With dead ends: 19900 [2023-12-20 01:01:32,208 INFO L226 Difference]: Without dead ends: 11330 [2023-12-20 01:01:32,220 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-20 01:01:32,221 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 36 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:32,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 194 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11330 states. [2023-12-20 01:01:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11330 to 10028. [2023-12-20 01:01:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10028 states, 10027 states have (on average 1.3103620225391444) internal successors, (13139), 10027 states have internal predecessors, (13139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10028 states to 10028 states and 13139 transitions. [2023-12-20 01:01:32,598 INFO L78 Accepts]: Start accepts. Automaton has 10028 states and 13139 transitions. Word has length 64 [2023-12-20 01:01:32,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:32,598 INFO L495 AbstractCegarLoop]: Abstraction has 10028 states and 13139 transitions. [2023-12-20 01:01:32,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 10028 states and 13139 transitions. [2023-12-20 01:01:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-20 01:01:32,599 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:32,600 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:32,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-20 01:01:32,600 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:32,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1458552471, now seen corresponding path program 1 times [2023-12-20 01:01:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:32,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360952027] [2023-12-20 01:01:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:32,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:32,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:32,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360952027] [2023-12-20 01:01:32,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360952027] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:01:32,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894045274] [2023-12-20 01:01:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:32,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:01:32,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:01:32,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:01:32,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 01:01:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:32,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 01:01:32,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:01:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:32,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:01:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:33,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894045274] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:01:33,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:01:33,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-12-20 01:01:33,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273380811] [2023-12-20 01:01:33,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:01:33,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 01:01:33,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 01:01:33,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-20 01:01:33,027 INFO L87 Difference]: Start difference. First operand 10028 states and 13139 transitions. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:33,360 INFO L93 Difference]: Finished difference Result 13333 states and 17435 transitions. [2023-12-20 01:01:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 01:01:33,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 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) Word has length 64 [2023-12-20 01:01:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:33,378 INFO L225 Difference]: With dead ends: 13333 [2023-12-20 01:01:33,379 INFO L226 Difference]: Without dead ends: 10260 [2023-12-20 01:01:33,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-12-20 01:01:33,385 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 330 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:33,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 294 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 01:01:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10260 states. [2023-12-20 01:01:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10260 to 9469. [2023-12-20 01:01:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9469 states, 9468 states have (on average 1.3059780312632023) internal successors, (12365), 9468 states have internal predecessors, (12365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9469 states to 9469 states and 12365 transitions. [2023-12-20 01:01:33,756 INFO L78 Accepts]: Start accepts. Automaton has 9469 states and 12365 transitions. Word has length 64 [2023-12-20 01:01:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:33,756 INFO L495 AbstractCegarLoop]: Abstraction has 9469 states and 12365 transitions. [2023-12-20 01:01:33,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:33,756 INFO L276 IsEmpty]: Start isEmpty. Operand 9469 states and 12365 transitions. [2023-12-20 01:01:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-20 01:01:33,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:33,758 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:33,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 01:01:33,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-20 01:01:33,964 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:33,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:33,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1889703016, now seen corresponding path program 1 times [2023-12-20 01:01:33,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:33,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989321132] [2023-12-20 01:01:33,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:33,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:34,012 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-20 01:01:34,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:34,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989321132] [2023-12-20 01:01:34,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989321132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:34,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:34,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:01:34,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902766902] [2023-12-20 01:01:34,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:34,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:01:34,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:34,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:01:34,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:01:34,015 INFO L87 Difference]: Start difference. First operand 9469 states and 12365 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:34,329 INFO L93 Difference]: Finished difference Result 20253 states and 26404 transitions. [2023-12-20 01:01:34,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:01:34,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) Word has length 65 [2023-12-20 01:01:34,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:34,347 INFO L225 Difference]: With dead ends: 20253 [2023-12-20 01:01:34,348 INFO L226 Difference]: Without dead ends: 11659 [2023-12-20 01:01:34,359 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-20 01:01:34,359 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 36 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:34,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 162 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11659 states. [2023-12-20 01:01:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11659 to 9797. [2023-12-20 01:01:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9797 states, 9796 states have (on average 1.2787872601061658) internal successors, (12527), 9796 states have internal predecessors, (12527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9797 states to 9797 states and 12527 transitions. [2023-12-20 01:01:34,752 INFO L78 Accepts]: Start accepts. Automaton has 9797 states and 12527 transitions. Word has length 65 [2023-12-20 01:01:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:34,752 INFO L495 AbstractCegarLoop]: Abstraction has 9797 states and 12527 transitions. [2023-12-20 01:01:34,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 9797 states and 12527 transitions. [2023-12-20 01:01:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-20 01:01:34,754 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:34,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:34,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-20 01:01:34,755 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:34,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash 218536011, now seen corresponding path program 1 times [2023-12-20 01:01:34,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:34,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333714950] [2023-12-20 01:01:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:34,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:34,800 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-20 01:01:34,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:34,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333714950] [2023-12-20 01:01:34,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333714950] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:34,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:34,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:01:34,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461809821] [2023-12-20 01:01:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:34,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:01:34,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:34,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:01:34,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:01:34,804 INFO L87 Difference]: Start difference. First operand 9797 states and 12527 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:35,027 INFO L93 Difference]: Finished difference Result 13368 states and 17036 transitions. [2023-12-20 01:01:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:01:35,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) Word has length 65 [2023-12-20 01:01:35,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:35,042 INFO L225 Difference]: With dead ends: 13368 [2023-12-20 01:01:35,043 INFO L226 Difference]: Without dead ends: 8217 [2023-12-20 01:01:35,049 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-20 01:01:35,050 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 36 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:35,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 208 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2023-12-20 01:01:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 7762. [2023-12-20 01:01:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7762 states, 7761 states have (on average 1.258214147661384) internal successors, (9765), 7761 states have internal predecessors, (9765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7762 states to 7762 states and 9765 transitions. [2023-12-20 01:01:35,410 INFO L78 Accepts]: Start accepts. Automaton has 7762 states and 9765 transitions. Word has length 65 [2023-12-20 01:01:35,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:35,410 INFO L495 AbstractCegarLoop]: Abstraction has 7762 states and 9765 transitions. [2023-12-20 01:01:35,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:35,411 INFO L276 IsEmpty]: Start isEmpty. Operand 7762 states and 9765 transitions. [2023-12-20 01:01:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-20 01:01:35,412 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:35,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:35,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-20 01:01:35,412 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:35,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:35,413 INFO L85 PathProgramCache]: Analyzing trace with hash 38994696, now seen corresponding path program 1 times [2023-12-20 01:01:35,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:35,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595442215] [2023-12-20 01:01:35,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:37,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:37,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595442215] [2023-12-20 01:01:37,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595442215] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:01:37,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311381788] [2023-12-20 01:01:37,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:37,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:01:37,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:01:37,171 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:01:37,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 01:01:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:37,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-20 01:01:37,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:01:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:38,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:01:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:38,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311381788] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:01:38,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:01:38,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 11] total 37 [2023-12-20 01:01:38,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449725003] [2023-12-20 01:01:38,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:01:38,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-20 01:01:38,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:38,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-20 01:01:38,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1277, Unknown=0, NotChecked=0, Total=1406 [2023-12-20 01:01:38,760 INFO L87 Difference]: Start difference. First operand 7762 states and 9765 transitions. Second operand has 38 states, 38 states have (on average 4.7105263157894735) internal successors, (179), 37 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:50,614 INFO L93 Difference]: Finished difference Result 19937 states and 24732 transitions. [2023-12-20 01:01:50,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2023-12-20 01:01:50,614 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.7105263157894735) internal successors, (179), 37 states have internal predecessors, (179), 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) Word has length 66 [2023-12-20 01:01:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:50,642 INFO L225 Difference]: With dead ends: 19937 [2023-12-20 01:01:50,643 INFO L226 Difference]: Without dead ends: 15461 [2023-12-20 01:01:50,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10588 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=6664, Invalid=21392, Unknown=0, NotChecked=0, Total=28056 [2023-12-20 01:01:50,657 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4763 mSDsluCounter, 2412 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4763 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:50,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4763 Valid, 2498 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-20 01:01:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15461 states. [2023-12-20 01:01:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15461 to 7048. [2023-12-20 01:01:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7048 states, 7047 states have (on average 1.251596424010217) internal successors, (8820), 7047 states have internal predecessors, (8820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 8820 transitions. [2023-12-20 01:01:51,136 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 8820 transitions. Word has length 66 [2023-12-20 01:01:51,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:51,136 INFO L495 AbstractCegarLoop]: Abstraction has 7048 states and 8820 transitions. [2023-12-20 01:01:51,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.7105263157894735) internal successors, (179), 37 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 8820 transitions. [2023-12-20 01:01:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-20 01:01:51,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:51,169 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:51,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-20 01:01:51,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:01:51,376 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:51,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:51,376 INFO L85 PathProgramCache]: Analyzing trace with hash 197757037, now seen corresponding path program 1 times [2023-12-20 01:01:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:51,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564184387] [2023-12-20 01:01:51,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-20 01:01:51,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564184387] [2023-12-20 01:01:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564184387] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:51,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:51,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:01:51,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797104090] [2023-12-20 01:01:51,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:51,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:01:51,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:51,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:01:51,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:01:51,455 INFO L87 Difference]: Start difference. First operand 7048 states and 8820 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:52,404 INFO L93 Difference]: Finished difference Result 18777 states and 23272 transitions. [2023-12-20 01:01:52,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:01:52,404 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), 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) Word has length 105 [2023-12-20 01:01:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:52,433 INFO L225 Difference]: With dead ends: 18777 [2023-12-20 01:01:52,433 INFO L226 Difference]: Without dead ends: 12111 [2023-12-20 01:01:52,450 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-20 01:01:52,451 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 34 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:52,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 167 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:01:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12111 states. [2023-12-20 01:01:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12111 to 11994. [2023-12-20 01:01:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11994 states, 11993 states have (on average 1.2080380221796048) internal successors, (14488), 11993 states have internal predecessors, (14488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11994 states to 11994 states and 14488 transitions. [2023-12-20 01:01:53,343 INFO L78 Accepts]: Start accepts. Automaton has 11994 states and 14488 transitions. Word has length 105 [2023-12-20 01:01:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:53,343 INFO L495 AbstractCegarLoop]: Abstraction has 11994 states and 14488 transitions. [2023-12-20 01:01:53,356 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 11994 states and 14488 transitions. [2023-12-20 01:01:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-20 01:01:53,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:53,364 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:53,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-20 01:01:53,364 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:53,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:53,364 INFO L85 PathProgramCache]: Analyzing trace with hash 116982321, now seen corresponding path program 1 times [2023-12-20 01:01:53,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:53,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834811087] [2023-12-20 01:01:53,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:53,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-20 01:01:53,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:53,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834811087] [2023-12-20 01:01:53,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834811087] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:01:53,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:01:53,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:01:53,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049336977] [2023-12-20 01:01:53,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:01:53,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:01:53,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:53,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:01:53,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:01:53,462 INFO L87 Difference]: Start difference. First operand 11994 states and 14488 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:01:54,103 INFO L93 Difference]: Finished difference Result 12941 states and 15583 transitions. [2023-12-20 01:01:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:01:54,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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) Word has length 105 [2023-12-20 01:01:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:01:54,116 INFO L225 Difference]: With dead ends: 12941 [2023-12-20 01:01:54,116 INFO L226 Difference]: Without dead ends: 9077 [2023-12-20 01:01:54,122 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-20 01:01:54,124 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 28 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 01:01:54,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 169 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 01:01:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9077 states. [2023-12-20 01:01:54,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9077 to 9075. [2023-12-20 01:01:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9075 states, 9074 states have (on average 1.187899493057086) internal successors, (10779), 9074 states have internal predecessors, (10779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 10779 transitions. [2023-12-20 01:01:54,574 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 10779 transitions. Word has length 105 [2023-12-20 01:01:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:01:54,574 INFO L495 AbstractCegarLoop]: Abstraction has 9075 states and 10779 transitions. [2023-12-20 01:01:54,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:01:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 10779 transitions. [2023-12-20 01:01:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-20 01:01:54,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:01:54,579 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:01:54,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-20 01:01:54,580 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:01:54,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:01:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash 24378048, now seen corresponding path program 1 times [2023-12-20 01:01:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:01:54,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410935415] [2023-12-20 01:01:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:01:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-20 01:01:54,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:01:54,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410935415] [2023-12-20 01:01:54,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410935415] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:01:54,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284815258] [2023-12-20 01:01:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:01:54,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:01:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:01:54,992 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:01:54,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 01:01:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:01:55,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-20 01:01:55,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:01:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:55,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:01:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:01:57,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284815258] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:01:57,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:01:57,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 29 [2023-12-20 01:01:57,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310830626] [2023-12-20 01:01:57,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:01:57,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-20 01:01:57,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:01:57,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-20 01:01:57,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2023-12-20 01:01:57,122 INFO L87 Difference]: Start difference. First operand 9075 states and 10779 transitions. Second operand has 29 states, 29 states have (on average 9.03448275862069) internal successors, (262), 29 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:02:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:02:03,425 INFO L93 Difference]: Finished difference Result 30535 states and 36122 transitions. [2023-12-20 01:02:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-12-20 01:02:03,426 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.03448275862069) internal successors, (262), 29 states have internal predecessors, (262), 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) Word has length 106 [2023-12-20 01:02:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:02:03,445 INFO L225 Difference]: With dead ends: 30535 [2023-12-20 01:02:03,445 INFO L226 Difference]: Without dead ends: 22561 [2023-12-20 01:02:03,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3753 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1957, Invalid=10925, Unknown=0, NotChecked=0, Total=12882 [2023-12-20 01:02:03,452 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 2844 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2844 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-20 01:02:03,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2844 Valid, 2348 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-20 01:02:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22561 states. [2023-12-20 01:02:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22561 to 16217. [2023-12-20 01:02:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16217 states, 16216 states have (on average 1.1818574247656635) internal successors, (19165), 16216 states have internal predecessors, (19165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:02:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16217 states to 16217 states and 19165 transitions. [2023-12-20 01:02:04,440 INFO L78 Accepts]: Start accepts. Automaton has 16217 states and 19165 transitions. Word has length 106 [2023-12-20 01:02:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:02:04,440 INFO L495 AbstractCegarLoop]: Abstraction has 16217 states and 19165 transitions. [2023-12-20 01:02:04,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.03448275862069) internal successors, (262), 29 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:02:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 16217 states and 19165 transitions. [2023-12-20 01:02:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-20 01:02:04,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:02:04,451 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2023-12-20 01:02:04,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-20 01:02:04,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:02:04,658 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:02:04,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:02:04,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1057120159, now seen corresponding path program 1 times [2023-12-20 01:02:04,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:02:04,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554035936] [2023-12-20 01:02:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:02:04,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:02:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:02:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-20 01:02:04,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:02:04,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554035936] [2023-12-20 01:02:04,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554035936] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:02:04,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069862695] [2023-12-20 01:02:04,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:02:04,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:02:04,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:02:04,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:02:04,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 01:02:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:02:04,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 01:02:04,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:02:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 63 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-20 01:02:05,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:02:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 63 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-20 01:02:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069862695] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:02:05,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:02:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2023-12-20 01:02:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948024760] [2023-12-20 01:02:05,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:02:05,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 01:02:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:02:05,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 01:02:05,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-12-20 01:02:05,174 INFO L87 Difference]: Start difference. First operand 16217 states and 19165 transitions. Second operand has 14 states, 14 states have (on average 20.642857142857142) internal successors, (289), 14 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:02:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:02:05,901 INFO L93 Difference]: Finished difference Result 21812 states and 25727 transitions. [2023-12-20 01:02:05,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 01:02:05,901 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.642857142857142) internal successors, (289), 14 states have internal predecessors, (289), 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) Word has length 107 [2023-12-20 01:02:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:02:05,916 INFO L225 Difference]: With dead ends: 21812 [2023-12-20 01:02:05,917 INFO L226 Difference]: Without dead ends: 16045 [2023-12-20 01:02:05,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2023-12-20 01:02:05,923 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 307 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 01:02:05,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 463 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 01:02:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16045 states. [2023-12-20 01:02:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16045 to 15320. [2023-12-20 01:02:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15320 states, 15319 states have (on average 1.1761864351458973) internal successors, (18018), 15319 states have internal predecessors, (18018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:02:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15320 states to 15320 states and 18018 transitions. [2023-12-20 01:02:06,663 INFO L78 Accepts]: Start accepts. Automaton has 15320 states and 18018 transitions. Word has length 107 [2023-12-20 01:02:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:02:06,663 INFO L495 AbstractCegarLoop]: Abstraction has 15320 states and 18018 transitions. [2023-12-20 01:02:06,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.642857142857142) internal successors, (289), 14 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:02:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 15320 states and 18018 transitions. [2023-12-20 01:02:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-20 01:02:06,670 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:02:06,670 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:02:06,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-20 01:02:06,876 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-20 01:02:06,876 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:02:06,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:02:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash 397588637, now seen corresponding path program 1 times [2023-12-20 01:02:06,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:02:06,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936687086] [2023-12-20 01:02:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:02:06,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:02:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:02:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:02:07,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:02:07,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936687086] [2023-12-20 01:02:07,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936687086] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:02:07,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905567064] [2023-12-20 01:02:07,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:02:07,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:02:07,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:02:07,773 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:02:07,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 01:02:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:02:07,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-20 01:02:07,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:02:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:02:08,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:02:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 34 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:02:10,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905567064] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:02:10,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:02:10,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 39 [2023-12-20 01:02:10,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340846702] [2023-12-20 01:02:10,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:02:10,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-20 01:02:10,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:02:10,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-20 01:02:10,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1342, Unknown=0, NotChecked=0, Total=1482 [2023-12-20 01:02:10,879 INFO L87 Difference]: Start difference. First operand 15320 states and 18018 transitions. Second operand has 39 states, 39 states have (on average 7.666666666666667) internal successors, (299), 39 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:02:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:02:29,561 INFO L93 Difference]: Finished difference Result 56649 states and 66714 transitions. [2023-12-20 01:02:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2023-12-20 01:02:29,562 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.666666666666667) internal successors, (299), 39 states have internal predecessors, (299), 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) Word has length 107 [2023-12-20 01:02:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:02:29,604 INFO L225 Difference]: With dead ends: 56649 [2023-12-20 01:02:29,605 INFO L226 Difference]: Without dead ends: 41697 [2023-12-20 01:02:29,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11932 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=5958, Invalid=29574, Unknown=0, NotChecked=0, Total=35532 [2023-12-20 01:02:29,613 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 2327 mSDsluCounter, 3254 mSDsCounter, 0 mSdLazyCounter, 3448 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2327 SdHoareTripleChecker+Valid, 3379 SdHoareTripleChecker+Invalid, 3563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-20 01:02:29,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2327 Valid, 3379 Invalid, 3563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3448 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-20 01:02:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41697 states. [2023-12-20 01:02:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41697 to 29785. [2023-12-20 01:02:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29785 states, 29784 states have (on average 1.176269137792103) internal successors, (35034), 29784 states have internal predecessors, (35034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:02:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29785 states to 29785 states and 35034 transitions. [2023-12-20 01:02:31,489 INFO L78 Accepts]: Start accepts. Automaton has 29785 states and 35034 transitions. Word has length 107 [2023-12-20 01:02:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:02:31,489 INFO L495 AbstractCegarLoop]: Abstraction has 29785 states and 35034 transitions. [2023-12-20 01:02:31,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.666666666666667) internal successors, (299), 39 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:02:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 29785 states and 35034 transitions. [2023-12-20 01:02:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-20 01:02:31,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:02:31,495 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:02:31,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-20 01:02:31,702 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-20 01:02:31,702 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:02:31,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:02:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 355840521, now seen corresponding path program 1 times [2023-12-20 01:02:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:02:31,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303025502] [2023-12-20 01:02:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:02:31,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:02:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:02:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-20 01:02:31,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:02:31,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303025502] [2023-12-20 01:02:31,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303025502] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 01:02:31,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 01:02:31,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 01:02:31,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944272788] [2023-12-20 01:02:31,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 01:02:31,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 01:02:31,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:02:31,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 01:02:31,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 01:02:31,767 INFO L87 Difference]: Start difference. First operand 29785 states and 35034 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:02:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:02:33,271 INFO L93 Difference]: Finished difference Result 40813 states and 47840 transitions. [2023-12-20 01:02:33,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 01:02:33,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) Word has length 107 [2023-12-20 01:02:33,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:02:33,289 INFO L225 Difference]: With dead ends: 40813 [2023-12-20 01:02:33,289 INFO L226 Difference]: Without dead ends: 23292 [2023-12-20 01:02:33,294 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-20 01:02:33,295 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 26 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:02:33,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 196 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 01:02:33,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23292 states. [2023-12-20 01:02:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23292 to 18185. [2023-12-20 01:02:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18185 states, 18184 states have (on average 1.1587659480862296) internal successors, (21071), 18184 states have internal predecessors, (21071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:02:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18185 states to 18185 states and 21071 transitions. [2023-12-20 01:02:34,319 INFO L78 Accepts]: Start accepts. Automaton has 18185 states and 21071 transitions. Word has length 107 [2023-12-20 01:02:34,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:02:34,319 INFO L495 AbstractCegarLoop]: Abstraction has 18185 states and 21071 transitions. [2023-12-20 01:02:34,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:02:34,319 INFO L276 IsEmpty]: Start isEmpty. Operand 18185 states and 21071 transitions. [2023-12-20 01:02:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-20 01:02:34,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:02:34,322 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:02:34,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-20 01:02:34,322 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:02:34,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:02:34,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1036190653, now seen corresponding path program 1 times [2023-12-20 01:02:34,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:02:34,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603883820] [2023-12-20 01:02:34,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:02:34,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:02:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:02:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 33 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:02:35,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:02:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603883820] [2023-12-20 01:02:35,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603883820] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:02:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658980640] [2023-12-20 01:02:35,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:02:35,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:02:35,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:02:35,016 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:02:35,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 01:02:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:02:35,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-20 01:02:35,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:02:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 33 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:02:37,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:02:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 33 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:02:40,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658980640] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:02:40,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:02:40,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22, 22] total 52 [2023-12-20 01:02:40,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653687658] [2023-12-20 01:02:40,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:02:40,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-20 01:02:40,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:02:40,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-20 01:02:40,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=2352, Unknown=0, NotChecked=0, Total=2756 [2023-12-20 01:02:40,229 INFO L87 Difference]: Start difference. First operand 18185 states and 21071 transitions. Second operand has 53 states, 53 states have (on average 4.867924528301887) internal successors, (258), 52 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:03:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:03:29,256 INFO L93 Difference]: Finished difference Result 51630 states and 59784 transitions. [2023-12-20 01:03:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2023-12-20 01:03:29,256 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 4.867924528301887) internal successors, (258), 52 states have internal predecessors, (258), 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) Word has length 108 [2023-12-20 01:03:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:03:29,295 INFO L225 Difference]: With dead ends: 51630 [2023-12-20 01:03:29,295 INFO L226 Difference]: Without dead ends: 43178 [2023-12-20 01:03:29,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69485 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=21715, Invalid=132341, Unknown=0, NotChecked=0, Total=154056 [2023-12-20 01:03:29,312 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 8455 mSDsluCounter, 6097 mSDsCounter, 0 mSdLazyCounter, 5810 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8455 SdHoareTripleChecker+Valid, 6402 SdHoareTripleChecker+Invalid, 6109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 5810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-20 01:03:29,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8455 Valid, 6402 Invalid, 6109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 5810 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-20 01:03:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43178 states. [2023-12-20 01:03:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43178 to 25125. [2023-12-20 01:03:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25125 states, 25124 states have (on average 1.1624343257443082) internal successors, (29205), 25124 states have internal predecessors, (29205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:03:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25125 states to 25125 states and 29205 transitions. [2023-12-20 01:03:31,265 INFO L78 Accepts]: Start accepts. Automaton has 25125 states and 29205 transitions. Word has length 108 [2023-12-20 01:03:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:03:31,265 INFO L495 AbstractCegarLoop]: Abstraction has 25125 states and 29205 transitions. [2023-12-20 01:03:31,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.867924528301887) internal successors, (258), 52 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:03:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 25125 states and 29205 transitions. [2023-12-20 01:03:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-20 01:03:31,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:03:31,268 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:03:31,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-20 01:03:31,468 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,SelfDestructingSolverStorable27 [2023-12-20 01:03:31,469 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:03:31,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:03:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash 180491105, now seen corresponding path program 1 times [2023-12-20 01:03:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:03:31,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546084450] [2023-12-20 01:03:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:03:31,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:03:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:03:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:03:32,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:03:32,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546084450] [2023-12-20 01:03:32,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546084450] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:03:32,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650851442] [2023-12-20 01:03:32,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:03:32,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:03:32,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:03:32,166 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:03:32,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 01:03:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:03:32,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-20 01:03:32,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:03:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 46 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:03:33,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:03:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 35 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:03:34,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650851442] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:03:34,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:03:34,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 39 [2023-12-20 01:03:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269082807] [2023-12-20 01:03:34,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:03:34,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-20 01:03:34,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:03:34,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-20 01:03:34,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1319, Unknown=0, NotChecked=0, Total=1482 [2023-12-20 01:03:34,904 INFO L87 Difference]: Start difference. First operand 25125 states and 29205 transitions. Second operand has 39 states, 39 states have (on average 7.615384615384615) internal successors, (297), 39 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:03:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:03:47,915 INFO L93 Difference]: Finished difference Result 84905 states and 99091 transitions. [2023-12-20 01:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-12-20 01:03:47,916 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.615384615384615) internal successors, (297), 39 states have internal predecessors, (297), 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) Word has length 108 [2023-12-20 01:03:47,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:03:47,989 INFO L225 Difference]: With dead ends: 84905 [2023-12-20 01:03:47,990 INFO L226 Difference]: Without dead ends: 65058 [2023-12-20 01:03:48,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4531 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3233, Invalid=13023, Unknown=0, NotChecked=0, Total=16256 [2023-12-20 01:03:48,008 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 2688 mSDsluCounter, 2999 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 3146 SdHoareTripleChecker+Invalid, 2624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-20 01:03:48,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2688 Valid, 3146 Invalid, 2624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-20 01:03:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65058 states. [2023-12-20 01:03:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65058 to 31106. [2023-12-20 01:03:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31106 states, 31105 states have (on average 1.1550233081498151) internal successors, (35927), 31105 states have internal predecessors, (35927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:03:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31106 states to 31106 states and 35927 transitions. [2023-12-20 01:03:51,015 INFO L78 Accepts]: Start accepts. Automaton has 31106 states and 35927 transitions. Word has length 108 [2023-12-20 01:03:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:03:51,015 INFO L495 AbstractCegarLoop]: Abstraction has 31106 states and 35927 transitions. [2023-12-20 01:03:51,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.615384615384615) internal successors, (297), 39 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:03:51,015 INFO L276 IsEmpty]: Start isEmpty. Operand 31106 states and 35927 transitions. [2023-12-20 01:03:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-20 01:03:51,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:03:51,019 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:03:51,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-20 01:03:51,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-20 01:03:51,227 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:03:51,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:03:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1783435970, now seen corresponding path program 1 times [2023-12-20 01:03:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:03:51,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690897046] [2023-12-20 01:03:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:03:51,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:03:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:03:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 31 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:03:51,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:03:51,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690897046] [2023-12-20 01:03:51,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690897046] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:03:51,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242961786] [2023-12-20 01:03:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:03:51,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:03:51,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:03:51,975 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:03:51,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-20 01:03:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:03:52,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-20 01:03:52,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:03:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-20 01:03:52,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:03:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 01:03:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242961786] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:03:54,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:03:54,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 14] total 39 [2023-12-20 01:03:54,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422953425] [2023-12-20 01:03:54,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:03:54,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-20 01:03:54,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:03:54,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-20 01:03:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2023-12-20 01:03:54,186 INFO L87 Difference]: Start difference. First operand 31106 states and 35927 transitions. Second operand has 40 states, 40 states have (on average 6.65) internal successors, (266), 39 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:04:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:04:00,358 INFO L93 Difference]: Finished difference Result 52551 states and 60605 transitions. [2023-12-20 01:04:00,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-20 01:04:00,359 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 6.65) internal successors, (266), 39 states have internal predecessors, (266), 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) Word has length 109 [2023-12-20 01:04:00,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:04:00,397 INFO L225 Difference]: With dead ends: 52551 [2023-12-20 01:04:00,397 INFO L226 Difference]: Without dead ends: 44756 [2023-12-20 01:04:00,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1185, Invalid=4821, Unknown=0, NotChecked=0, Total=6006 [2023-12-20 01:04:00,405 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 1286 mSDsluCounter, 2901 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 3024 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:04:00,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 3024 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2136 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-20 01:04:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44756 states. [2023-12-20 01:04:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44756 to 30743. [2023-12-20 01:04:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30743 states, 30742 states have (on average 1.155064732288075) internal successors, (35509), 30742 states have internal predecessors, (35509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:04:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30743 states to 30743 states and 35509 transitions. [2023-12-20 01:04:03,272 INFO L78 Accepts]: Start accepts. Automaton has 30743 states and 35509 transitions. Word has length 109 [2023-12-20 01:04:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:04:03,272 INFO L495 AbstractCegarLoop]: Abstraction has 30743 states and 35509 transitions. [2023-12-20 01:04:03,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.65) internal successors, (266), 39 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:04:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 30743 states and 35509 transitions. [2023-12-20 01:04:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-20 01:04:03,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:04:03,275 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:04:03,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-20 01:04:03,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:04:03,476 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:04:03,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:04:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2146639875, now seen corresponding path program 1 times [2023-12-20 01:04:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:04:03,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905385270] [2023-12-20 01:04:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:04:03,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:04:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:04:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 13 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:04:04,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:04:04,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905385270] [2023-12-20 01:04:04,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905385270] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:04:04,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140826454] [2023-12-20 01:04:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:04:04,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:04:04,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:04:04,475 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:04:04,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-20 01:04:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:04:04,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-20 01:04:04,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:04:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:04:07,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:04:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 13 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:04:13,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140826454] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:04:13,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:04:13,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 24] total 66 [2023-12-20 01:04:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239878627] [2023-12-20 01:04:13,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:04:13,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-20 01:04:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:04:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-20 01:04:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=3885, Unknown=0, NotChecked=0, Total=4290 [2023-12-20 01:04:13,509 INFO L87 Difference]: Start difference. First operand 30743 states and 35509 transitions. Second operand has 66 states, 66 states have (on average 4.803030303030303) internal successors, (317), 66 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:07:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:07:16,863 INFO L93 Difference]: Finished difference Result 70350 states and 81042 transitions. [2023-12-20 01:07:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 594 states. [2023-12-20 01:07:16,864 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 4.803030303030303) internal successors, (317), 66 states have internal predecessors, (317), 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) Word has length 110 [2023-12-20 01:07:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:07:16,924 INFO L225 Difference]: With dead ends: 70350 [2023-12-20 01:07:16,924 INFO L226 Difference]: Without dead ends: 54380 [2023-12-20 01:07:16,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 654 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186427 ImplicationChecksByTransitivity, 170.9s TimeCoverageRelationStatistics Valid=44255, Invalid=385425, Unknown=0, NotChecked=0, Total=429680 [2023-12-20 01:07:16,955 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 8608 mSDsluCounter, 7231 mSDsCounter, 0 mSdLazyCounter, 7939 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8608 SdHoareTripleChecker+Valid, 7474 SdHoareTripleChecker+Invalid, 8526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 7939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-12-20 01:07:16,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8608 Valid, 7474 Invalid, 8526 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [587 Valid, 7939 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2023-12-20 01:07:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54380 states. [2023-12-20 01:07:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54380 to 31878. [2023-12-20 01:07:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31878 states, 31877 states have (on average 1.1559745270884965) internal successors, (36849), 31877 states have internal predecessors, (36849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:07:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31878 states to 31878 states and 36849 transitions. [2023-12-20 01:07:20,687 INFO L78 Accepts]: Start accepts. Automaton has 31878 states and 36849 transitions. Word has length 110 [2023-12-20 01:07:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:07:20,687 INFO L495 AbstractCegarLoop]: Abstraction has 31878 states and 36849 transitions. [2023-12-20 01:07:20,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 4.803030303030303) internal successors, (317), 66 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:07:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 31878 states and 36849 transitions. [2023-12-20 01:07:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-20 01:07:20,690 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:07:20,690 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:07:20,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-20 01:07:20,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:07:20,892 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:07:20,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:07:20,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1153308494, now seen corresponding path program 1 times [2023-12-20 01:07:20,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:07:20,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313766531] [2023-12-20 01:07:20,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:07:20,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:07:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:07:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:07:22,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:07:22,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313766531] [2023-12-20 01:07:22,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313766531] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:07:22,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206530005] [2023-12-20 01:07:22,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:07:22,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:07:22,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:07:22,159 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:07:22,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-20 01:07:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:07:22,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-20 01:07:22,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:07:24,498 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 13 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:07:24,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:07:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 13 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:07:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206530005] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:07:27,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:07:27,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 19] total 60 [2023-12-20 01:07:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469361129] [2023-12-20 01:07:27,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:07:27,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-12-20 01:07:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:07:27,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-12-20 01:07:27,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3310, Unknown=0, NotChecked=0, Total=3540 [2023-12-20 01:07:27,410 INFO L87 Difference]: Start difference. First operand 31878 states and 36849 transitions. Second operand has 60 states, 60 states have (on average 5.333333333333333) internal successors, (320), 60 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:10:35,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:10:35,239 INFO L93 Difference]: Finished difference Result 137943 states and 159626 transitions. [2023-12-20 01:10:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 720 states. [2023-12-20 01:10:35,240 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 5.333333333333333) internal successors, (320), 60 states have internal predecessors, (320), 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) Word has length 111 [2023-12-20 01:10:35,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:10:35,373 INFO L225 Difference]: With dead ends: 137943 [2023-12-20 01:10:35,374 INFO L226 Difference]: Without dead ends: 122875 [2023-12-20 01:10:35,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 773 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281232 ImplicationChecksByTransitivity, 164.3s TimeCoverageRelationStatistics Valid=61299, Invalid=538551, Unknown=0, NotChecked=0, Total=599850 [2023-12-20 01:10:35,420 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 16849 mSDsluCounter, 11745 mSDsCounter, 0 mSdLazyCounter, 10501 mSolverCounterSat, 820 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16849 SdHoareTripleChecker+Valid, 12092 SdHoareTripleChecker+Invalid, 11321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 820 IncrementalHoareTripleChecker+Valid, 10501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-12-20 01:10:35,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16849 Valid, 12092 Invalid, 11321 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [820 Valid, 10501 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2023-12-20 01:10:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122875 states. [2023-12-20 01:10:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122875 to 33928. [2023-12-20 01:10:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33928 states, 33927 states have (on average 1.154891384443069) internal successors, (39182), 33927 states have internal predecessors, (39182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:10:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33928 states to 33928 states and 39182 transitions. [2023-12-20 01:10:40,469 INFO L78 Accepts]: Start accepts. Automaton has 33928 states and 39182 transitions. Word has length 111 [2023-12-20 01:10:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:10:40,469 INFO L495 AbstractCegarLoop]: Abstraction has 33928 states and 39182 transitions. [2023-12-20 01:10:40,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 5.333333333333333) internal successors, (320), 60 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:10:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 33928 states and 39182 transitions. [2023-12-20 01:10:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-20 01:10:40,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:10:40,472 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:10:40,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-20 01:10:40,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-12-20 01:10:40,673 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:10:40,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:10:40,673 INFO L85 PathProgramCache]: Analyzing trace with hash 584428503, now seen corresponding path program 1 times [2023-12-20 01:10:40,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:10:40,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451152391] [2023-12-20 01:10:40,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:10:40,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:10:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:10:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:10:42,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:10:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451152391] [2023-12-20 01:10:42,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451152391] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:10:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263632729] [2023-12-20 01:10:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:10:42,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:10:42,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:10:42,290 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:10:42,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-20 01:10:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:10:42,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-20 01:10:42,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:10:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 34 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:10:43,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:10:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 34 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 01:10:47,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263632729] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:10:47,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:10:47,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 17] total 54 [2023-12-20 01:10:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993056062] [2023-12-20 01:10:47,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:10:47,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-20 01:10:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:10:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-20 01:10:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2622, Unknown=0, NotChecked=0, Total=2862 [2023-12-20 01:10:47,041 INFO L87 Difference]: Start difference. First operand 33928 states and 39182 transitions. Second operand has 54 states, 54 states have (on average 5.592592592592593) internal successors, (302), 54 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:11:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:11:54,900 INFO L93 Difference]: Finished difference Result 75003 states and 86704 transitions. [2023-12-20 01:11:54,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2023-12-20 01:11:54,901 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.592592592592593) internal successors, (302), 54 states have internal predecessors, (302), 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) Word has length 111 [2023-12-20 01:11:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:11:54,953 INFO L225 Difference]: With dead ends: 75003 [2023-12-20 01:11:54,953 INFO L226 Difference]: Without dead ends: 57707 [2023-12-20 01:11:54,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24414 ImplicationChecksByTransitivity, 57.4s TimeCoverageRelationStatistics Valid=9872, Invalid=62758, Unknown=0, NotChecked=0, Total=72630 [2023-12-20 01:11:54,965 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 4726 mSDsluCounter, 4127 mSDsCounter, 0 mSdLazyCounter, 4272 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4726 SdHoareTripleChecker+Valid, 4284 SdHoareTripleChecker+Invalid, 4477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 4272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-20 01:11:54,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4726 Valid, 4284 Invalid, 4477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 4272 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-20 01:11:54,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57707 states. [2023-12-20 01:12:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57707 to 36084. [2023-12-20 01:12:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36084 states, 36083 states have (on average 1.155170024665355) internal successors, (41682), 36083 states have internal predecessors, (41682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:12:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36084 states to 36084 states and 41682 transitions. [2023-12-20 01:12:00,529 INFO L78 Accepts]: Start accepts. Automaton has 36084 states and 41682 transitions. Word has length 111 [2023-12-20 01:12:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:12:00,530 INFO L495 AbstractCegarLoop]: Abstraction has 36084 states and 41682 transitions. [2023-12-20 01:12:00,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.592592592592593) internal successors, (302), 54 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:12:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand 36084 states and 41682 transitions. [2023-12-20 01:12:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-20 01:12:00,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:12:00,535 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-20 01:12:00,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-20 01:12:00,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:12:00,737 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:12:00,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:12:00,737 INFO L85 PathProgramCache]: Analyzing trace with hash -942285227, now seen corresponding path program 1 times [2023-12-20 01:12:00,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:12:00,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182688049] [2023-12-20 01:12:00,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:12:00,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:12:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:12:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 135 proven. 52 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-20 01:12:01,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:12:01,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182688049] [2023-12-20 01:12:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182688049] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:12:01,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145666364] [2023-12-20 01:12:01,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:12:01,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:12:01,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:12:01,364 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:12:01,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-20 01:12:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:12:01,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-20 01:12:01,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:12:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 73 proven. 143 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-20 01:12:02,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:12:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 161 proven. 39 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-20 01:12:03,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145666364] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:12:03,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:12:03,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 31 [2023-12-20 01:12:03,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272714269] [2023-12-20 01:12:03,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:12:03,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-20 01:12:03,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:12:03,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-20 01:12:03,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2023-12-20 01:12:03,001 INFO L87 Difference]: Start difference. First operand 36084 states and 41682 transitions. Second operand has 31 states, 31 states have (on average 10.419354838709678) internal successors, (323), 31 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:12:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:12:12,896 INFO L93 Difference]: Finished difference Result 64340 states and 74449 transitions. [2023-12-20 01:12:12,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-20 01:12:12,897 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 10.419354838709678) internal successors, (323), 31 states have internal predecessors, (323), 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) Word has length 142 [2023-12-20 01:12:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:12:12,936 INFO L225 Difference]: With dead ends: 64340 [2023-12-20 01:12:12,936 INFO L226 Difference]: Without dead ends: 46258 [2023-12-20 01:12:12,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2220 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1309, Invalid=6523, Unknown=0, NotChecked=0, Total=7832 [2023-12-20 01:12:12,945 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 1752 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 01:12:12,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 1524 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 01:12:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46258 states. [2023-12-20 01:12:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46258 to 24643. [2023-12-20 01:12:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24643 states, 24642 states have (on average 1.1451586721856992) internal successors, (28219), 24642 states have internal predecessors, (28219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:12:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24643 states to 24643 states and 28219 transitions. [2023-12-20 01:12:16,930 INFO L78 Accepts]: Start accepts. Automaton has 24643 states and 28219 transitions. Word has length 142 [2023-12-20 01:12:16,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:12:16,931 INFO L495 AbstractCegarLoop]: Abstraction has 24643 states and 28219 transitions. [2023-12-20 01:12:16,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 10.419354838709678) internal successors, (323), 31 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:12:16,931 INFO L276 IsEmpty]: Start isEmpty. Operand 24643 states and 28219 transitions. [2023-12-20 01:12:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-20 01:12:16,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:12:16,936 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:12:16,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-20 01:12:17,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:12:17,137 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:12:17,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:12:17,137 INFO L85 PathProgramCache]: Analyzing trace with hash 988804817, now seen corresponding path program 1 times [2023-12-20 01:12:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:12:17,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365501345] [2023-12-20 01:12:17,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:12:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:12:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:12:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 134 proven. 84 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-20 01:12:18,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 01:12:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365501345] [2023-12-20 01:12:18,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365501345] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 01:12:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102967726] [2023-12-20 01:12:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:12:18,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 01:12:18,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 01:12:18,024 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 01:12:18,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-20 01:12:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 01:12:18,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-20 01:12:18,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 01:12:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 110 proven. 101 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 01:12:19,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 01:12:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 94 proven. 117 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 01:12:20,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102967726] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 01:12:20,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 01:12:20,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 34 [2023-12-20 01:12:20,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828600419] [2023-12-20 01:12:20,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 01:12:20,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-20 01:12:20,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 01:12:20,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-20 01:12:20,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2023-12-20 01:12:20,544 INFO L87 Difference]: Start difference. First operand 24643 states and 28219 transitions. Second operand has 35 states, 35 states have (on average 8.942857142857143) internal successors, (313), 34 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:12:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 01:12:32,708 INFO L93 Difference]: Finished difference Result 57996 states and 66761 transitions. [2023-12-20 01:12:32,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-12-20 01:12:32,709 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 8.942857142857143) internal successors, (313), 34 states have internal predecessors, (313), 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) Word has length 142 [2023-12-20 01:12:32,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 01:12:32,759 INFO L225 Difference]: With dead ends: 57996 [2023-12-20 01:12:32,759 INFO L226 Difference]: Without dead ends: 51856 [2023-12-20 01:12:32,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2099 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1656, Invalid=6176, Unknown=0, NotChecked=0, Total=7832 [2023-12-20 01:12:32,769 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 2805 mSDsluCounter, 2661 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2805 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-20 01:12:32,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2805 Valid, 2765 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-20 01:12:32,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51856 states. [2023-12-20 01:12:37,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51856 to 25270. [2023-12-20 01:12:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25270 states, 25269 states have (on average 1.1408049388578891) internal successors, (28827), 25269 states have internal predecessors, (28827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:12:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25270 states to 25270 states and 28827 transitions. [2023-12-20 01:12:37,073 INFO L78 Accepts]: Start accepts. Automaton has 25270 states and 28827 transitions. Word has length 142 [2023-12-20 01:12:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 01:12:37,074 INFO L495 AbstractCegarLoop]: Abstraction has 25270 states and 28827 transitions. [2023-12-20 01:12:37,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.942857142857143) internal successors, (313), 34 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 01:12:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 25270 states and 28827 transitions. [2023-12-20 01:12:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-20 01:12:37,079 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 01:12:37,079 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:12:37,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-20 01:12:37,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-12-20 01:12:37,280 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 01:12:37,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 01:12:37,280 INFO L85 PathProgramCache]: Analyzing trace with hash 317505678, now seen corresponding path program 1 times [2023-12-20 01:12:37,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 01:12:37,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573008312] [2023-12-20 01:12:37,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 01:12:37,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 01:12:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 01:12:37,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 01:12:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 01:12:37,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 01:12:37,366 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 01:12:37,367 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 01:12:37,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-20 01:12:37,371 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 01:12:37,374 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 01:12:37,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 01:12:37 BoogieIcfgContainer [2023-12-20 01:12:37,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 01:12:37,503 INFO L158 Benchmark]: Toolchain (without parser) took 689441.31ms. Allocated memory was 203.4MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 153.1MB in the beginning and 1.1GB in the end (delta: -976.0MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-12-20 01:12:37,504 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 203.4MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 01:12:37,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.07ms. Allocated memory is still 203.4MB. Free memory was 152.7MB in the beginning and 138.7MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 01:12:37,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.44ms. Allocated memory is still 203.4MB. Free memory was 138.7MB in the beginning and 136.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 01:12:37,507 INFO L158 Benchmark]: Boogie Preprocessor took 80.39ms. Allocated memory is still 203.4MB. Free memory was 136.4MB in the beginning and 133.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 01:12:37,508 INFO L158 Benchmark]: RCFGBuilder took 456.43ms. Allocated memory was 203.4MB in the beginning and 318.8MB in the end (delta: 115.3MB). Free memory was 133.5MB in the beginning and 286.0MB in the end (delta: -152.5MB). Peak memory consumption was 25.9MB. Max. memory is 8.0GB. [2023-12-20 01:12:37,508 INFO L158 Benchmark]: TraceAbstraction took 688582.65ms. Allocated memory was 318.8MB in the beginning and 3.3GB in the end (delta: 2.9GB). Free memory was 285.5MB in the beginning and 1.1GB in the end (delta: -843.6MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-12-20 01:12:37,508 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.13ms. Allocated memory is still 203.4MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.07ms. Allocated memory is still 203.4MB. Free memory was 152.7MB in the beginning and 138.7MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.44ms. Allocated memory is still 203.4MB. Free memory was 138.7MB in the beginning and 136.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.39ms. Allocated memory is still 203.4MB. Free memory was 136.4MB in the beginning and 133.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 456.43ms. Allocated memory was 203.4MB in the beginning and 318.8MB in the end (delta: 115.3MB). Free memory was 133.5MB in the beginning and 286.0MB in the end (delta: -152.5MB). Peak memory consumption was 25.9MB. Max. memory is 8.0GB. * TraceAbstraction took 688582.65ms. Allocated memory was 318.8MB in the beginning and 3.3GB in the end (delta: 2.9GB). Free memory was 285.5MB in the beginning and 1.1GB in the end (delta: -843.6MB). Peak memory consumption was 2.1GB. 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 - CounterExampleResult [Line: 311]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] unsigned char r1 ; [L30] port_t p1 ; [L31] char p1_old ; [L32] char p1_new ; [L33] char id1 ; [L34] char st1 ; [L35] msg_t send1 ; [L36] _Bool mode1 ; [L37] _Bool alive1 ; [L38] port_t p2 ; [L39] char p2_old ; [L40] char p2_new ; [L41] char id2 ; [L42] char st2 ; [L43] msg_t send2 ; [L44] _Bool mode2 ; [L45] _Bool alive2 ; [L46] port_t p3 ; [L47] char p3_old ; [L48] char p3_new ; [L49] char id3 ; [L50] char st3 ; [L51] msg_t send3 ; [L52] _Bool mode3 ; [L53] _Bool alive3 ; [L256] int c1 ; [L257] int i2 ; [L260] c1 = 0 [L261] r1 = __VERIFIER_nondet_uchar() [L262] id1 = __VERIFIER_nondet_char() [L263] st1 = __VERIFIER_nondet_char() [L264] send1 = __VERIFIER_nondet_char() [L265] mode1 = __VERIFIER_nondet_bool() [L266] alive1 = __VERIFIER_nondet_bool() [L267] id2 = __VERIFIER_nondet_char() [L268] st2 = __VERIFIER_nondet_char() [L269] send2 = __VERIFIER_nondet_char() [L270] mode2 = __VERIFIER_nondet_bool() [L271] alive2 = __VERIFIER_nondet_bool() [L272] id3 = __VERIFIER_nondet_char() [L273] st3 = __VERIFIER_nondet_char() [L274] send3 = __VERIFIER_nondet_char() [L275] mode3 = __VERIFIER_nondet_bool() [L276] alive3 = __VERIFIER_nondet_bool() [L277] CALL, EXPR init() [L159] int tmp ; VAL [id1=0, id2=3, id3=4, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L162] COND TRUE (int )r1 == 0 VAL [id1=0, id2=3, id3=4, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L163] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L164] COND TRUE (int )id1 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L165] COND TRUE (int )st1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L166] COND TRUE (int )send1 == (int )id1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L167] COND TRUE (int )mode1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L168] COND TRUE (int )id2 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L169] COND TRUE (int )st2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L170] COND TRUE (int )send2 == (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L171] COND TRUE (int )mode2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L172] COND TRUE (int )id3 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L173] COND TRUE (int )st3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L174] COND TRUE (int )send3 == (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L175] COND TRUE (int )mode3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L176] COND TRUE (int )id1 != (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L177] COND TRUE (int )id1 != (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L178] COND TRUE (int )id2 != (int )id3 [L179] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0, tmp=1] [L231] return (tmp); [L277] RET, EXPR init() [L277] i2 = init() [L278] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, alive1=0, alive2=0, alive3=1, cond=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L278] RET assume_abort_if_not(i2) [L279] p1_old = nomsg [L280] p1_new = nomsg [L281] p2_old = nomsg [L282] p2_new = nomsg [L283] p3_old = nomsg [L284] p3_new = nomsg [L285] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, c1=0, i2=0, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L60] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L81] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L95] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L112] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L115] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L118] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L129] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L146] COND TRUE \read(alive3) [L147] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L152] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=3, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L60] COND TRUE \read(mode1) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L61] COND FALSE !(r1 == 255) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=0, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L67] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=3, send3=4, st1=0, st2=0, st3=0] [L68] COND FALSE !(\read(alive1)) [L76] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L79] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L95] COND TRUE \read(mode2) [L96] m2 = p1_old [L97] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L98] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L110] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L129] COND TRUE \read(mode3) [L130] m3 = p2_old [L131] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L132] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L144] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L60] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L81] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L95] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L112] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L115] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L118] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L129] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L146] COND TRUE \read(alive3) [L147] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L152] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=3, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L60] COND TRUE \read(mode1) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L61] COND FALSE !(r1 == 255) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=1, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L67] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L68] COND FALSE !(\read(alive1)) [L76] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L79] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L95] COND TRUE \read(mode2) [L96] m2 = p1_old [L97] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L98] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L110] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L129] COND TRUE \read(mode3) [L130] m3 = p2_old [L131] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L132] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L144] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L60] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L81] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L95] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L112] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L115] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L118] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L129] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L146] COND TRUE \read(alive3) [L147] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L152] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=3, id3=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L60] COND TRUE \read(mode1) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L61] COND FALSE !(r1 == 255) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=4, r1=2, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L67] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L68] COND FALSE !(\read(alive1)) [L76] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L79] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m1=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L95] COND TRUE \read(mode2) [L96] m2 = p1_old [L97] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L98] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L110] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m2=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L129] COND TRUE \read(mode3) [L130] m3 = p2_old [L131] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L132] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L144] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, m3=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L240] COND FALSE !((int )r1 < 3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L243] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L246] tmp = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0, tmp=0] [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND TRUE ! arg VAL [\old(arg)=0, alive1=0, alive2=0, alive3=1, arg=0, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] [L311] reach_error() VAL [\old(arg)=0, alive1=0, alive2=0, alive3=1, arg=0, id1=0, id2=3, id3=4, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=3, send3=4, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 688.4s, OverallIterations: 36, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 583.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66329 SdHoareTripleChecker+Valid, 40.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66329 mSDsluCounter, 56910 SdHoareTripleChecker+Invalid, 35.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52537 mSDsCounter, 3007 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47948 IncrementalHoareTripleChecker+Invalid, 50955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3007 mSolverCounterUnsat, 4373 mSDtfsCounter, 47948 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6117 GetRequests, 2873 SyntacticMatches, 11 SemanticMatches, 3233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606904 ImplicationChecksByTransitivity, 491.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36084occurred in iteration=33, InterpolantAutomatonStates: 2766, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 288143 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 59.2s InterpolantComputationTime, 4435 NumberOfCodeBlocks, 4435 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 5805 ConstructedInterpolants, 0 QuantifiedInterpolants, 109571 SizeOfPredicates, 119 NumberOfNonLiveVariables, 5541 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 67 InterpolantComputations, 19 PerfectInterpolantSequences, 2205/4132 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-20 01:12:37,614 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...