/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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-18 23:02:15,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-18 23:02:15,504 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-18 23:02:15,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-18 23:02:15,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-18 23:02:15,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-18 23:02:15,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-18 23:02:15,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-18 23:02:15,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-18 23:02:15,539 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-18 23:02:15,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-18 23:02:15,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-18 23:02:15,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-18 23:02:15,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-18 23:02:15,541 INFO L153 SettingsManager]: * Use SBE=true [2023-12-18 23:02:15,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-18 23:02:15,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-18 23:02:15,542 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-18 23:02:15,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-18 23:02:15,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-18 23:02:15,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-18 23:02:15,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-18 23:02:15,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-18 23:02:15,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-18 23:02:15,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-18 23:02:15,543 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-18 23:02:15,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-18 23:02:15,543 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-18 23:02:15,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-18 23:02:15,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-18 23:02:15,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-18 23:02:15,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-18 23:02:15,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 23:02:15,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-18 23:02:15,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-18 23:02:15,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-18 23:02:15,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-18 23:02:15,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-18 23:02:15,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-18 23:02:15,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-18 23:02:15,546 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-18 23:02:15,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-18 23:02:15,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-18 23:02:15,546 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-18 23:02:15,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-18 23:02:15,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-18 23:02:15,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-18 23:02:15,718 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-18 23:02:15,719 INFO L274 PluginConnector]: CDTParser initialized [2023-12-18 23:02:15,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c [2023-12-18 23:02:16,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-18 23:02:17,134 INFO L384 CDTParser]: Found 1 translation units. [2023-12-18 23:02:17,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c [2023-12-18 23:02:17,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2c88b9e/0e53323af23c437591b6ed255f73dcb8/FLAGfe7788668 [2023-12-18 23:02:17,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2c88b9e/0e53323af23c437591b6ed255f73dcb8 [2023-12-18 23:02:17,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-18 23:02:17,179 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-18 23:02:17,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-18 23:02:17,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-18 23:02:17,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-18 23:02:17,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:02:17" (1/1) ... [2023-12-18 23:02:17,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23960166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:17, skipping insertion in model container [2023-12-18 23:02:17,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:02:17" (1/1) ... [2023-12-18 23:02:17,294 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-18 23:02:17,589 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c[6391,6404] [2023-12-18 23:02:17,637 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c[13681,13694] [2023-12-18 23:02:18,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 23:02:18,134 INFO L202 MainTranslator]: Completed pre-run [2023-12-18 23:02:18,153 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c[6391,6404] [2023-12-18 23:02:18,163 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c[13681,13694] [2023-12-18 23:02:18,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 23:02:18,483 INFO L206 MainTranslator]: Completed translation [2023-12-18 23:02:18,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18 WrapperNode [2023-12-18 23:02:18,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-18 23:02:18,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-18 23:02:18,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-18 23:02:18,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-18 23:02:18,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (1/1) ... [2023-12-18 23:02:18,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (1/1) ... [2023-12-18 23:02:18,759 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4981 [2023-12-18 23:02:18,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-18 23:02:18,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-18 23:02:18,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-18 23:02:18,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-18 23:02:18,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (1/1) ... [2023-12-18 23:02:18,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (1/1) ... [2023-12-18 23:02:18,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (1/1) ... [2023-12-18 23:02:18,954 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-18 23:02:18,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (1/1) ... [2023-12-18 23:02:18,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (1/1) ... [2023-12-18 23:02:19,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (1/1) ... [2023-12-18 23:02:19,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (1/1) ... [2023-12-18 23:02:19,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (1/1) ... [2023-12-18 23:02:19,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (1/1) ... [2023-12-18 23:02:19,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-18 23:02:19,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-18 23:02:19,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-18 23:02:19,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-18 23:02:19,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (1/1) ... [2023-12-18 23:02:19,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 23:02:19,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:02:19,187 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-18 23:02:19,221 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-18 23:02:19,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-18 23:02:19,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-18 23:02:19,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-18 23:02:19,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-18 23:02:19,308 INFO L241 CfgBuilder]: Building ICFG [2023-12-18 23:02:19,310 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-18 23:02:22,206 INFO L282 CfgBuilder]: Performing block encoding [2023-12-18 23:02:22,239 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-18 23:02:22,239 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-18 23:02:22,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:02:22 BoogieIcfgContainer [2023-12-18 23:02:22,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-18 23:02:22,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-18 23:02:22,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-18 23:02:22,243 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-18 23:02:22,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:02:17" (1/3) ... [2023-12-18 23:02:22,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f10b342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:02:22, skipping insertion in model container [2023-12-18 23:02:22,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:02:18" (2/3) ... [2023-12-18 23:02:22,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f10b342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:02:22, skipping insertion in model container [2023-12-18 23:02:22,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:02:22" (3/3) ... [2023-12-18 23:02:22,244 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c [2023-12-18 23:02:22,255 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-18 23:02:22,256 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-18 23:02:22,292 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-18 23:02:22,296 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;@15ca693c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-18 23:02:22,296 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-18 23:02:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 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-18 23:02:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-18 23:02:22,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:22,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:02:22,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:22,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1100216757, now seen corresponding path program 1 times [2023-12-18 23:02:22,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:22,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667197332] [2023-12-18 23:02:22,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:22,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:22,423 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-18 23:02:22,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:22,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667197332] [2023-12-18 23:02:22,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667197332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:22,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:22,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-18 23:02:22,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171655273] [2023-12-18 23:02:22,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:22,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-18 23:02:22,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:22,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-18 23:02:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-18 23:02:22,447 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-18 23:02:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:22,516 INFO L93 Difference]: Finished difference Result 1594 states and 3146 transitions. [2023-12-18 23:02:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-18 23:02:22,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2023-12-18 23:02:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:22,558 INFO L225 Difference]: With dead ends: 1594 [2023-12-18 23:02:22,558 INFO L226 Difference]: Without dead ends: 803 [2023-12-18 23:02:22,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-18 23:02:22,564 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:22,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1521 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:22,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2023-12-18 23:02:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2023-12-18 23:02:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.898876404494382) internal successors, (1521), 802 states have internal predecessors, (1521), 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-18 23:02:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2023-12-18 23:02:22,635 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2023-12-18 23:02:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:22,635 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2023-12-18 23:02:22,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-18 23:02:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2023-12-18 23:02:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-18 23:02:22,636 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:22,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:02:22,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-18 23:02:22,636 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:22,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:22,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1687022771, now seen corresponding path program 1 times [2023-12-18 23:02:22,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:22,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038286413] [2023-12-18 23:02:22,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:22,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:22,719 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-18 23:02:22,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:22,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038286413] [2023-12-18 23:02:22,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038286413] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:22,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:22,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-18 23:02:22,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560482746] [2023-12-18 23:02:22,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:22,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 23:02:22,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:22,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 23:02:22,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-18 23:02:22,722 INFO L87 Difference]: Start difference. First operand 803 states and 1521 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-18 23:02:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:22,774 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2023-12-18 23:02:22,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 23:02:22,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-12-18 23:02:22,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:22,777 INFO L225 Difference]: With dead ends: 864 [2023-12-18 23:02:22,777 INFO L226 Difference]: Without dead ends: 832 [2023-12-18 23:02:22,777 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-18 23:02:22,778 INFO L413 NwaCegarLoop]: 1516 mSDtfsCounter, 45 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:22,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4527 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-12-18 23:02:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2023-12-18 23:02:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.8789013732833957) internal successors, (1505), 802 states have internal predecessors, (1505), 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-18 23:02:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2023-12-18 23:02:22,791 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2023-12-18 23:02:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:22,791 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2023-12-18 23:02:22,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-18 23:02:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2023-12-18 23:02:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-18 23:02:22,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:22,792 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] [2023-12-18 23:02:22,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-18 23:02:22,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:22,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 613121839, now seen corresponding path program 1 times [2023-12-18 23:02:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:22,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760098546] [2023-12-18 23:02:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:22,885 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-18 23:02:22,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:22,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760098546] [2023-12-18 23:02:22,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760098546] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:22,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:22,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 23:02:22,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927870792] [2023-12-18 23:02:22,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:22,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 23:02:22,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:22,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 23:02:22,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-18 23:02:22,887 INFO L87 Difference]: Start difference. First operand 803 states and 1505 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-18 23:02:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:23,033 INFO L93 Difference]: Finished difference Result 977 states and 1781 transitions. [2023-12-18 23:02:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-18 23:02:23,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2023-12-18 23:02:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:23,039 INFO L225 Difference]: With dead ends: 977 [2023-12-18 23:02:23,039 INFO L226 Difference]: Without dead ends: 948 [2023-12-18 23:02:23,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-18 23:02:23,044 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 4578 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:23,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 1841 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 23:02:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2023-12-18 23:02:23,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 830. [2023-12-18 23:02:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8695652173913044) internal successors, (1548), 829 states have internal predecessors, (1548), 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-18 23:02:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1548 transitions. [2023-12-18 23:02:23,062 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1548 transitions. Word has length 32 [2023-12-18 23:02:23,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:23,063 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1548 transitions. [2023-12-18 23:02:23,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-18 23:02:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1548 transitions. [2023-12-18 23:02:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-18 23:02:23,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:23,064 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] [2023-12-18 23:02:23,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-18 23:02:23,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:23,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash 675954815, now seen corresponding path program 1 times [2023-12-18 23:02:23,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:23,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152086793] [2023-12-18 23:02:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:23,141 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-18 23:02:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152086793] [2023-12-18 23:02:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152086793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:23,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:23,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 23:02:23,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875018722] [2023-12-18 23:02:23,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:23,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 23:02:23,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:23,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 23:02:23,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 23:02:23,143 INFO L87 Difference]: Start difference. First operand 830 states and 1548 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-18 23:02:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:23,164 INFO L93 Difference]: Finished difference Result 931 states and 1707 transitions. [2023-12-18 23:02:23,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 23:02:23,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2023-12-18 23:02:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:23,183 INFO L225 Difference]: With dead ends: 931 [2023-12-18 23:02:23,183 INFO L226 Difference]: Without dead ends: 875 [2023-12-18 23:02:23,183 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-18 23:02:23,184 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 1464 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:23,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1540 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2023-12-18 23:02:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2023-12-18 23:02:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8530424799081515) internal successors, (1614), 872 states have internal predecessors, (1614), 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-18 23:02:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1614 transitions. [2023-12-18 23:02:23,195 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1614 transitions. Word has length 34 [2023-12-18 23:02:23,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:23,196 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1614 transitions. [2023-12-18 23:02:23,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-18 23:02:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1614 transitions. [2023-12-18 23:02:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-18 23:02:23,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:23,202 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] [2023-12-18 23:02:23,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-18 23:02:23,202 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:23,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash 678099767, now seen corresponding path program 1 times [2023-12-18 23:02:23,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:23,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018174616] [2023-12-18 23:02:23,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:23,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:02:23,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:23,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018174616] [2023-12-18 23:02:23,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018174616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:23,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:23,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 23:02:23,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941788842] [2023-12-18 23:02:23,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:23,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 23:02:23,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:23,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 23:02:23,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-18 23:02:23,340 INFO L87 Difference]: Start difference. First operand 873 states and 1614 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-18 23:02:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:23,397 INFO L93 Difference]: Finished difference Result 974 states and 1770 transitions. [2023-12-18 23:02:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-18 23:02:23,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2023-12-18 23:02:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:23,400 INFO L225 Difference]: With dead ends: 974 [2023-12-18 23:02:23,400 INFO L226 Difference]: Without dead ends: 875 [2023-12-18 23:02:23,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-18 23:02:23,401 INFO L413 NwaCegarLoop]: 1497 mSDtfsCounter, 4411 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4411 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:23,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4411 Valid, 1579 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2023-12-18 23:02:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2023-12-18 23:02:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8507462686567164) internal successors, (1612), 872 states have internal predecessors, (1612), 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-18 23:02:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1612 transitions. [2023-12-18 23:02:23,413 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1612 transitions. Word has length 34 [2023-12-18 23:02:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:23,414 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1612 transitions. [2023-12-18 23:02:23,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-18 23:02:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1612 transitions. [2023-12-18 23:02:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-18 23:02:23,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:23,415 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] [2023-12-18 23:02:23,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-18 23:02:23,415 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:23,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash -582127364, now seen corresponding path program 1 times [2023-12-18 23:02:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072964218] [2023-12-18 23:02:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:23,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:23,499 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-18 23:02:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:23,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072964218] [2023-12-18 23:02:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072964218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:23,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-18 23:02:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573977757] [2023-12-18 23:02:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:23,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 23:02:23,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:23,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 23:02:23,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-18 23:02:23,501 INFO L87 Difference]: Start difference. First operand 873 states and 1612 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-18 23:02:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:23,529 INFO L93 Difference]: Finished difference Result 881 states and 1621 transitions. [2023-12-18 23:02:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 23:02:23,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2023-12-18 23:02:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:23,532 INFO L225 Difference]: With dead ends: 881 [2023-12-18 23:02:23,532 INFO L226 Difference]: Without dead ends: 879 [2023-12-18 23:02:23,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-18 23:02:23,533 INFO L413 NwaCegarLoop]: 1501 mSDtfsCounter, 1 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:23,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4495 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2023-12-18 23:02:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2023-12-18 23:02:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 875 states have (on average 1.8457142857142856) internal successors, (1615), 876 states have internal predecessors, (1615), 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-18 23:02:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1615 transitions. [2023-12-18 23:02:23,545 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1615 transitions. Word has length 35 [2023-12-18 23:02:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:23,545 INFO L495 AbstractCegarLoop]: Abstraction has 877 states and 1615 transitions. [2023-12-18 23:02:23,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-18 23:02:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1615 transitions. [2023-12-18 23:02:23,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-18 23:02:23,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:23,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:02:23,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-18 23:02:23,546 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:23,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2127458807, now seen corresponding path program 1 times [2023-12-18 23:02:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:23,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377794673] [2023-12-18 23:02:23,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:23,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:23,571 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-18 23:02:23,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:23,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377794673] [2023-12-18 23:02:23,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377794673] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:23,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:23,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 23:02:23,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892137875] [2023-12-18 23:02:23,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:23,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 23:02:23,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:23,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 23:02:23,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 23:02:23,572 INFO L87 Difference]: Start difference. First operand 877 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-18 23:02:23,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:23,592 INFO L93 Difference]: Finished difference Result 991 states and 1788 transitions. [2023-12-18 23:02:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 23:02:23,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2023-12-18 23:02:23,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:23,595 INFO L225 Difference]: With dead ends: 991 [2023-12-18 23:02:23,595 INFO L226 Difference]: Without dead ends: 931 [2023-12-18 23:02:23,595 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-18 23:02:23,596 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 1474 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1578 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-18 23:02:23,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2023-12-18 23:02:23,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2023-12-18 23:02:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 927 states have (on average 1.825242718446602) internal successors, (1692), 928 states have internal predecessors, (1692), 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-18 23:02:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1692 transitions. [2023-12-18 23:02:23,609 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1692 transitions. Word has length 36 [2023-12-18 23:02:23,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:23,609 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1692 transitions. [2023-12-18 23:02:23,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-18 23:02:23,609 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1692 transitions. [2023-12-18 23:02:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-18 23:02:23,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:23,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:02:23,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-18 23:02:23,610 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:23,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1501802743, now seen corresponding path program 1 times [2023-12-18 23:02:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062840217] [2023-12-18 23:02:23,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:23,633 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-18 23:02:23,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062840217] [2023-12-18 23:02:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062840217] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:23,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:23,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 23:02:23,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008751906] [2023-12-18 23:02:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:23,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 23:02:23,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:23,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 23:02:23,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 23:02:23,635 INFO L87 Difference]: Start difference. First operand 929 states and 1692 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-18 23:02:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:23,655 INFO L93 Difference]: Finished difference Result 1211 states and 2112 transitions. [2023-12-18 23:02:23,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 23:02:23,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2023-12-18 23:02:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:23,659 INFO L225 Difference]: With dead ends: 1211 [2023-12-18 23:02:23,659 INFO L226 Difference]: Without dead ends: 1058 [2023-12-18 23:02:23,659 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-18 23:02:23,660 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 1472 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1584 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-18 23:02:23,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:23,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2023-12-18 23:02:23,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1056. [2023-12-18 23:02:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1054 states have (on average 1.777988614800759) internal successors, (1874), 1055 states have internal predecessors, (1874), 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-18 23:02:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1874 transitions. [2023-12-18 23:02:23,674 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1874 transitions. Word has length 36 [2023-12-18 23:02:23,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:23,674 INFO L495 AbstractCegarLoop]: Abstraction has 1056 states and 1874 transitions. [2023-12-18 23:02:23,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-18 23:02:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1874 transitions. [2023-12-18 23:02:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-18 23:02:23,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:23,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:02:23,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-18 23:02:23,675 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:23,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1904431113, now seen corresponding path program 1 times [2023-12-18 23:02:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:23,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720057097] [2023-12-18 23:02:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:23,698 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-18 23:02:23,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:23,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720057097] [2023-12-18 23:02:23,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720057097] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:23,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:23,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 23:02:23,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320453622] [2023-12-18 23:02:23,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:23,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 23:02:23,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:23,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 23:02:23,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 23:02:23,700 INFO L87 Difference]: Start difference. First operand 1056 states and 1874 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-18 23:02:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:23,722 INFO L93 Difference]: Finished difference Result 1568 states and 2616 transitions. [2023-12-18 23:02:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 23:02:23,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2023-12-18 23:02:23,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:23,726 INFO L225 Difference]: With dead ends: 1568 [2023-12-18 23:02:23,726 INFO L226 Difference]: Without dead ends: 1288 [2023-12-18 23:02:23,727 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-18 23:02:23,727 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 1470 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1586 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-18 23:02:23,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1586 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2023-12-18 23:02:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1286. [2023-12-18 23:02:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1284 states have (on average 1.705607476635514) internal successors, (2190), 1285 states have internal predecessors, (2190), 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-18 23:02:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2190 transitions. [2023-12-18 23:02:23,745 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2190 transitions. Word has length 36 [2023-12-18 23:02:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:23,745 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 2190 transitions. [2023-12-18 23:02:23,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-18 23:02:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2190 transitions. [2023-12-18 23:02:23,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-18 23:02:23,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:23,746 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:02:23,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-18 23:02:23,746 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:23,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:23,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1853448570, now seen corresponding path program 1 times [2023-12-18 23:02:23,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:23,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094184099] [2023-12-18 23:02:23,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:23,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:23,804 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-18 23:02:23,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:23,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094184099] [2023-12-18 23:02:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094184099] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:23,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:23,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 23:02:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110529696] [2023-12-18 23:02:23,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:23,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 23:02:23,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 23:02:23,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-18 23:02:23,805 INFO L87 Difference]: Start difference. First operand 1286 states and 2190 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-18 23:02:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:23,954 INFO L93 Difference]: Finished difference Result 2794 states and 4342 transitions. [2023-12-18 23:02:23,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-18 23:02:23,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 50 [2023-12-18 23:02:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:23,962 INFO L225 Difference]: With dead ends: 2794 [2023-12-18 23:02:23,962 INFO L226 Difference]: Without dead ends: 2424 [2023-12-18 23:02:23,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-18 23:02:23,964 INFO L413 NwaCegarLoop]: 1540 mSDtfsCounter, 3031 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3031 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:23,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3031 Valid, 3153 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:23,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2023-12-18 23:02:24,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1726. [2023-12-18 23:02:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.6299303944315546) internal successors, (2810), 1725 states have internal predecessors, (2810), 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-18 23:02:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2810 transitions. [2023-12-18 23:02:24,011 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2810 transitions. Word has length 50 [2023-12-18 23:02:24,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:24,012 INFO L495 AbstractCegarLoop]: Abstraction has 1726 states and 2810 transitions. [2023-12-18 23:02:24,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-18 23:02:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2810 transitions. [2023-12-18 23:02:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-18 23:02:24,013 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:24,013 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:02:24,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-18 23:02:24,013 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:24,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1815862662, now seen corresponding path program 1 times [2023-12-18 23:02:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:24,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168136185] [2023-12-18 23:02:24,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:24,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-18 23:02:24,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168136185] [2023-12-18 23:02:24,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168136185] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:24,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:24,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 23:02:24,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423068479] [2023-12-18 23:02:24,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:24,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 23:02:24,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:24,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 23:02:24,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-18 23:02:24,130 INFO L87 Difference]: Start difference. First operand 1726 states and 2810 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-18 23:02:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:24,224 INFO L93 Difference]: Finished difference Result 3302 states and 5062 transitions. [2023-12-18 23:02:24,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-18 23:02:24,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 50 [2023-12-18 23:02:24,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:24,233 INFO L225 Difference]: With dead ends: 3302 [2023-12-18 23:02:24,233 INFO L226 Difference]: Without dead ends: 2792 [2023-12-18 23:02:24,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-18 23:02:24,236 INFO L413 NwaCegarLoop]: 1539 mSDtfsCounter, 3035 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3035 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:24,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3035 Valid, 3130 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2023-12-18 23:02:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2418. [2023-12-18 23:02:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5653973509933774) internal successors, (3782), 2417 states have internal predecessors, (3782), 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-18 23:02:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3782 transitions. [2023-12-18 23:02:24,291 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3782 transitions. Word has length 50 [2023-12-18 23:02:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:24,292 INFO L495 AbstractCegarLoop]: Abstraction has 2418 states and 3782 transitions. [2023-12-18 23:02:24,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-18 23:02:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3782 transitions. [2023-12-18 23:02:24,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-18 23:02:24,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:24,293 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:02:24,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-18 23:02:24,294 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:24,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:24,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1590371194, now seen corresponding path program 1 times [2023-12-18 23:02:24,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:24,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434375148] [2023-12-18 23:02:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:24,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-18 23:02:24,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:24,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434375148] [2023-12-18 23:02:24,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434375148] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:24,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:24,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 23:02:24,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313497626] [2023-12-18 23:02:24,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:24,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 23:02:24,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:24,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 23:02:24,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-18 23:02:24,372 INFO L87 Difference]: Start difference. First operand 2418 states and 3782 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-18 23:02:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:24,471 INFO L93 Difference]: Finished difference Result 3810 states and 5778 transitions. [2023-12-18 23:02:24,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-18 23:02:24,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 50 [2023-12-18 23:02:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:24,479 INFO L225 Difference]: With dead ends: 3810 [2023-12-18 23:02:24,479 INFO L226 Difference]: Without dead ends: 3300 [2023-12-18 23:02:24,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-18 23:02:24,481 INFO L413 NwaCegarLoop]: 1538 mSDtfsCounter, 3041 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:24,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3134 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2023-12-18 23:02:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2926. [2023-12-18 23:02:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2924 states have (on average 1.5383036935704515) internal successors, (4498), 2925 states have internal predecessors, (4498), 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-18 23:02:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4498 transitions. [2023-12-18 23:02:24,552 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4498 transitions. Word has length 50 [2023-12-18 23:02:24,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:24,553 INFO L495 AbstractCegarLoop]: Abstraction has 2926 states and 4498 transitions. [2023-12-18 23:02:24,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-18 23:02:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4498 transitions. [2023-12-18 23:02:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-18 23:02:24,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:24,554 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] [2023-12-18 23:02:24,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-18 23:02:24,554 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:24,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1183432324, now seen corresponding path program 1 times [2023-12-18 23:02:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:24,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215734974] [2023-12-18 23:02:24,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:24,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:24,608 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-18 23:02:24,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:24,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215734974] [2023-12-18 23:02:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215734974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:24,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:24,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 23:02:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801215282] [2023-12-18 23:02:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:24,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 23:02:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:24,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 23:02:24,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 23:02:24,610 INFO L87 Difference]: Start difference. First operand 2926 states and 4498 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-18 23:02:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:24,658 INFO L93 Difference]: Finished difference Result 5078 states and 7536 transitions. [2023-12-18 23:02:24,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 23:02:24,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2023-12-18 23:02:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:24,665 INFO L225 Difference]: With dead ends: 5078 [2023-12-18 23:02:24,665 INFO L226 Difference]: Without dead ends: 2928 [2023-12-18 23:02:24,668 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-18 23:02:24,669 INFO L413 NwaCegarLoop]: 1520 mSDtfsCounter, 29 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3011 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-18 23:02:24,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3011 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2023-12-18 23:02:24,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2926. [2023-12-18 23:02:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2924 states have (on average 1.5212038303693571) internal successors, (4448), 2925 states have internal predecessors, (4448), 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-18 23:02:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4448 transitions. [2023-12-18 23:02:24,724 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4448 transitions. Word has length 51 [2023-12-18 23:02:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:24,724 INFO L495 AbstractCegarLoop]: Abstraction has 2926 states and 4448 transitions. [2023-12-18 23:02:24,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-18 23:02:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4448 transitions. [2023-12-18 23:02:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-18 23:02:24,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:24,725 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] [2023-12-18 23:02:24,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-18 23:02:24,725 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:24,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:24,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1165828046, now seen corresponding path program 1 times [2023-12-18 23:02:24,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:24,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616947309] [2023-12-18 23:02:24,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:24,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:24,786 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-18 23:02:24,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:24,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616947309] [2023-12-18 23:02:24,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616947309] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:24,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:24,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 23:02:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801425184] [2023-12-18 23:02:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:24,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 23:02:24,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:24,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 23:02:24,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 23:02:24,787 INFO L87 Difference]: Start difference. First operand 2926 states and 4448 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-18 23:02:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:24,819 INFO L93 Difference]: Finished difference Result 3772 states and 5635 transitions. [2023-12-18 23:02:24,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 23:02:24,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2023-12-18 23:02:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:24,823 INFO L225 Difference]: With dead ends: 3772 [2023-12-18 23:02:24,824 INFO L226 Difference]: Without dead ends: 1622 [2023-12-18 23:02:24,825 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-18 23:02:24,826 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 23 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3008 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-18 23:02:24,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3008 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2023-12-18 23:02:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1615. [2023-12-18 23:02:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1613 states have (on average 1.6261624302541848) internal successors, (2623), 1614 states have internal predecessors, (2623), 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-18 23:02:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2623 transitions. [2023-12-18 23:02:24,895 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2623 transitions. Word has length 52 [2023-12-18 23:02:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:24,896 INFO L495 AbstractCegarLoop]: Abstraction has 1615 states and 2623 transitions. [2023-12-18 23:02:24,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-18 23:02:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2623 transitions. [2023-12-18 23:02:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-18 23:02:24,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:24,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:02:24,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-18 23:02:24,896 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:24,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2138930058, now seen corresponding path program 1 times [2023-12-18 23:02:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:24,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232291432] [2023-12-18 23:02:24,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:24,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:24,938 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-18 23:02:24,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:24,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232291432] [2023-12-18 23:02:24,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232291432] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:02:24,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:02:24,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 23:02:24,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629243558] [2023-12-18 23:02:24,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:02:24,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 23:02:24,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:24,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 23:02:24,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 23:02:24,939 INFO L87 Difference]: Start difference. First operand 1615 states and 2623 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-18 23:02:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:24,965 INFO L93 Difference]: Finished difference Result 2033 states and 3201 transitions. [2023-12-18 23:02:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 23:02:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2023-12-18 23:02:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:24,969 INFO L225 Difference]: With dead ends: 2033 [2023-12-18 23:02:24,969 INFO L226 Difference]: Without dead ends: 1203 [2023-12-18 23:02:24,970 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-18 23:02:24,970 INFO L413 NwaCegarLoop]: 1512 mSDtfsCounter, 25 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2987 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-18 23:02:24,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2987 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 23:02:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2023-12-18 23:02:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1201. [2023-12-18 23:02:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1199 states have (on average 1.6997497914929107) internal successors, (2038), 1200 states have internal predecessors, (2038), 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-18 23:02:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2038 transitions. [2023-12-18 23:02:24,988 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2038 transitions. Word has length 53 [2023-12-18 23:02:24,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:24,988 INFO L495 AbstractCegarLoop]: Abstraction has 1201 states and 2038 transitions. [2023-12-18 23:02:24,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-18 23:02:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2038 transitions. [2023-12-18 23:02:24,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-18 23:02:24,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:24,989 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] [2023-12-18 23:02:24,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-18 23:02:24,989 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:24,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:24,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1489407768, now seen corresponding path program 1 times [2023-12-18 23:02:24,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:24,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674499554] [2023-12-18 23:02:24,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:24,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:02:26,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:26,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674499554] [2023-12-18 23:02:26,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674499554] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:02:26,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399609737] [2023-12-18 23:02:26,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:26,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:02:26,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:02:26,016 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-18 23:02:26,068 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-18 23:02:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:26,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-18 23:02:26,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:02:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-18 23:02:26,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:02:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-18 23:02:26,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399609737] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:02:26,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:02:26,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2023-12-18 23:02:26,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004314482] [2023-12-18 23:02:26,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:02:26,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-18 23:02:26,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:26,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-18 23:02:26,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-18 23:02:26,396 INFO L87 Difference]: Start difference. First operand 1201 states and 2038 transitions. Second operand has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 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-18 23:02:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:27,795 INFO L93 Difference]: Finished difference Result 3210 states and 4685 transitions. [2023-12-18 23:02:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-18 23:02:27,796 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 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 55 [2023-12-18 23:02:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:27,801 INFO L225 Difference]: With dead ends: 3210 [2023-12-18 23:02:27,801 INFO L226 Difference]: Without dead ends: 2794 [2023-12-18 23:02:27,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=504, Invalid=2148, Unknown=0, NotChecked=0, Total=2652 [2023-12-18 23:02:27,803 INFO L413 NwaCegarLoop]: 1491 mSDtfsCounter, 17132 mSDsluCounter, 6163 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17132 SdHoareTripleChecker+Valid, 7654 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:27,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17132 Valid, 7654 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-18 23:02:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2023-12-18 23:02:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2612. [2023-12-18 23:02:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2610 states have (on average 1.4624521072796934) internal successors, (3817), 2611 states have internal predecessors, (3817), 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-18 23:02:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 3817 transitions. [2023-12-18 23:02:27,853 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 3817 transitions. Word has length 55 [2023-12-18 23:02:27,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:27,853 INFO L495 AbstractCegarLoop]: Abstraction has 2612 states and 3817 transitions. [2023-12-18 23:02:27,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 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-18 23:02:27,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3817 transitions. [2023-12-18 23:02:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-18 23:02:27,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:27,854 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] [2023-12-18 23:02:27,862 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-18 23:02:28,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-18 23:02:28,060 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:28,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:28,060 INFO L85 PathProgramCache]: Analyzing trace with hash -294784256, now seen corresponding path program 1 times [2023-12-18 23:02:28,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:28,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634725036] [2023-12-18 23:02:28,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:28,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:02:28,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:28,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634725036] [2023-12-18 23:02:28,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634725036] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:02:28,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107787293] [2023-12-18 23:02:28,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:28,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:02:28,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:02:28,324 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-18 23:02:28,354 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-18 23:02:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:28,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-18 23:02:28,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:02:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:02:28,746 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:02:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:02:29,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107787293] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:02:29,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:02:29,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 28 [2023-12-18 23:02:29,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185440598] [2023-12-18 23:02:29,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:02:29,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-18 23:02:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:29,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-18 23:02:29,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2023-12-18 23:02:29,607 INFO L87 Difference]: Start difference. First operand 2612 states and 3817 transitions. Second operand has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 28 states have internal predecessors, (144), 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-18 23:02:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:30,112 INFO L93 Difference]: Finished difference Result 4798 states and 6605 transitions. [2023-12-18 23:02:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-18 23:02:30,112 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 28 states have internal predecessors, (144), 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 56 [2023-12-18 23:02:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:30,119 INFO L225 Difference]: With dead ends: 4798 [2023-12-18 23:02:30,119 INFO L226 Difference]: Without dead ends: 3271 [2023-12-18 23:02:30,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2023-12-18 23:02:30,122 INFO L413 NwaCegarLoop]: 1485 mSDtfsCounter, 9147 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9147 SdHoareTripleChecker+Valid, 6104 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:30,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9147 Valid, 6104 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 23:02:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2023-12-18 23:02:30,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 3117. [2023-12-18 23:02:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3117 states, 3115 states have (on average 1.4314606741573033) internal successors, (4459), 3116 states have internal predecessors, (4459), 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-18 23:02:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4459 transitions. [2023-12-18 23:02:30,214 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4459 transitions. Word has length 56 [2023-12-18 23:02:30,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:30,214 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 4459 transitions. [2023-12-18 23:02:30,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 28 states have internal predecessors, (144), 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-18 23:02:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4459 transitions. [2023-12-18 23:02:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-18 23:02:30,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:30,215 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] [2023-12-18 23:02:30,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-18 23:02:30,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-18 23:02:30,420 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:30,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:30,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2030773760, now seen corresponding path program 1 times [2023-12-18 23:02:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:30,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091312490] [2023-12-18 23:02:30,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:30,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:30,632 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-18 23:02:30,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:30,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091312490] [2023-12-18 23:02:30,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091312490] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:02:30,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631733802] [2023-12-18 23:02:30,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:30,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:02:30,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:02:30,633 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-18 23:02:30,635 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-18 23:02:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:30,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-18 23:02:30,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:02:31,125 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-18 23:02:31,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:02:31,670 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-18 23:02:31,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631733802] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:02:31,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:02:31,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29 [2023-12-18 23:02:31,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852954146] [2023-12-18 23:02:31,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:02:31,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-18 23:02:31,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:31,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-18 23:02:31,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2023-12-18 23:02:31,672 INFO L87 Difference]: Start difference. First operand 3117 states and 4459 transitions. Second operand has 29 states, 29 states have (on average 4.827586206896552) internal successors, (140), 29 states have internal predecessors, (140), 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-18 23:02:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:32,451 INFO L93 Difference]: Finished difference Result 6681 states and 9005 transitions. [2023-12-18 23:02:32,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-18 23:02:32,452 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.827586206896552) internal successors, (140), 29 states have internal predecessors, (140), 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 56 [2023-12-18 23:02:32,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:32,458 INFO L225 Difference]: With dead ends: 6681 [2023-12-18 23:02:32,458 INFO L226 Difference]: Without dead ends: 4659 [2023-12-18 23:02:32,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=606, Invalid=1944, Unknown=0, NotChecked=0, Total=2550 [2023-12-18 23:02:32,461 INFO L413 NwaCegarLoop]: 1493 mSDtfsCounter, 10747 mSDsluCounter, 7745 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10747 SdHoareTripleChecker+Valid, 9238 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:32,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10747 Valid, 9238 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-18 23:02:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2023-12-18 23:02:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 3153. [2023-12-18 23:02:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3153 states, 3151 states have (on average 1.4224055855284037) internal successors, (4482), 3152 states have internal predecessors, (4482), 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-18 23:02:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 3153 states and 4482 transitions. [2023-12-18 23:02:32,524 INFO L78 Accepts]: Start accepts. Automaton has 3153 states and 4482 transitions. Word has length 56 [2023-12-18 23:02:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:32,525 INFO L495 AbstractCegarLoop]: Abstraction has 3153 states and 4482 transitions. [2023-12-18 23:02:32,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.827586206896552) internal successors, (140), 29 states have internal predecessors, (140), 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-18 23:02:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3153 states and 4482 transitions. [2023-12-18 23:02:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-18 23:02:32,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:32,525 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] [2023-12-18 23:02:32,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-18 23:02:32,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-18 23:02:32,730 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:32,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:32,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1035298560, now seen corresponding path program 1 times [2023-12-18 23:02:32,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:32,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179361551] [2023-12-18 23:02:32,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:32,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:32,930 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-18 23:02:32,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:32,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179361551] [2023-12-18 23:02:32,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179361551] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:02:32,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686885573] [2023-12-18 23:02:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:32,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:02:32,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:02:32,944 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-18 23:02:32,962 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-18 23:02:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:33,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-18 23:02:33,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:02:33,410 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-18 23:02:33,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:02:33,865 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-18 23:02:33,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686885573] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:02:33,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:02:33,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29 [2023-12-18 23:02:33,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867455249] [2023-12-18 23:02:33,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:02:33,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-18 23:02:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:33,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-18 23:02:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2023-12-18 23:02:33,867 INFO L87 Difference]: Start difference. First operand 3153 states and 4482 transitions. Second operand has 29 states, 29 states have (on average 5.241379310344827) internal successors, (152), 29 states have internal predecessors, (152), 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-18 23:02:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:02:34,442 INFO L93 Difference]: Finished difference Result 7668 states and 10192 transitions. [2023-12-18 23:02:34,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-18 23:02:34,443 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.241379310344827) internal successors, (152), 29 states have internal predecessors, (152), 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 56 [2023-12-18 23:02:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:02:34,450 INFO L225 Difference]: With dead ends: 7668 [2023-12-18 23:02:34,451 INFO L226 Difference]: Without dead ends: 5793 [2023-12-18 23:02:34,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=480, Invalid=1412, Unknown=0, NotChecked=0, Total=1892 [2023-12-18 23:02:34,454 INFO L413 NwaCegarLoop]: 1484 mSDtfsCounter, 7549 mSDsluCounter, 4658 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7549 SdHoareTripleChecker+Valid, 6142 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 23:02:34,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7549 Valid, 6142 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 23:02:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states. [2023-12-18 23:02:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5793 to 5403. [2023-12-18 23:02:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5403 states, 5401 states have (on average 1.3417885576745048) internal successors, (7247), 5402 states have internal predecessors, (7247), 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-18 23:02:34,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 7247 transitions. [2023-12-18 23:02:34,611 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 7247 transitions. Word has length 56 [2023-12-18 23:02:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:02:34,611 INFO L495 AbstractCegarLoop]: Abstraction has 5403 states and 7247 transitions. [2023-12-18 23:02:34,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.241379310344827) internal successors, (152), 29 states have internal predecessors, (152), 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-18 23:02:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 7247 transitions. [2023-12-18 23:02:34,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-18 23:02:34,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:02:34,612 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] [2023-12-18 23:02:34,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-18 23:02:34,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:02:34,817 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:02:34,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:02:34,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1142870954, now seen corresponding path program 1 times [2023-12-18 23:02:34,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:02:34,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833255436] [2023-12-18 23:02:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:34,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:02:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:35,338 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-18 23:02:35,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:02:35,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833255436] [2023-12-18 23:02:35,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833255436] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:02:35,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178099255] [2023-12-18 23:02:35,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:02:35,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:02:35,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:02:35,340 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-18 23:02:35,367 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-18 23:02:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:02:35,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-18 23:02:35,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:02:37,111 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-18 23:02:37,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:02:39,403 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-18 23:02:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178099255] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:02:39,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:02:39,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 22] total 49 [2023-12-18 23:02:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712074229] [2023-12-18 23:02:39,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:02:39,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-18 23:02:39,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:02:39,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-18 23:02:39,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1982, Unknown=0, NotChecked=0, Total=2352 [2023-12-18 23:02:39,408 INFO L87 Difference]: Start difference. First operand 5403 states and 7247 transitions. Second operand has 49 states, 49 states have (on average 3.183673469387755) internal successors, (156), 49 states have internal predecessors, (156), 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-18 23:03:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:03:05,283 INFO L93 Difference]: Finished difference Result 10701 states and 13861 transitions. [2023-12-18 23:03:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2023-12-18 23:03:05,283 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.183673469387755) internal successors, (156), 49 states have internal predecessors, (156), 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 57 [2023-12-18 23:03:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:03:05,293 INFO L225 Difference]: With dead ends: 10701 [2023-12-18 23:03:05,293 INFO L226 Difference]: Without dead ends: 6557 [2023-12-18 23:03:05,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9267 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=5230, Invalid=20530, Unknown=0, NotChecked=0, Total=25760 [2023-12-18 23:03:05,301 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 16440 mSDsluCounter, 16712 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16440 SdHoareTripleChecker+Valid, 18185 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-18 23:03:05,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16440 Valid, 18185 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-18 23:03:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2023-12-18 23:03:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 3607. [2023-12-18 23:03:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3607 states, 3605 states have (on average 1.3933425797503467) internal successors, (5023), 3606 states have internal predecessors, (5023), 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-18 23:03:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 5023 transitions. [2023-12-18 23:03:05,428 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 5023 transitions. Word has length 57 [2023-12-18 23:03:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:03:05,429 INFO L495 AbstractCegarLoop]: Abstraction has 3607 states and 5023 transitions. [2023-12-18 23:03:05,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.183673469387755) internal successors, (156), 49 states have internal predecessors, (156), 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-18 23:03:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 5023 transitions. [2023-12-18 23:03:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-18 23:03:05,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:03:05,429 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:03:05,436 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-18 23:03:05,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:03:05,634 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:03:05,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:03:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash -998773852, now seen corresponding path program 1 times [2023-12-18 23:03:05,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:03:05,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430833292] [2023-12-18 23:03:05,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:03:05,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:03:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:03:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:03:06,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:03:06,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430833292] [2023-12-18 23:03:06,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430833292] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:03:06,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613702905] [2023-12-18 23:03:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:03:06,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:03:06,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:03:06,004 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-18 23:03:06,006 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-18 23:03:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:03:06,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-18 23:03:06,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:03:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:03:06,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:03:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:03:07,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613702905] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:03:07,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:03:07,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2023-12-18 23:03:07,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347774724] [2023-12-18 23:03:07,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:03:07,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-18 23:03:07,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:03:07,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-18 23:03:07,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2023-12-18 23:03:07,429 INFO L87 Difference]: Start difference. First operand 3607 states and 5023 transitions. Second operand has 32 states, 32 states have (on average 4.5) internal successors, (144), 32 states have internal predecessors, (144), 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-18 23:03:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:03:09,269 INFO L93 Difference]: Finished difference Result 9843 states and 12953 transitions. [2023-12-18 23:03:09,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-18 23:03:09,269 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.5) internal successors, (144), 32 states have internal predecessors, (144), 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-18 23:03:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:03:09,279 INFO L225 Difference]: With dead ends: 9843 [2023-12-18 23:03:09,279 INFO L226 Difference]: Without dead ends: 8589 [2023-12-18 23:03:09,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=665, Invalid=3117, Unknown=0, NotChecked=0, Total=3782 [2023-12-18 23:03:09,282 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 12546 mSDsluCounter, 13460 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12546 SdHoareTripleChecker+Valid, 14933 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-18 23:03:09,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12546 Valid, 14933 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-18 23:03:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8589 states. [2023-12-18 23:03:09,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8589 to 3404. [2023-12-18 23:03:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3404 states, 3402 states have (on average 1.403586125808348) internal successors, (4775), 3403 states have internal predecessors, (4775), 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-18 23:03:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4775 transitions. [2023-12-18 23:03:09,407 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4775 transitions. Word has length 59 [2023-12-18 23:03:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:03:09,407 INFO L495 AbstractCegarLoop]: Abstraction has 3404 states and 4775 transitions. [2023-12-18 23:03:09,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.5) internal successors, (144), 32 states have internal predecessors, (144), 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-18 23:03:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4775 transitions. [2023-12-18 23:03:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 23:03:09,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:03:09,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:03:09,415 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-18 23:03:09,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:03:09,615 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:03:09,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:03:09,616 INFO L85 PathProgramCache]: Analyzing trace with hash -56380255, now seen corresponding path program 1 times [2023-12-18 23:03:09,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:03:09,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747078223] [2023-12-18 23:03:09,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:03:09,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:03:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:03:09,665 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-18 23:03:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:03:09,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747078223] [2023-12-18 23:03:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747078223] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 23:03:09,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 23:03:09,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-18 23:03:09,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398039149] [2023-12-18 23:03:09,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:03:09,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 23:03:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:03:09,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 23:03:09,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 23:03:09,666 INFO L87 Difference]: Start difference. First operand 3404 states and 4775 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 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-18 23:03:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:03:12,515 INFO L93 Difference]: Finished difference Result 4908 states and 7648 transitions. [2023-12-18 23:03:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 23:03:12,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 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-18 23:03:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:03:12,520 INFO L225 Difference]: With dead ends: 4908 [2023-12-18 23:03:12,520 INFO L226 Difference]: Without dead ends: 4155 [2023-12-18 23:03:12,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 23:03:12,521 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 805 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-18 23:03:12,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 538 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-18 23:03:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2023-12-18 23:03:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 4155. [2023-12-18 23:03:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4155 states, 4153 states have (on average 1.3855044546111246) internal successors, (5754), 4154 states have internal predecessors, (5754), 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-18 23:03:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 5754 transitions. [2023-12-18 23:03:12,632 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 5754 transitions. Word has length 62 [2023-12-18 23:03:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:03:12,633 INFO L495 AbstractCegarLoop]: Abstraction has 4155 states and 5754 transitions. [2023-12-18 23:03:12,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 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-18 23:03:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 5754 transitions. [2023-12-18 23:03:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-18 23:03:12,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:03:12,634 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2023-12-18 23:03:12,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-18 23:03:12,634 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:03:12,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:03:12,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1874846004, now seen corresponding path program 1 times [2023-12-18 23:03:12,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:03:12,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482445258] [2023-12-18 23:03:12,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:03:12,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:03:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:03:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:03:13,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:03:13,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482445258] [2023-12-18 23:03:13,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482445258] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:03:13,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305674900] [2023-12-18 23:03:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:03:13,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:03:13,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:03:13,362 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-18 23:03:13,364 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-18 23:03:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:03:13,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-18 23:03:13,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:03:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:03:14,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:03:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:03:16,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305674900] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:03:16,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:03:16,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 50 [2023-12-18 23:03:16,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651053547] [2023-12-18 23:03:16,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:03:16,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-18 23:03:16,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:03:16,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-18 23:03:16,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2256, Unknown=0, NotChecked=0, Total=2450 [2023-12-18 23:03:16,428 INFO L87 Difference]: Start difference. First operand 4155 states and 5754 transitions. Second operand has 50 states, 50 states have (on average 5.24) internal successors, (262), 50 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-18 23:03:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:03:42,678 INFO L93 Difference]: Finished difference Result 7733 states and 10170 transitions. [2023-12-18 23:03:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2023-12-18 23:03:42,679 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.24) internal successors, (262), 50 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 93 [2023-12-18 23:03:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:03:42,699 INFO L225 Difference]: With dead ends: 7733 [2023-12-18 23:03:42,699 INFO L226 Difference]: Without dead ends: 6675 [2023-12-18 23:03:42,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12776 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=5590, Invalid=34610, Unknown=0, NotChecked=0, Total=40200 [2023-12-18 23:03:42,711 INFO L413 NwaCegarLoop]: 1533 mSDtfsCounter, 26477 mSDsluCounter, 27975 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26477 SdHoareTripleChecker+Valid, 29508 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-18 23:03:42,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26477 Valid, 29508 Invalid, 2849 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [264 Valid, 2585 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-18 23:03:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6675 states. [2023-12-18 23:03:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6675 to 3522. [2023-12-18 23:03:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3522 states, 3520 states have (on average 1.3960227272727272) internal successors, (4914), 3521 states have internal predecessors, (4914), 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-18 23:03:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4914 transitions. [2023-12-18 23:03:42,853 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4914 transitions. Word has length 93 [2023-12-18 23:03:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:03:42,853 INFO L495 AbstractCegarLoop]: Abstraction has 3522 states and 4914 transitions. [2023-12-18 23:03:42,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.24) internal successors, (262), 50 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-18 23:03:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4914 transitions. [2023-12-18 23:03:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-18 23:03:42,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:03:42,855 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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-18 23:03:42,862 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-18 23:03:43,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:03:43,060 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:03:43,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:03:43,060 INFO L85 PathProgramCache]: Analyzing trace with hash 504831842, now seen corresponding path program 1 times [2023-12-18 23:03:43,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:03:43,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926955194] [2023-12-18 23:03:43,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:03:43,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:03:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:03:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 28 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:03:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:03:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926955194] [2023-12-18 23:03:43,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926955194] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:03:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657248663] [2023-12-18 23:03:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:03:43,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:03:43,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:03:43,528 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-18 23:03:43,529 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-18 23:03:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:03:43,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-18 23:03:43,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:03:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:03:44,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:03:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:03:47,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657248663] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:03:47,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:03:47,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 17] total 45 [2023-12-18 23:03:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602991311] [2023-12-18 23:03:47,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:03:47,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-18 23:03:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:03:47,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-18 23:03:47,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1799, Unknown=0, NotChecked=0, Total=1980 [2023-12-18 23:03:47,009 INFO L87 Difference]: Start difference. First operand 3522 states and 4914 transitions. Second operand has 45 states, 45 states have (on average 5.6) internal successors, (252), 45 states have internal predecessors, (252), 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-18 23:04:24,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:04:24,576 INFO L93 Difference]: Finished difference Result 23246 states and 29202 transitions. [2023-12-18 23:04:24,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2023-12-18 23:04:24,576 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 5.6) internal successors, (252), 45 states have internal predecessors, (252), 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 94 [2023-12-18 23:04:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:04:24,591 INFO L225 Difference]: With dead ends: 23246 [2023-12-18 23:04:24,591 INFO L226 Difference]: Without dead ends: 21447 [2023-12-18 23:04:24,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27847 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=10667, Invalid=64683, Unknown=0, NotChecked=0, Total=75350 [2023-12-18 23:04:24,597 INFO L413 NwaCegarLoop]: 1530 mSDtfsCounter, 21075 mSDsluCounter, 28299 mSDsCounter, 0 mSdLazyCounter, 2844 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21075 SdHoareTripleChecker+Valid, 29829 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 2844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-18 23:04:24,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21075 Valid, 29829 Invalid, 3050 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [206 Valid, 2844 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-18 23:04:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21447 states. [2023-12-18 23:04:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21447 to 16205. [2023-12-18 23:04:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16205 states, 16203 states have (on average 1.2562488428068876) internal successors, (20355), 16204 states have internal predecessors, (20355), 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-18 23:04:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16205 states to 16205 states and 20355 transitions. [2023-12-18 23:04:25,813 INFO L78 Accepts]: Start accepts. Automaton has 16205 states and 20355 transitions. Word has length 94 [2023-12-18 23:04:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:04:25,814 INFO L495 AbstractCegarLoop]: Abstraction has 16205 states and 20355 transitions. [2023-12-18 23:04:25,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 5.6) internal successors, (252), 45 states have internal predecessors, (252), 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-18 23:04:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 16205 states and 20355 transitions. [2023-12-18 23:04:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-18 23:04:25,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:04:25,816 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:04:25,834 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-18 23:04:26,020 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,SelfDestructingSolverStorable23 [2023-12-18 23:04:26,020 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:04:26,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:04:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash -503225792, now seen corresponding path program 1 times [2023-12-18 23:04:26,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:04:26,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211642534] [2023-12-18 23:04:26,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:04:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:04:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:04:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 19 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:04:26,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:04:26,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211642534] [2023-12-18 23:04:26,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211642534] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:04:26,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948830856] [2023-12-18 23:04:26,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:04:26,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:04:26,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:04:26,787 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-18 23:04:26,836 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-18 23:04:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:04:26,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-18 23:04:26,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:04:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-18 23:04:28,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:04:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-18 23:04:30,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948830856] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:04:30,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:04:30,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 22] total 58 [2023-12-18 23:04:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253394798] [2023-12-18 23:04:30,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:04:30,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-18 23:04:30,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:04:30,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-18 23:04:30,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3050, Unknown=0, NotChecked=0, Total=3306 [2023-12-18 23:04:30,878 INFO L87 Difference]: Start difference. First operand 16205 states and 20355 transitions. Second operand has 58 states, 58 states have (on average 4.051724137931035) internal successors, (235), 58 states have internal predecessors, (235), 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-18 23:04:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:04:44,384 INFO L93 Difference]: Finished difference Result 25528 states and 31578 transitions. [2023-12-18 23:04:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-12-18 23:04:44,384 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 4.051724137931035) internal successors, (235), 58 states have internal predecessors, (235), 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 95 [2023-12-18 23:04:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:04:44,398 INFO L225 Difference]: With dead ends: 25528 [2023-12-18 23:04:44,398 INFO L226 Difference]: Without dead ends: 20067 [2023-12-18 23:04:44,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4138 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=2505, Invalid=14525, Unknown=0, NotChecked=0, Total=17030 [2023-12-18 23:04:44,404 INFO L413 NwaCegarLoop]: 1511 mSDtfsCounter, 25785 mSDsluCounter, 32103 mSDsCounter, 0 mSdLazyCounter, 3006 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25785 SdHoareTripleChecker+Valid, 33614 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 3006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-18 23:04:44,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25785 Valid, 33614 Invalid, 3110 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 3006 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-18 23:04:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20067 states. [2023-12-18 23:04:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20067 to 18755. [2023-12-18 23:04:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18755 states, 18753 states have (on average 1.2505199168133099) internal successors, (23451), 18754 states have internal predecessors, (23451), 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-18 23:04:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18755 states to 18755 states and 23451 transitions. [2023-12-18 23:04:45,786 INFO L78 Accepts]: Start accepts. Automaton has 18755 states and 23451 transitions. Word has length 95 [2023-12-18 23:04:45,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:04:45,786 INFO L495 AbstractCegarLoop]: Abstraction has 18755 states and 23451 transitions. [2023-12-18 23:04:45,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 4.051724137931035) internal successors, (235), 58 states have internal predecessors, (235), 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-18 23:04:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 18755 states and 23451 transitions. [2023-12-18 23:04:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-18 23:04:45,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:04:45,788 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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-18 23:04:45,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-18 23:04:45,992 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,SelfDestructingSolverStorable24 [2023-12-18 23:04:45,992 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:04:45,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:04:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1429287380, now seen corresponding path program 1 times [2023-12-18 23:04:45,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:04:45,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211211792] [2023-12-18 23:04:45,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:04:45,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:04:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:04:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:04:46,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:04:46,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211211792] [2023-12-18 23:04:46,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211211792] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:04:46,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031341648] [2023-12-18 23:04:46,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:04:46,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:04:46,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:04:46,420 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-18 23:04:46,443 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-18 23:04:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:04:46,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-18 23:04:46,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:04:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 21 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:04:47,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:04:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:04:48,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031341648] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:04:48,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:04:48,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-12-18 23:04:48,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126380316] [2023-12-18 23:04:48,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:04:48,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-18 23:04:48,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:04:48,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-18 23:04:48,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2023-12-18 23:04:48,028 INFO L87 Difference]: Start difference. First operand 18755 states and 23451 transitions. Second operand has 26 states, 26 states have (on average 8.153846153846153) internal successors, (212), 25 states have internal predecessors, (212), 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-18 23:04:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:04:50,059 INFO L93 Difference]: Finished difference Result 27125 states and 33788 transitions. [2023-12-18 23:04:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-18 23:04:50,060 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.153846153846153) internal successors, (212), 25 states have internal predecessors, (212), 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 95 [2023-12-18 23:04:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:04:50,073 INFO L225 Difference]: With dead ends: 27125 [2023-12-18 23:04:50,074 INFO L226 Difference]: Without dead ends: 18985 [2023-12-18 23:04:50,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=399, Invalid=1323, Unknown=0, NotChecked=0, Total=1722 [2023-12-18 23:04:50,079 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 14872 mSDsluCounter, 9120 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14872 SdHoareTripleChecker+Valid, 10620 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 23:04:50,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14872 Valid, 10620 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 23:04:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18985 states. [2023-12-18 23:04:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18985 to 18755. [2023-12-18 23:04:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18755 states, 18753 states have (on average 1.2429477950194636) internal successors, (23309), 18754 states have internal predecessors, (23309), 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-18 23:04:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18755 states to 18755 states and 23309 transitions. [2023-12-18 23:04:51,523 INFO L78 Accepts]: Start accepts. Automaton has 18755 states and 23309 transitions. Word has length 95 [2023-12-18 23:04:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:04:51,524 INFO L495 AbstractCegarLoop]: Abstraction has 18755 states and 23309 transitions. [2023-12-18 23:04:51,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.153846153846153) internal successors, (212), 25 states have internal predecessors, (212), 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-18 23:04:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 18755 states and 23309 transitions. [2023-12-18 23:04:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-18 23:04:51,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:04:51,526 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:04:51,546 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-18 23:04:51,730 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,SelfDestructingSolverStorable25 [2023-12-18 23:04:51,731 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:04:51,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:04:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash 919827296, now seen corresponding path program 1 times [2023-12-18 23:04:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:04:51,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022852959] [2023-12-18 23:04:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:04:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:04:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:04:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 28 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:04:52,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:04:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022852959] [2023-12-18 23:04:52,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022852959] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:04:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423331109] [2023-12-18 23:04:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:04:52,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:04:52,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:04:52,251 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-18 23:04:52,254 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-18 23:04:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:04:52,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-18 23:04:52,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:04:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 44 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:04:53,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:04:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 44 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:04:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423331109] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:04:53,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:04:53,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2023-12-18 23:04:53,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092534415] [2023-12-18 23:04:53,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:04:53,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-18 23:04:53,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:04:53,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-18 23:04:53,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2023-12-18 23:04:53,969 INFO L87 Difference]: Start difference. First operand 18755 states and 23309 transitions. Second operand has 29 states, 29 states have (on average 7.862068965517241) internal successors, (228), 29 states have internal predecessors, (228), 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-18 23:04:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:04:57,728 INFO L93 Difference]: Finished difference Result 37379 states and 45925 transitions. [2023-12-18 23:04:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-18 23:04:57,729 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.862068965517241) internal successors, (228), 29 states have internal predecessors, (228), 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 95 [2023-12-18 23:04:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:04:57,746 INFO L225 Difference]: With dead ends: 37379 [2023-12-18 23:04:57,746 INFO L226 Difference]: Without dead ends: 20981 [2023-12-18 23:04:57,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=908, Invalid=3784, Unknown=0, NotChecked=0, Total=4692 [2023-12-18 23:04:57,755 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 21087 mSDsluCounter, 9290 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21087 SdHoareTripleChecker+Valid, 10808 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-18 23:04:57,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21087 Valid, 10808 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-18 23:04:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20981 states. [2023-12-18 23:04:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20981 to 11327. [2023-12-18 23:04:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11327 states, 11325 states have (on average 1.2596909492273731) internal successors, (14266), 11326 states have internal predecessors, (14266), 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-18 23:04:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11327 states to 11327 states and 14266 transitions. [2023-12-18 23:04:58,794 INFO L78 Accepts]: Start accepts. Automaton has 11327 states and 14266 transitions. Word has length 95 [2023-12-18 23:04:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:04:58,794 INFO L495 AbstractCegarLoop]: Abstraction has 11327 states and 14266 transitions. [2023-12-18 23:04:58,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.862068965517241) internal successors, (228), 29 states have internal predecessors, (228), 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-18 23:04:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 11327 states and 14266 transitions. [2023-12-18 23:04:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-18 23:04:58,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:04:58,796 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:04:58,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-18 23:04:59,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-18 23:04:59,003 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:04:59,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:04:59,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1894536766, now seen corresponding path program 1 times [2023-12-18 23:04:59,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:04:59,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103920963] [2023-12-18 23:04:59,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:04:59,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:04:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:05:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 23 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:05:00,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:05:00,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103920963] [2023-12-18 23:05:00,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103920963] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:05:00,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340302965] [2023-12-18 23:05:00,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:05:00,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:05:00,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:05:00,257 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-18 23:05:00,286 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-18 23:05:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:05:00,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-18 23:05:00,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:05:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:05:02,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:05:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:05:04,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340302965] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:05:04,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:05:04,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 19] total 63 [2023-12-18 23:05:04,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498150517] [2023-12-18 23:05:04,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:05:04,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-12-18 23:05:04,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:05:04,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-12-18 23:05:04,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3679, Unknown=0, NotChecked=0, Total=3906 [2023-12-18 23:05:04,683 INFO L87 Difference]: Start difference. First operand 11327 states and 14266 transitions. Second operand has 63 states, 63 states have (on average 4.253968253968254) internal successors, (268), 63 states have internal predecessors, (268), 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-18 23:05:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:05:38,076 INFO L93 Difference]: Finished difference Result 22488 states and 27826 transitions. [2023-12-18 23:05:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2023-12-18 23:05:38,076 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.253968253968254) internal successors, (268), 63 states have internal predecessors, (268), 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 95 [2023-12-18 23:05:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:05:38,091 INFO L225 Difference]: With dead ends: 22488 [2023-12-18 23:05:38,092 INFO L226 Difference]: Without dead ends: 17909 [2023-12-18 23:05:38,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15817 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=6514, Invalid=45242, Unknown=0, NotChecked=0, Total=51756 [2023-12-18 23:05:38,097 INFO L413 NwaCegarLoop]: 1546 mSDtfsCounter, 23886 mSDsluCounter, 39999 mSDsCounter, 0 mSdLazyCounter, 3670 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23886 SdHoareTripleChecker+Valid, 41545 SdHoareTripleChecker+Invalid, 3966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 3670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-18 23:05:38,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23886 Valid, 41545 Invalid, 3966 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [296 Valid, 3670 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-18 23:05:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17909 states. [2023-12-18 23:05:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17909 to 11627. [2023-12-18 23:05:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11627 states, 11625 states have (on average 1.2533333333333334) internal successors, (14570), 11626 states have internal predecessors, (14570), 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-18 23:05:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11627 states to 11627 states and 14570 transitions. [2023-12-18 23:05:39,254 INFO L78 Accepts]: Start accepts. Automaton has 11627 states and 14570 transitions. Word has length 95 [2023-12-18 23:05:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:05:39,254 INFO L495 AbstractCegarLoop]: Abstraction has 11627 states and 14570 transitions. [2023-12-18 23:05:39,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.253968253968254) internal successors, (268), 63 states have internal predecessors, (268), 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-18 23:05:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 11627 states and 14570 transitions. [2023-12-18 23:05:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-18 23:05:39,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:05:39,256 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:05:39,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-18 23:05:39,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-18 23:05:39,461 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:05:39,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:05:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1850802400, now seen corresponding path program 1 times [2023-12-18 23:05:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:05:39,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122831842] [2023-12-18 23:05:39,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:05:39,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:05:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:05:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 32 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:05:39,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:05:39,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122831842] [2023-12-18 23:05:39,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122831842] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:05:39,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243810753] [2023-12-18 23:05:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:05:39,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:05:39,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:05:39,948 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-18 23:05:39,957 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-18 23:05:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:05:40,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-18 23:05:40,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:05:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 42 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:05:40,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:05:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 35 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:05:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243810753] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:05:42,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:05:42,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 44 [2023-12-18 23:05:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375211585] [2023-12-18 23:05:42,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:05:42,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-18 23:05:42,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:05:42,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-18 23:05:42,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2023-12-18 23:05:42,155 INFO L87 Difference]: Start difference. First operand 11627 states and 14570 transitions. Second operand has 44 states, 44 states have (on average 5.954545454545454) internal successors, (262), 44 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-18 23:05:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:05:46,575 INFO L93 Difference]: Finished difference Result 22547 states and 27751 transitions. [2023-12-18 23:05:46,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-12-18 23:05:46,576 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 5.954545454545454) internal successors, (262), 44 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 96 [2023-12-18 23:05:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:05:46,586 INFO L225 Difference]: With dead ends: 22547 [2023-12-18 23:05:46,586 INFO L226 Difference]: Without dead ends: 13730 [2023-12-18 23:05:46,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1702, Invalid=8600, Unknown=0, NotChecked=0, Total=10302 [2023-12-18 23:05:46,591 INFO L413 NwaCegarLoop]: 1549 mSDtfsCounter, 17526 mSDsluCounter, 29315 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17526 SdHoareTripleChecker+Valid, 30864 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-18 23:05:46,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17526 Valid, 30864 Invalid, 1358 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [130 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-18 23:05:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13730 states. [2023-12-18 23:05:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13730 to 9918. [2023-12-18 23:05:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9918 states, 9916 states have (on average 1.2559499798305769) internal successors, (12454), 9917 states have internal predecessors, (12454), 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-18 23:05:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9918 states to 9918 states and 12454 transitions. [2023-12-18 23:05:47,619 INFO L78 Accepts]: Start accepts. Automaton has 9918 states and 12454 transitions. Word has length 96 [2023-12-18 23:05:47,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:05:47,619 INFO L495 AbstractCegarLoop]: Abstraction has 9918 states and 12454 transitions. [2023-12-18 23:05:47,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.954545454545454) internal successors, (262), 44 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-18 23:05:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 9918 states and 12454 transitions. [2023-12-18 23:05:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-18 23:05:47,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:05:47,620 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:05:47,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-18 23:05:47,825 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,SelfDestructingSolverStorable28 [2023-12-18 23:05:47,825 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:05:47,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:05:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash -927858116, now seen corresponding path program 1 times [2023-12-18 23:05:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:05:47,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836562945] [2023-12-18 23:05:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:05:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:05:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:05:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:05:48,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:05:48,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836562945] [2023-12-18 23:05:48,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836562945] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:05:48,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125962333] [2023-12-18 23:05:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:05:48,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:05:48,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:05:48,551 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-18 23:05:48,553 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-18 23:05:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:05:48,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-18 23:05:48,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:05:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:05:50,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:06:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:06:04,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125962333] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:06:04,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:06:04,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26, 25] total 68 [2023-12-18 23:06:04,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550241075] [2023-12-18 23:06:04,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:06:04,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-12-18 23:06:04,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:06:04,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-12-18 23:06:04,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=4172, Unknown=0, NotChecked=0, Total=4556 [2023-12-18 23:06:04,247 INFO L87 Difference]: Start difference. First operand 9918 states and 12454 transitions. Second operand has 68 states, 68 states have (on average 3.8970588235294117) internal successors, (265), 68 states have internal predecessors, (265), 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-18 23:07:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:07:05,597 INFO L93 Difference]: Finished difference Result 22249 states and 27193 transitions. [2023-12-18 23:07:05,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 326 states. [2023-12-18 23:07:05,598 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.8970588235294117) internal successors, (265), 68 states have internal predecessors, (265), 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 97 [2023-12-18 23:07:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:07:05,610 INFO L225 Difference]: With dead ends: 22249 [2023-12-18 23:07:05,610 INFO L226 Difference]: Without dead ends: 17279 [2023-12-18 23:07:05,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57002 ImplicationChecksByTransitivity, 57.9s TimeCoverageRelationStatistics Valid=17711, Invalid=132445, Unknown=0, NotChecked=0, Total=150156 [2023-12-18 23:07:05,621 INFO L413 NwaCegarLoop]: 1601 mSDtfsCounter, 40227 mSDsluCounter, 33665 mSDsCounter, 0 mSdLazyCounter, 6094 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40227 SdHoareTripleChecker+Valid, 35266 SdHoareTripleChecker+Invalid, 6297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 6094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-18 23:07:05,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40227 Valid, 35266 Invalid, 6297 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [203 Valid, 6094 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-18 23:07:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17279 states. [2023-12-18 23:07:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17279 to 13996. [2023-12-18 23:07:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13996 states, 13994 states have (on average 1.2404601972273832) internal successors, (17359), 13995 states have internal predecessors, (17359), 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-18 23:07:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13996 states to 13996 states and 17359 transitions. [2023-12-18 23:07:07,223 INFO L78 Accepts]: Start accepts. Automaton has 13996 states and 17359 transitions. Word has length 97 [2023-12-18 23:07:07,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:07:07,224 INFO L495 AbstractCegarLoop]: Abstraction has 13996 states and 17359 transitions. [2023-12-18 23:07:07,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.8970588235294117) internal successors, (265), 68 states have internal predecessors, (265), 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-18 23:07:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 13996 states and 17359 transitions. [2023-12-18 23:07:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-18 23:07:07,231 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:07:07,231 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-12-18 23:07:07,239 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-18 23:07:07,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:07:07,438 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:07:07,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:07:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash -434470554, now seen corresponding path program 1 times [2023-12-18 23:07:07,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:07:07,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14930546] [2023-12-18 23:07:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:07:07,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:07:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:07:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 19 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:07:08,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:07:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14930546] [2023-12-18 23:07:08,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14930546] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:07:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558075991] [2023-12-18 23:07:08,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:07:08,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:07:08,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:07:08,472 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-18 23:07:08,476 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-18 23:07:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:07:08,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-18 23:07:08,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:07:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 20 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:07:11,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:07:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 19 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:07:18,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558075991] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:07:18,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:07:18,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29, 30] total 78 [2023-12-18 23:07:18,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664657629] [2023-12-18 23:07:18,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:07:18,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-12-18 23:07:18,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:07:18,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-12-18 23:07:18,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=5429, Unknown=0, NotChecked=0, Total=6006 [2023-12-18 23:07:18,393 INFO L87 Difference]: Start difference. First operand 13996 states and 17359 transitions. Second operand has 78 states, 78 states have (on average 3.5384615384615383) internal successors, (276), 78 states have internal predecessors, (276), 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-18 23:09:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:09:55,936 INFO L93 Difference]: Finished difference Result 26365 states and 32188 transitions. [2023-12-18 23:09:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 331 states. [2023-12-18 23:09:55,937 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 3.5384615384615383) internal successors, (276), 78 states have internal predecessors, (276), 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 98 [2023-12-18 23:09:55,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:09:55,962 INFO L225 Difference]: With dead ends: 26365 [2023-12-18 23:09:55,962 INFO L226 Difference]: Without dead ends: 23810 [2023-12-18 23:09:55,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64852 ImplicationChecksByTransitivity, 153.4s TimeCoverageRelationStatistics Valid=22046, Invalid=139156, Unknown=0, NotChecked=0, Total=161202 [2023-12-18 23:09:55,973 INFO L413 NwaCegarLoop]: 1553 mSDtfsCounter, 33754 mSDsluCounter, 36626 mSDsCounter, 0 mSdLazyCounter, 4792 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33754 SdHoareTripleChecker+Valid, 38179 SdHoareTripleChecker+Invalid, 5440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 4792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-18 23:09:55,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33754 Valid, 38179 Invalid, 5440 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [648 Valid, 4792 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-18 23:09:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23810 states. [2023-12-18 23:09:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23810 to 15381. [2023-12-18 23:09:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15381 states, 15379 states have (on average 1.2365563430652189) internal successors, (19017), 15380 states have internal predecessors, (19017), 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-18 23:09:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15381 states to 15381 states and 19017 transitions. [2023-12-18 23:09:58,156 INFO L78 Accepts]: Start accepts. Automaton has 15381 states and 19017 transitions. Word has length 98 [2023-12-18 23:09:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:09:58,156 INFO L495 AbstractCegarLoop]: Abstraction has 15381 states and 19017 transitions. [2023-12-18 23:09:58,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.5384615384615383) internal successors, (276), 78 states have internal predecessors, (276), 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-18 23:09:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 15381 states and 19017 transitions. [2023-12-18 23:09:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-18 23:09:58,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:09:58,157 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-12-18 23:09:58,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-18 23:09:58,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:09:58,362 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:09:58,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:09:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1826687318, now seen corresponding path program 1 times [2023-12-18 23:09:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:09:58,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496215506] [2023-12-18 23:09:58,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:09:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:09:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:09:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 38 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:09:59,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:09:59,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496215506] [2023-12-18 23:09:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496215506] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:09:59,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263123756] [2023-12-18 23:09:59,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:09:59,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:09:59,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:09:59,165 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-18 23:09:59,168 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-18 23:09:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:09:59,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-18 23:09:59,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:10:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 39 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:10:01,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:10:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 38 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:10:04,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263123756] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:10:04,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:10:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 62 [2023-12-18 23:10:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161247188] [2023-12-18 23:10:04,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:10:04,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-12-18 23:10:04,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:10:04,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-12-18 23:10:04,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=3489, Unknown=0, NotChecked=0, Total=3782 [2023-12-18 23:10:04,510 INFO L87 Difference]: Start difference. First operand 15381 states and 19017 transitions. Second operand has 62 states, 62 states have (on average 4.080645161290323) internal successors, (253), 62 states have internal predecessors, (253), 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-18 23:10:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:10:17,943 INFO L93 Difference]: Finished difference Result 26680 states and 32365 transitions. [2023-12-18 23:10:17,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2023-12-18 23:10:17,944 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.080645161290323) internal successors, (253), 62 states have internal predecessors, (253), 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 98 [2023-12-18 23:10:17,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:10:17,960 INFO L225 Difference]: With dead ends: 26680 [2023-12-18 23:10:17,960 INFO L226 Difference]: Without dead ends: 22051 [2023-12-18 23:10:17,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10313 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=3769, Invalid=28811, Unknown=0, NotChecked=0, Total=32580 [2023-12-18 23:10:17,967 INFO L413 NwaCegarLoop]: 1568 mSDtfsCounter, 26129 mSDsluCounter, 27619 mSDsCounter, 0 mSdLazyCounter, 2884 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26129 SdHoareTripleChecker+Valid, 29187 SdHoareTripleChecker+Invalid, 2998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-18 23:10:17,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26129 Valid, 29187 Invalid, 2998 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [114 Valid, 2884 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-18 23:10:17,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22051 states. [2023-12-18 23:10:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22051 to 16571. [2023-12-18 23:10:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16571 states, 16569 states have (on average 1.2348361397791057) internal successors, (20460), 16570 states have internal predecessors, (20460), 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-18 23:10:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16571 states to 16571 states and 20460 transitions. [2023-12-18 23:10:20,387 INFO L78 Accepts]: Start accepts. Automaton has 16571 states and 20460 transitions. Word has length 98 [2023-12-18 23:10:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:10:20,387 INFO L495 AbstractCegarLoop]: Abstraction has 16571 states and 20460 transitions. [2023-12-18 23:10:20,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.080645161290323) internal successors, (253), 62 states have internal predecessors, (253), 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-18 23:10:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 16571 states and 20460 transitions. [2023-12-18 23:10:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-18 23:10:20,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:10:20,405 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-18 23:10:20,412 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-18 23:10:20,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:10:20,610 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:10:20,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:10:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1828032774, now seen corresponding path program 1 times [2023-12-18 23:10:20,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:10:20,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726152905] [2023-12-18 23:10:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:10:20,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:10:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:10:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 48 proven. 169 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-18 23:10:21,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:10:21,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726152905] [2023-12-18 23:10:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726152905] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:10:21,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140857815] [2023-12-18 23:10:21,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:10:21,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:10:21,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:10:21,281 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 23:10:21,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-18 23:10:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:10:21,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-18 23:10:21,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:10:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 39 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:10:24,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:10:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 38 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:10:36,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140857815] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:10:36,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:10:36,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 36, 36] total 89 [2023-12-18 23:10:36,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839006665] [2023-12-18 23:10:36,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:10:36,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2023-12-18 23:10:36,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:10:36,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2023-12-18 23:10:36,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=6844, Unknown=0, NotChecked=0, Total=7832 [2023-12-18 23:10:36,880 INFO L87 Difference]: Start difference. First operand 16571 states and 20460 transitions. Second operand has 89 states, 89 states have (on average 4.213483146067416) internal successors, (375), 89 states have internal predecessors, (375), 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-18 23:11:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:11:39,123 INFO L93 Difference]: Finished difference Result 26969 states and 32886 transitions. [2023-12-18 23:11:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2023-12-18 23:11:39,124 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 4.213483146067416) internal successors, (375), 89 states have internal predecessors, (375), 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 133 [2023-12-18 23:11:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:11:39,146 INFO L225 Difference]: With dead ends: 26969 [2023-12-18 23:11:39,146 INFO L226 Difference]: Without dead ends: 23791 [2023-12-18 23:11:39,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36384 ImplicationChecksByTransitivity, 58.1s TimeCoverageRelationStatistics Valid=12272, Invalid=87900, Unknown=0, NotChecked=0, Total=100172 [2023-12-18 23:11:39,153 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 32540 mSDsluCounter, 37713 mSDsCounter, 0 mSdLazyCounter, 5236 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32540 SdHoareTripleChecker+Valid, 39247 SdHoareTripleChecker+Invalid, 5536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 5236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-18 23:11:39,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32540 Valid, 39247 Invalid, 5536 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [300 Valid, 5236 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-12-18 23:11:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23791 states. [2023-12-18 23:11:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23791 to 21858. [2023-12-18 23:11:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21858 states, 21856 states have (on average 1.227214494875549) internal successors, (26822), 21857 states have internal predecessors, (26822), 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-18 23:11:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21858 states to 21858 states and 26822 transitions. [2023-12-18 23:11:42,510 INFO L78 Accepts]: Start accepts. Automaton has 21858 states and 26822 transitions. Word has length 133 [2023-12-18 23:11:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:11:42,511 INFO L495 AbstractCegarLoop]: Abstraction has 21858 states and 26822 transitions. [2023-12-18 23:11:42,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 4.213483146067416) internal successors, (375), 89 states have internal predecessors, (375), 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-18 23:11:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 21858 states and 26822 transitions. [2023-12-18 23:11:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-18 23:11:42,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:11:42,514 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:11:42,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-18 23:11:42,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:11:42,716 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:11:42,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:11:42,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1798922262, now seen corresponding path program 1 times [2023-12-18 23:11:42,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:11:42,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000067044] [2023-12-18 23:11:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:11:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:11:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:11:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 32 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:11:43,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:11:43,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000067044] [2023-12-18 23:11:43,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000067044] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:11:43,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876520235] [2023-12-18 23:11:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:11:43,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:11:43,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:11:43,478 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 23:11:43,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-18 23:11:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:11:43,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-18 23:11:43,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:11:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 32 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:11:45,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:11:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 32 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:11:47,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876520235] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:11:47,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:11:47,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 19] total 57 [2023-12-18 23:11:47,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578556139] [2023-12-18 23:11:47,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:11:47,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-18 23:11:47,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:11:47,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-18 23:11:47,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2897, Unknown=0, NotChecked=0, Total=3192 [2023-12-18 23:11:47,581 INFO L87 Difference]: Start difference. First operand 21858 states and 26822 transitions. Second operand has 57 states, 57 states have (on average 6.315789473684211) internal successors, (360), 57 states have internal predecessors, (360), 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-18 23:12:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:12:03,919 INFO L93 Difference]: Finished difference Result 28981 states and 35370 transitions. [2023-12-18 23:12:03,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2023-12-18 23:12:03,920 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 6.315789473684211) internal successors, (360), 57 states have internal predecessors, (360), 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 134 [2023-12-18 23:12:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:12:03,932 INFO L225 Difference]: With dead ends: 28981 [2023-12-18 23:12:03,932 INFO L226 Difference]: Without dead ends: 19252 [2023-12-18 23:12:03,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17507 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=8771, Invalid=45285, Unknown=0, NotChecked=0, Total=54056 [2023-12-18 23:12:03,937 INFO L413 NwaCegarLoop]: 1520 mSDtfsCounter, 33003 mSDsluCounter, 27487 mSDsCounter, 0 mSdLazyCounter, 2249 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33003 SdHoareTripleChecker+Valid, 29007 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-18 23:12:03,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33003 Valid, 29007 Invalid, 2389 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [140 Valid, 2249 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-18 23:12:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19252 states. [2023-12-18 23:12:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19252 to 17934. [2023-12-18 23:12:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17934 states, 17932 states have (on average 1.2339393263439662) internal successors, (22127), 17933 states have internal predecessors, (22127), 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-18 23:12:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17934 states to 17934 states and 22127 transitions. [2023-12-18 23:12:06,909 INFO L78 Accepts]: Start accepts. Automaton has 17934 states and 22127 transitions. Word has length 134 [2023-12-18 23:12:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:12:06,909 INFO L495 AbstractCegarLoop]: Abstraction has 17934 states and 22127 transitions. [2023-12-18 23:12:06,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 6.315789473684211) internal successors, (360), 57 states have internal predecessors, (360), 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-18 23:12:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 17934 states and 22127 transitions. [2023-12-18 23:12:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-18 23:12:06,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:12:06,912 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2023-12-18 23:12:06,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-18 23:12:07,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:12:07,117 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:12:07,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:12:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1010440518, now seen corresponding path program 1 times [2023-12-18 23:12:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:12:07,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567556218] [2023-12-18 23:12:07,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:12:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:12:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:12:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 22 proven. 185 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-18 23:12:07,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:12:07,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567556218] [2023-12-18 23:12:07,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567556218] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:12:07,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126633028] [2023-12-18 23:12:07,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:12:07,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:12:07,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:12:07,383 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 23:12:07,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-18 23:12:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:12:07,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-18 23:12:07,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:12:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 39 proven. 168 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-18 23:12:07,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:12:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 172 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-18 23:12:08,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126633028] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:12:08,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:12:08,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2023-12-18 23:12:08,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859138816] [2023-12-18 23:12:08,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:12:08,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-18 23:12:08,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:12:08,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-18 23:12:08,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-12-18 23:12:08,200 INFO L87 Difference]: Start difference. First operand 17934 states and 22127 transitions. Second operand has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 17 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-18 23:12:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:12:13,526 INFO L93 Difference]: Finished difference Result 42569 states and 52094 transitions. [2023-12-18 23:12:13,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-18 23:12:13,526 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 17 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 134 [2023-12-18 23:12:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:12:13,552 INFO L225 Difference]: With dead ends: 42569 [2023-12-18 23:12:13,553 INFO L226 Difference]: Without dead ends: 26780 [2023-12-18 23:12:13,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-12-18 23:12:13,558 INFO L413 NwaCegarLoop]: 1559 mSDtfsCounter, 3315 mSDsluCounter, 4917 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3315 SdHoareTripleChecker+Valid, 6476 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 23:12:13,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3315 Valid, 6476 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 23:12:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26780 states. [2023-12-18 23:12:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26780 to 22528. [2023-12-18 23:12:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22528 states, 22526 states have (on average 1.1839651957737725) internal successors, (26670), 22527 states have internal predecessors, (26670), 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-18 23:12:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22528 states to 22528 states and 26670 transitions. [2023-12-18 23:12:17,304 INFO L78 Accepts]: Start accepts. Automaton has 22528 states and 26670 transitions. Word has length 134 [2023-12-18 23:12:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:12:17,304 INFO L495 AbstractCegarLoop]: Abstraction has 22528 states and 26670 transitions. [2023-12-18 23:12:17,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 17 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-18 23:12:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 22528 states and 26670 transitions. [2023-12-18 23:12:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-18 23:12:17,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:12:17,306 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:12:17,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-18 23:12:17,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:12:17,511 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:12:17,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:12:17,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1587126698, now seen corresponding path program 1 times [2023-12-18 23:12:17,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:12:17,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821357773] [2023-12-18 23:12:17,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:12:17,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:12:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:12:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 48 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:12:19,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:12:19,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821357773] [2023-12-18 23:12:19,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821357773] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 23:12:19,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220285983] [2023-12-18 23:12:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:12:19,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:12:19,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:12:19,043 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 23:12:19,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-18 23:12:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:12:19,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-18 23:12:19,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:12:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 48 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:12:22,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:12:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 48 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 23:12:28,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220285983] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 23:12:28,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 23:12:28,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 30] total 87 [2023-12-18 23:12:28,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830512218] [2023-12-18 23:12:28,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 23:12:28,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2023-12-18 23:12:28,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:12:28,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2023-12-18 23:12:28,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=638, Invalid=6844, Unknown=0, NotChecked=0, Total=7482 [2023-12-18 23:12:28,620 INFO L87 Difference]: Start difference. First operand 22528 states and 26670 transitions. Second operand has 87 states, 87 states have (on average 4.2298850574712645) internal successors, (368), 87 states have internal predecessors, (368), 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-18 23:15:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:15:11,462 INFO L93 Difference]: Finished difference Result 44130 states and 51872 transitions. [2023-12-18 23:15:11,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 409 states. [2023-12-18 23:15:11,463 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 4.2298850574712645) internal successors, (368), 87 states have internal predecessors, (368), 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 134 [2023-12-18 23:15:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:15:11,490 INFO L225 Difference]: With dead ends: 44130 [2023-12-18 23:15:11,491 INFO L226 Difference]: Without dead ends: 31727 [2023-12-18 23:15:11,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 491 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96093 ImplicationChecksByTransitivity, 153.1s TimeCoverageRelationStatistics Valid=24947, Invalid=217609, Unknown=0, NotChecked=0, Total=242556 [2023-12-18 23:15:11,506 INFO L413 NwaCegarLoop]: 1562 mSDtfsCounter, 45417 mSDsluCounter, 42524 mSDsCounter, 0 mSdLazyCounter, 6568 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45417 SdHoareTripleChecker+Valid, 44086 SdHoareTripleChecker+Invalid, 6952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 6568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-12-18 23:15:11,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45417 Valid, 44086 Invalid, 6952 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [384 Valid, 6568 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-12-18 23:15:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31727 states. [2023-12-18 23:15:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31727 to 23956. [2023-12-18 23:15:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23956 states, 23954 states have (on average 1.1817233029974117) internal successors, (28307), 23955 states have internal predecessors, (28307), 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-18 23:15:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23956 states to 23956 states and 28307 transitions. [2023-12-18 23:15:15,959 INFO L78 Accepts]: Start accepts. Automaton has 23956 states and 28307 transitions. Word has length 134 [2023-12-18 23:15:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:15:15,960 INFO L495 AbstractCegarLoop]: Abstraction has 23956 states and 28307 transitions. [2023-12-18 23:15:15,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 4.2298850574712645) internal successors, (368), 87 states have internal predecessors, (368), 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-18 23:15:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 23956 states and 28307 transitions. [2023-12-18 23:15:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-18 23:15:15,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:15:15,962 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-18 23:15:15,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-12-18 23:15:16,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-18 23:15:16,168 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:15:16,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:15:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash 878356736, now seen corresponding path program 1 times [2023-12-18 23:15:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:15:16,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909109756] [2023-12-18 23:15:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:15:16,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:15:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 23:15:16,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-18 23:15:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 23:15:16,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-18 23:15:16,266 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-18 23:15:16,267 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-18 23:15:16,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-18 23:15:16,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-18 23:15:16,272 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, 1] [2023-12-18 23:15:16,275 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-18 23:15:16,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:15:16 BoogieIcfgContainer [2023-12-18 23:15:16,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-18 23:15:16,371 INFO L158 Benchmark]: Toolchain (without parser) took 779190.64ms. Allocated memory was 213.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 148.4MB in the beginning and 1.0GB in the end (delta: -883.3MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-12-18 23:15:16,372 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-18 23:15:16,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1302.77ms. Allocated memory is still 213.9MB. Free memory was 148.4MB in the beginning and 145.9MB in the end (delta: 2.5MB). Peak memory consumption was 85.6MB. Max. memory is 8.0GB. [2023-12-18 23:15:16,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 275.60ms. Allocated memory was 213.9MB in the beginning and 286.3MB in the end (delta: 72.4MB). Free memory was 145.9MB in the beginning and 181.7MB in the end (delta: -35.8MB). Peak memory consumption was 89.7MB. Max. memory is 8.0GB. [2023-12-18 23:15:16,375 INFO L158 Benchmark]: Boogie Preprocessor took 405.15ms. Allocated memory is still 286.3MB. Free memory was 181.7MB in the beginning and 151.8MB in the end (delta: 29.9MB). Peak memory consumption was 80.7MB. Max. memory is 8.0GB. [2023-12-18 23:15:16,375 INFO L158 Benchmark]: RCFGBuilder took 3073.56ms. Allocated memory was 286.3MB in the beginning and 572.5MB in the end (delta: 286.3MB). Free memory was 151.8MB in the beginning and 274.0MB in the end (delta: -122.2MB). Peak memory consumption was 238.6MB. Max. memory is 8.0GB. [2023-12-18 23:15:16,377 INFO L158 Benchmark]: TraceAbstraction took 774128.23ms. Allocated memory was 572.5MB in the beginning and 2.1GB in the end (delta: 1.5GB). Free memory was 273.5MB in the beginning and 1.0GB in the end (delta: -758.3MB). Peak memory consumption was 792.0MB. Max. memory is 8.0GB. [2023-12-18 23:15:16,377 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.11ms. Allocated memory is still 178.3MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1302.77ms. Allocated memory is still 213.9MB. Free memory was 148.4MB in the beginning and 145.9MB in the end (delta: 2.5MB). Peak memory consumption was 85.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 275.60ms. Allocated memory was 213.9MB in the beginning and 286.3MB in the end (delta: 72.4MB). Free memory was 145.9MB in the beginning and 181.7MB in the end (delta: -35.8MB). Peak memory consumption was 89.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 405.15ms. Allocated memory is still 286.3MB. Free memory was 181.7MB in the beginning and 151.8MB in the end (delta: 29.9MB). Peak memory consumption was 80.7MB. Max. memory is 8.0GB. * RCFGBuilder took 3073.56ms. Allocated memory was 286.3MB in the beginning and 572.5MB in the end (delta: 286.3MB). Free memory was 151.8MB in the beginning and 274.0MB in the end (delta: -122.2MB). Peak memory consumption was 238.6MB. Max. memory is 8.0GB. * TraceAbstraction took 774128.23ms. Allocated memory was 572.5MB in the beginning and 2.1GB in the end (delta: 1.5GB). Free memory was 273.5MB in the beginning and 1.0GB in the end (delta: -758.3MB). Peak memory consumption was 792.0MB. 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: 292]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L35] msg_t nomsg = (msg_t )-1; [L36] char r1 ; [L37] port_t p1 ; [L38] char p1_old ; [L39] char p1_new ; [L40] char id1 ; [L41] char st1 ; [L42] msg_t send1 ; [L43] _Bool mode1 ; [L44] port_t p2 ; [L45] char p2_old ; [L46] char p2_new ; [L47] char id2 ; [L48] char st2 ; [L49] msg_t send2 ; [L50] _Bool mode2 ; [L51] port_t p3 ; [L52] char p3_old ; [L53] char p3_new ; [L54] char id3 ; [L55] char st3 ; [L56] msg_t send3 ; [L57] _Bool mode3 ; [L308] int inputC = 3; [L309] int inputF = 6; [L310] int inputA = 1; [L311] int inputB = 2; [L312] int inputD = 4; [L313] int inputE = 5; [L316] int a17 = -124; [L317] int a5 = 4; [L318] int a24 = 15; [L319] int a2 = 170; [L320] int a7 = 13; [L5128] COND TRUE __VERIFIER_nondet_int() [L5129] CALL main1() [L239] int c1 ; [L240] int i2 ; [L243] c1 = 0 [L244] r1 = __VERIFIER_nondet_char() [L245] id1 = __VERIFIER_nondet_char() [L246] st1 = __VERIFIER_nondet_char() [L247] send1 = __VERIFIER_nondet_char() [L248] mode1 = __VERIFIER_nondet_bool() [L249] id2 = __VERIFIER_nondet_char() [L250] st2 = __VERIFIER_nondet_char() [L251] send2 = __VERIFIER_nondet_char() [L252] mode2 = __VERIFIER_nondet_bool() [L253] id3 = __VERIFIER_nondet_char() [L254] st3 = __VERIFIER_nondet_char() [L255] send3 = __VERIFIER_nondet_char() [L256] mode3 = __VERIFIER_nondet_bool() [L257] CALL, EXPR init() [L138] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L141] COND TRUE (int )r1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L142] COND TRUE (int )id1 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L143] COND TRUE (int )st1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L144] COND TRUE (int )send1 == (int )id1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L145] COND TRUE (int )mode1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L146] COND TRUE (int )id2 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L147] COND TRUE (int )st2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L148] COND TRUE (int )send2 == (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L149] COND TRUE (int )mode2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L150] COND TRUE (int )id3 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L151] COND TRUE (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L152] COND TRUE (int )send3 == (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L153] COND TRUE (int )mode3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L154] COND TRUE (int )id1 != (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L155] COND TRUE (int )id1 != (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L156] COND TRUE (int )id2 != (int )id3 [L157] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0, tmp=1] [L206] return (tmp); [L257] RET, EXPR init() [L257] i2 = init() [L258] COND FALSE !(!(i2)) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=0, i2=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L259] p1_old = nomsg [L260] p1_new = nomsg [L261] p2_old = nomsg [L262] p2_new = nomsg [L263] p3_old = nomsg [L264] p3_new = nomsg [L265] i2 = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=0, i2=0, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L64] COND FALSE !(\read(mode1)) [L80] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L81] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L92] COND FALSE !(\read(mode2)) [L105] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L106] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L117] COND FALSE !(\read(mode3)) [L130] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L131] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=125, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L64] COND TRUE \read(mode1) [L65] r1 = (char )((int )r1 + 1) [L66] m1 = p3_old [L67] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L72] COND FALSE !((int )m1 == (int )id1) [L75] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L92] COND TRUE \read(mode2) [L93] m2 = p1_old [L94] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L95] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L96] COND TRUE (int )m2 > (int )id2 [L97] send2 = m2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L103] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L117] COND TRUE \read(mode3) [L118] m3 = p2_old [L119] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=126, 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=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L120] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=126, 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=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L121] COND TRUE (int )m3 > (int )id3 [L122] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=126, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L128] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=126, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=2, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L64] COND FALSE !(\read(mode1)) [L80] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L81] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L92] COND FALSE !(\read(mode2)) [L105] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L106] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L117] COND FALSE !(\read(mode3)) [L130] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L131] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=126, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=3, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L64] COND TRUE \read(mode1) [L65] r1 = (char )((int )r1 + 1) [L66] m1 = p3_old [L67] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L72] COND FALSE !((int )m1 == (int )id1) [L75] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L92] COND TRUE \read(mode2) [L93] m2 = p1_old [L94] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L95] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L96] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L99] COND FALSE !((int )m2 == (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L103] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=125, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L117] COND TRUE \read(mode3) [L118] m3 = p2_old [L119] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L120] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L121] COND TRUE (int )m3 > (int )id3 [L122] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L128] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=4, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L64] COND FALSE !(\read(mode1)) [L80] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L81] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L92] COND FALSE !(\read(mode2)) [L105] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L106] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L117] COND FALSE !(\read(mode3)) [L130] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L131] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=5, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L64] COND TRUE \read(mode1) [L65] r1 = (char )((int )r1 + 1) [L66] m1 = p3_old [L67] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L72] COND TRUE (int )m1 == (int )id1 [L73] st1 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L78] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L92] COND TRUE \read(mode2) [L93] m2 = p1_old [L94] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L95] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L96] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L99] COND TRUE (int )m2 == (int )id2 [L100] st2 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L103] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=126, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L117] COND TRUE \read(mode3) [L118] m3 = p2_old [L119] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L120] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L121] COND TRUE (int )m3 > (int )id3 [L122] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L128] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L214] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L232] tmp = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0, tmp=0] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND TRUE ! arg VAL [\old(arg)=0, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=0, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L292] reach_error() VAL [\old(arg)=0, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=0, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] - UnprovableResult [Line: 496]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 807 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 774.0s, OverallIterations: 37, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 635.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463558 SdHoareTripleChecker+Valid, 41.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 463558 mSDsluCounter, 509704 SdHoareTripleChecker+Invalid, 37.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 455892 mSDsCounter, 3879 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49148 IncrementalHoareTripleChecker+Invalid, 53027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3879 mSolverCounterUnsat, 53812 mSDtfsCounter, 49148 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6584 GetRequests, 3084 SyntacticMatches, 10 SemanticMatches, 3490 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358580 ImplicationChecksByTransitivity, 584.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23956occurred in iteration=36, InterpolantAutomatonStates: 2682, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 74134 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 101.9s InterpolantComputationTime, 4439 NumberOfCodeBlocks, 4439 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 6059 ConstructedInterpolants, 0 QuantifiedInterpolants, 153484 SizeOfPredicates, 197 NumberOfNonLiveVariables, 8209 ConjunctsInSsa, 656 ConjunctsInUnsatCore, 76 InterpolantComputations, 16 PerfectInterpolantSequences, 1800/5559 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-18 23:15:16,542 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...