./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:11:01,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:11:01,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:11:01,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:11:01,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:11:01,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:11:01,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:11:01,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:11:01,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:11:01,557 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:11:01,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:11:01,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:11:01,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:11:01,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:11:01,562 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:11:01,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:11:01,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:11:01,563 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:11:01,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:11:01,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:11:01,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:11:01,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:11:01,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:11:01,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:11:01,569 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:11:01,569 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:11:01,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:11:01,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:11:01,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:11:01,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:11:01,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:11:01,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:11:01,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:11:01,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:11:01,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:11:01,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:11:01,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:11:01,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:11:01,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:11:01,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:11:01,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:11:01,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:11:01,575 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2024-10-12 15:11:01,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:11:01,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:11:01,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:11:01,893 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:11:01,893 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:11:01,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2024-10-12 15:11:03,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:11:03,639 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:11:03,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2024-10-12 15:11:03,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e186def/0c6f2c1783a84772b4282dea3b202331/FLAG03d07244f [2024-10-12 15:11:03,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e186def/0c6f2c1783a84772b4282dea3b202331 [2024-10-12 15:11:03,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:11:03,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:11:03,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:03,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:11:03,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:11:03,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:03" (1/1) ... [2024-10-12 15:11:03,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73478cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:03, skipping insertion in model container [2024-10-12 15:11:03,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:03" (1/1) ... [2024-10-12 15:11:03,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:11:04,014 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2024-10-12 15:11:04,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:11:04,047 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:11:04,134 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2024-10-12 15:11:04,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:11:04,167 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:11:04,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04 WrapperNode [2024-10-12 15:11:04,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:04,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:11:04,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:11:04,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:11:04,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (1/1) ... [2024-10-12 15:11:04,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (1/1) ... [2024-10-12 15:11:04,244 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 644 [2024-10-12 15:11:04,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:11:04,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:11:04,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:11:04,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:11:04,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (1/1) ... [2024-10-12 15:11:04,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (1/1) ... [2024-10-12 15:11:04,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (1/1) ... [2024-10-12 15:11:04,281 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:11:04,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (1/1) ... [2024-10-12 15:11:04,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (1/1) ... [2024-10-12 15:11:04,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (1/1) ... [2024-10-12 15:11:04,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (1/1) ... [2024-10-12 15:11:04,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (1/1) ... [2024-10-12 15:11:04,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (1/1) ... [2024-10-12 15:11:04,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:11:04,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:11:04,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:11:04,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:11:04,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (1/1) ... [2024-10-12 15:11:04,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:11:04,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:04,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:11:04,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:11:04,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:11:04,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:11:04,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:11:04,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:11:04,510 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:11:04,513 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:11:04,538 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 15:11:05,132 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume !false; [2024-10-12 15:11:05,133 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##102: assume false; [2024-10-12 15:11:05,178 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-12 15:11:05,178 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:11:05,233 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:11:05,234 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:11:05,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:05 BoogieIcfgContainer [2024-10-12 15:11:05,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:11:05,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:11:05,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:11:05,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:11:05,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:11:03" (1/3) ... [2024-10-12 15:11:05,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd7b883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:11:05, skipping insertion in model container [2024-10-12 15:11:05,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:04" (2/3) ... [2024-10-12 15:11:05,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd7b883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:11:05, skipping insertion in model container [2024-10-12 15:11:05,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:05" (3/3) ... [2024-10-12 15:11:05,246 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2024-10-12 15:11:05,262 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:11:05,263 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:11:05,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:11:05,337 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40751e2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:11:05,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:11:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 159 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 15:11:05,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:05,356 INFO L215 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] [2024-10-12 15:11:05,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:05,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:05,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1162804964, now seen corresponding path program 1 times [2024-10-12 15:11:05,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:05,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722656290] [2024-10-12 15:11:05,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:05,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:11:05,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:05,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722656290] [2024-10-12 15:11:05,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722656290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:05,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:05,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:11:05,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851822326] [2024-10-12 15:11:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:05,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:05,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:05,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:05,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:05,737 INFO L87 Difference]: Start difference. First operand has 160 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 159 states have internal predecessors, (279), 0 states have call successors, (0), 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 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:05,994 INFO L93 Difference]: Finished difference Result 328 states and 575 transitions. [2024-10-12 15:11:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:05,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-12 15:11:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:06,008 INFO L225 Difference]: With dead ends: 328 [2024-10-12 15:11:06,008 INFO L226 Difference]: Without dead ends: 168 [2024-10-12 15:11:06,012 INFO L431 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 [2024-10-12 15:11:06,017 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:06,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 431 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-12 15:11:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-12 15:11:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.5688622754491017) internal successors, (262), 167 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) [2024-10-12 15:11:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 262 transitions. [2024-10-12 15:11:06,106 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 262 transitions. Word has length 43 [2024-10-12 15:11:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:06,107 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 262 transitions. [2024-10-12 15:11:06,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 262 transitions. [2024-10-12 15:11:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 15:11:06,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:06,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:06,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:11:06,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:06,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:06,114 INFO L85 PathProgramCache]: Analyzing trace with hash -51465524, now seen corresponding path program 1 times [2024-10-12 15:11:06,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:06,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075607015] [2024-10-12 15:11:06,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:06,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:11:06,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:06,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075607015] [2024-10-12 15:11:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075607015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:06,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:06,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955812790] [2024-10-12 15:11:06,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:06,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:06,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:06,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:06,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:06,291 INFO L87 Difference]: Start difference. First operand 168 states and 262 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:06,458 INFO L93 Difference]: Finished difference Result 343 states and 540 transitions. [2024-10-12 15:11:06,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:06,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-12 15:11:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:06,461 INFO L225 Difference]: With dead ends: 343 [2024-10-12 15:11:06,464 INFO L226 Difference]: Without dead ends: 188 [2024-10-12 15:11:06,465 INFO L431 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 [2024-10-12 15:11:06,467 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:06,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 375 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-12 15:11:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-10-12 15:11:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.53475935828877) internal successors, (287), 187 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 287 transitions. [2024-10-12 15:11:06,489 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 287 transitions. Word has length 58 [2024-10-12 15:11:06,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:06,490 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 287 transitions. [2024-10-12 15:11:06,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:06,490 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 287 transitions. [2024-10-12 15:11:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 15:11:06,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:06,495 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 15:11:06,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:11:06,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:06,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash -900899268, now seen corresponding path program 1 times [2024-10-12 15:11:06,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:06,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703612728] [2024-10-12 15:11:06,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:06,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 15:11:06,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:06,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703612728] [2024-10-12 15:11:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703612728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:06,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:06,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191018616] [2024-10-12 15:11:06,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:06,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:06,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:06,635 INFO L87 Difference]: Start difference. First operand 188 states and 287 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:06,825 INFO L93 Difference]: Finished difference Result 404 states and 630 transitions. [2024-10-12 15:11:06,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:06,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 78 [2024-10-12 15:11:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:06,829 INFO L225 Difference]: With dead ends: 404 [2024-10-12 15:11:06,829 INFO L226 Difference]: Without dead ends: 229 [2024-10-12 15:11:06,833 INFO L431 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 [2024-10-12 15:11:06,834 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 10 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:06,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 372 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:06,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-12 15:11:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-12 15:11:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4605263157894737) internal successors, (333), 228 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 333 transitions. [2024-10-12 15:11:06,850 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 333 transitions. Word has length 78 [2024-10-12 15:11:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:06,850 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 333 transitions. [2024-10-12 15:11:06,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 333 transitions. [2024-10-12 15:11:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 15:11:06,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:06,857 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 15:11:06,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:11:06,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash -477252546, now seen corresponding path program 1 times [2024-10-12 15:11:06,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:06,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805195118] [2024-10-12 15:11:06,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 15:11:06,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:06,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805195118] [2024-10-12 15:11:06,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805195118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:06,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:06,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955575460] [2024-10-12 15:11:06,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:06,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:06,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:06,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:06,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:06,961 INFO L87 Difference]: Start difference. First operand 229 states and 333 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:07,103 INFO L93 Difference]: Finished difference Result 467 states and 686 transitions. [2024-10-12 15:11:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:07,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 78 [2024-10-12 15:11:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:07,105 INFO L225 Difference]: With dead ends: 467 [2024-10-12 15:11:07,105 INFO L226 Difference]: Without dead ends: 251 [2024-10-12 15:11:07,106 INFO L431 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 [2024-10-12 15:11:07,107 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:07,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 391 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-12 15:11:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-10-12 15:11:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.44) internal successors, (360), 250 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) [2024-10-12 15:11:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 360 transitions. [2024-10-12 15:11:07,123 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 360 transitions. Word has length 78 [2024-10-12 15:11:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:07,123 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 360 transitions. [2024-10-12 15:11:07,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 360 transitions. [2024-10-12 15:11:07,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 15:11:07,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:07,126 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:07,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:11:07,127 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:07,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1974049696, now seen corresponding path program 1 times [2024-10-12 15:11:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:07,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764229100] [2024-10-12 15:11:07,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:07,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-12 15:11:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:07,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764229100] [2024-10-12 15:11:07,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764229100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:07,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:07,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914078194] [2024-10-12 15:11:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:07,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:07,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:07,218 INFO L87 Difference]: Start difference. First operand 251 states and 360 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:07,374 INFO L93 Difference]: Finished difference Result 513 states and 744 transitions. [2024-10-12 15:11:07,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:07,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 [2024-10-12 15:11:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:07,378 INFO L225 Difference]: With dead ends: 513 [2024-10-12 15:11:07,378 INFO L226 Difference]: Without dead ends: 275 [2024-10-12 15:11:07,378 INFO L431 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 [2024-10-12 15:11:07,383 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:07,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 390 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-12 15:11:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-12 15:11:07,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.4197080291970803) internal successors, (389), 274 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 389 transitions. [2024-10-12 15:11:07,392 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 389 transitions. Word has length 98 [2024-10-12 15:11:07,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:07,393 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 389 transitions. [2024-10-12 15:11:07,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 389 transitions. [2024-10-12 15:11:07,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 15:11:07,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:07,396 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:07,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:11:07,396 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:07,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:07,397 INFO L85 PathProgramCache]: Analyzing trace with hash 340894480, now seen corresponding path program 1 times [2024-10-12 15:11:07,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:07,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995711842] [2024-10-12 15:11:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:07,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-12 15:11:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:07,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995711842] [2024-10-12 15:11:07,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995711842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:07,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:07,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:07,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658854444] [2024-10-12 15:11:07,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:07,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:07,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:07,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:07,636 INFO L87 Difference]: Start difference. First operand 275 states and 389 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:07,685 INFO L93 Difference]: Finished difference Result 793 states and 1119 transitions. [2024-10-12 15:11:07,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:07,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 117 [2024-10-12 15:11:07,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:07,689 INFO L225 Difference]: With dead ends: 793 [2024-10-12 15:11:07,689 INFO L226 Difference]: Without dead ends: 531 [2024-10-12 15:11:07,690 INFO L431 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 [2024-10-12 15:11:07,691 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 168 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:07,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 560 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-12 15:11:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2024-10-12 15:11:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.4056603773584906) internal successors, (745), 530 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 745 transitions. [2024-10-12 15:11:07,704 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 745 transitions. Word has length 117 [2024-10-12 15:11:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:07,705 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 745 transitions. [2024-10-12 15:11:07,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 745 transitions. [2024-10-12 15:11:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 15:11:07,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:07,707 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:07,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:11:07,708 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:07,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:07,708 INFO L85 PathProgramCache]: Analyzing trace with hash 589040974, now seen corresponding path program 1 times [2024-10-12 15:11:07,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:07,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863848807] [2024-10-12 15:11:07,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:07,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 15:11:07,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:07,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863848807] [2024-10-12 15:11:07,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863848807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:07,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:07,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:07,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054413129] [2024-10-12 15:11:07,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:07,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:07,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:07,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:07,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:07,781 INFO L87 Difference]: Start difference. First operand 531 states and 745 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:07,830 INFO L93 Difference]: Finished difference Result 1307 states and 1834 transitions. [2024-10-12 15:11:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:07,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-10-12 15:11:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:07,834 INFO L225 Difference]: With dead ends: 1307 [2024-10-12 15:11:07,835 INFO L226 Difference]: Without dead ends: 789 [2024-10-12 15:11:07,836 INFO L431 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 [2024-10-12 15:11:07,837 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 170 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:07,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 580 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-10-12 15:11:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2024-10-12 15:11:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.401015228426396) internal successors, (1104), 788 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1104 transitions. [2024-10-12 15:11:07,863 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1104 transitions. Word has length 117 [2024-10-12 15:11:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:07,864 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1104 transitions. [2024-10-12 15:11:07,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1104 transitions. [2024-10-12 15:11:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 15:11:07,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:07,867 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:07,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:11:07,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:07,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:07,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2139168372, now seen corresponding path program 1 times [2024-10-12 15:11:07,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:07,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136011657] [2024-10-12 15:11:07,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:07,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 15:11:07,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:07,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136011657] [2024-10-12 15:11:07,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136011657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:07,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:07,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:07,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441210108] [2024-10-12 15:11:07,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:07,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:07,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:07,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:07,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:07,924 INFO L87 Difference]: Start difference. First operand 789 states and 1104 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:07,963 INFO L93 Difference]: Finished difference Result 1588 states and 2216 transitions. [2024-10-12 15:11:07,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:07,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 117 [2024-10-12 15:11:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:07,968 INFO L225 Difference]: With dead ends: 1588 [2024-10-12 15:11:07,969 INFO L226 Difference]: Without dead ends: 812 [2024-10-12 15:11:07,970 INFO L431 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 [2024-10-12 15:11:07,973 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 10 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:07,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 465 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-12 15:11:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2024-10-12 15:11:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.3958076448828607) internal successors, (1132), 811 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1132 transitions. [2024-10-12 15:11:07,993 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1132 transitions. Word has length 117 [2024-10-12 15:11:07,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:07,993 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1132 transitions. [2024-10-12 15:11:07,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1132 transitions. [2024-10-12 15:11:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 15:11:07,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:07,995 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:07,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:11:07,996 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:07,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:07,998 INFO L85 PathProgramCache]: Analyzing trace with hash -241671606, now seen corresponding path program 1 times [2024-10-12 15:11:07,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:07,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364217966] [2024-10-12 15:11:07,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:07,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 15:11:08,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:08,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364217966] [2024-10-12 15:11:08,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364217966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:08,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:08,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:11:08,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91338662] [2024-10-12 15:11:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:08,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:08,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:08,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:08,051 INFO L87 Difference]: Start difference. First operand 812 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:08,088 INFO L93 Difference]: Finished difference Result 1623 states and 2256 transitions. [2024-10-12 15:11:08,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:08,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 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 117 [2024-10-12 15:11:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:08,093 INFO L225 Difference]: With dead ends: 1623 [2024-10-12 15:11:08,093 INFO L226 Difference]: Without dead ends: 824 [2024-10-12 15:11:08,097 INFO L431 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 [2024-10-12 15:11:08,097 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 15 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:08,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 437 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-10-12 15:11:08,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2024-10-12 15:11:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.3900364520048603) internal successors, (1144), 823 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1144 transitions. [2024-10-12 15:11:08,118 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1144 transitions. Word has length 117 [2024-10-12 15:11:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:08,118 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1144 transitions. [2024-10-12 15:11:08,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1144 transitions. [2024-10-12 15:11:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-12 15:11:08,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:08,121 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:08,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:11:08,122 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:08,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash 692580231, now seen corresponding path program 1 times [2024-10-12 15:11:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288368175] [2024-10-12 15:11:08,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:08,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-12 15:11:08,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:08,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288368175] [2024-10-12 15:11:08,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288368175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:08,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:08,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:08,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103733122] [2024-10-12 15:11:08,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:08,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:08,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:08,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:08,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:08,231 INFO L87 Difference]: Start difference. First operand 824 states and 1144 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:08,404 INFO L93 Difference]: Finished difference Result 1731 states and 2448 transitions. [2024-10-12 15:11:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:08,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 154 [2024-10-12 15:11:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:08,408 INFO L225 Difference]: With dead ends: 1731 [2024-10-12 15:11:08,409 INFO L226 Difference]: Without dead ends: 932 [2024-10-12 15:11:08,411 INFO L431 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 [2024-10-12 15:11:08,411 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 26 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:08,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 381 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-10-12 15:11:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 904. [2024-10-12 15:11:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 1.3732004429678848) internal successors, (1240), 903 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1240 transitions. [2024-10-12 15:11:08,431 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1240 transitions. Word has length 154 [2024-10-12 15:11:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:08,431 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1240 transitions. [2024-10-12 15:11:08,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1240 transitions. [2024-10-12 15:11:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-12 15:11:08,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:08,434 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:08,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:11:08,434 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:08,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1951696596, now seen corresponding path program 1 times [2024-10-12 15:11:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:08,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841321279] [2024-10-12 15:11:08,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-12 15:11:08,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:08,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841321279] [2024-10-12 15:11:08,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841321279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:08,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:08,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901790858] [2024-10-12 15:11:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:08,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:08,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:08,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:08,511 INFO L87 Difference]: Start difference. First operand 904 states and 1240 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:08,657 INFO L93 Difference]: Finished difference Result 1933 states and 2720 transitions. [2024-10-12 15:11:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:08,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 165 [2024-10-12 15:11:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:08,662 INFO L225 Difference]: With dead ends: 1933 [2024-10-12 15:11:08,662 INFO L226 Difference]: Without dead ends: 1051 [2024-10-12 15:11:08,664 INFO L431 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 [2024-10-12 15:11:08,666 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 78 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:08,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 291 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-12 15:11:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2024-10-12 15:11:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.418095238095238) internal successors, (1489), 1050 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1489 transitions. [2024-10-12 15:11:08,687 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1489 transitions. Word has length 165 [2024-10-12 15:11:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:08,688 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1489 transitions. [2024-10-12 15:11:08,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1489 transitions. [2024-10-12 15:11:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-12 15:11:08,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:08,691 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:08,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:11:08,691 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:08,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:08,692 INFO L85 PathProgramCache]: Analyzing trace with hash 442861685, now seen corresponding path program 1 times [2024-10-12 15:11:08,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:08,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745138730] [2024-10-12 15:11:08,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:08,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-12 15:11:08,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:08,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745138730] [2024-10-12 15:11:08,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745138730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:08,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:08,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:08,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680800814] [2024-10-12 15:11:08,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:08,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:08,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:08,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:08,777 INFO L87 Difference]: Start difference. First operand 1051 states and 1489 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:08,919 INFO L93 Difference]: Finished difference Result 2167 states and 3107 transitions. [2024-10-12 15:11:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:08,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 196 [2024-10-12 15:11:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:08,925 INFO L225 Difference]: With dead ends: 2167 [2024-10-12 15:11:08,925 INFO L226 Difference]: Without dead ends: 1141 [2024-10-12 15:11:08,927 INFO L431 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 [2024-10-12 15:11:08,928 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 10 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:08,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 388 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2024-10-12 15:11:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2024-10-12 15:11:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 1.3982456140350876) internal successors, (1594), 1140 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1594 transitions. [2024-10-12 15:11:08,972 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1594 transitions. Word has length 196 [2024-10-12 15:11:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:08,973 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1594 transitions. [2024-10-12 15:11:08,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1594 transitions. [2024-10-12 15:11:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-12 15:11:08,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:08,977 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:08,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 15:11:08,977 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:08,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1409517476, now seen corresponding path program 1 times [2024-10-12 15:11:08,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:08,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525029352] [2024-10-12 15:11:08,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:08,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-10-12 15:11:09,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:09,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525029352] [2024-10-12 15:11:09,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525029352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:09,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:09,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:09,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222032005] [2024-10-12 15:11:09,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:09,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:09,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:09,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:09,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:09,126 INFO L87 Difference]: Start difference. First operand 1141 states and 1594 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:09,285 INFO L93 Difference]: Finished difference Result 2380 states and 3380 transitions. [2024-10-12 15:11:09,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:09,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 223 [2024-10-12 15:11:09,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:09,290 INFO L225 Difference]: With dead ends: 2380 [2024-10-12 15:11:09,290 INFO L226 Difference]: Without dead ends: 1139 [2024-10-12 15:11:09,292 INFO L431 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 [2024-10-12 15:11:09,294 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:09,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 391 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-12 15:11:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-10-12 15:11:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.3919156414762741) internal successors, (1584), 1138 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1584 transitions. [2024-10-12 15:11:09,317 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1584 transitions. Word has length 223 [2024-10-12 15:11:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:09,317 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1584 transitions. [2024-10-12 15:11:09,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1584 transitions. [2024-10-12 15:11:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-12 15:11:09,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:09,321 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-10-12 15:11:09,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 15:11:09,322 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:09,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:09,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1957206764, now seen corresponding path program 1 times [2024-10-12 15:11:09,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:09,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895675782] [2024-10-12 15:11:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:09,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-10-12 15:11:09,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:09,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895675782] [2024-10-12 15:11:09,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895675782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:09,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:09,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:09,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272016043] [2024-10-12 15:11:09,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:09,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:09,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:09,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:09,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:09,431 INFO L87 Difference]: Start difference. First operand 1139 states and 1584 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:09,471 INFO L93 Difference]: Finished difference Result 3254 states and 4553 transitions. [2024-10-12 15:11:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:09,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 262 [2024-10-12 15:11:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:09,477 INFO L225 Difference]: With dead ends: 3254 [2024-10-12 15:11:09,477 INFO L226 Difference]: Without dead ends: 1449 [2024-10-12 15:11:09,480 INFO L431 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 [2024-10-12 15:11:09,480 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 156 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:09,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 634 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2024-10-12 15:11:09,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1447. [2024-10-12 15:11:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1446 states have (on average 1.3955739972337482) internal successors, (2018), 1446 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2018 transitions. [2024-10-12 15:11:09,549 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2018 transitions. Word has length 262 [2024-10-12 15:11:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:09,549 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 2018 transitions. [2024-10-12 15:11:09,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2018 transitions. [2024-10-12 15:11:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-10-12 15:11:09,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:09,555 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:09,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 15:11:09,556 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:09,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:09,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1169172624, now seen corresponding path program 1 times [2024-10-12 15:11:09,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:09,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769159698] [2024-10-12 15:11:09,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:09,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2024-10-12 15:11:09,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:09,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769159698] [2024-10-12 15:11:09,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769159698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:09,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:09,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:09,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964892038] [2024-10-12 15:11:09,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:09,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:09,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:09,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:09,664 INFO L87 Difference]: Start difference. First operand 1447 states and 2018 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:09,796 INFO L93 Difference]: Finished difference Result 2973 states and 4183 transitions. [2024-10-12 15:11:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:09,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 308 [2024-10-12 15:11:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:09,802 INFO L225 Difference]: With dead ends: 2973 [2024-10-12 15:11:09,802 INFO L226 Difference]: Without dead ends: 1551 [2024-10-12 15:11:09,805 INFO L431 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 [2024-10-12 15:11:09,805 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:09,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 387 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-10-12 15:11:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2024-10-12 15:11:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 1.3819354838709677) internal successors, (2142), 1550 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:09,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2142 transitions. [2024-10-12 15:11:09,837 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2142 transitions. Word has length 308 [2024-10-12 15:11:09,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:09,837 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2142 transitions. [2024-10-12 15:11:09,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2142 transitions. [2024-10-12 15:11:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-12 15:11:09,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:09,842 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:09,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 15:11:09,843 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:09,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:09,843 INFO L85 PathProgramCache]: Analyzing trace with hash 949109441, now seen corresponding path program 1 times [2024-10-12 15:11:09,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:09,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170558143] [2024-10-12 15:11:09,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:09,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 607 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2024-10-12 15:11:09,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:09,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170558143] [2024-10-12 15:11:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170558143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:09,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:09,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:09,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337534579] [2024-10-12 15:11:09,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:09,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:09,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:09,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:09,932 INFO L87 Difference]: Start difference. First operand 1551 states and 2142 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:10,069 INFO L93 Difference]: Finished difference Result 3189 states and 4447 transitions. [2024-10-12 15:11:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:10,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 330 [2024-10-12 15:11:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:10,074 INFO L225 Difference]: With dead ends: 3189 [2024-10-12 15:11:10,075 INFO L226 Difference]: Without dead ends: 1663 [2024-10-12 15:11:10,076 INFO L431 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 [2024-10-12 15:11:10,077 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:10,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 387 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-10-12 15:11:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2024-10-12 15:11:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1662 states have (on average 1.3682310469314078) internal successors, (2274), 1662 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2274 transitions. [2024-10-12 15:11:10,108 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2274 transitions. Word has length 330 [2024-10-12 15:11:10,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:10,108 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2274 transitions. [2024-10-12 15:11:10,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:10,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2274 transitions. [2024-10-12 15:11:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-10-12 15:11:10,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:10,113 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:10,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 15:11:10,113 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:10,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1022881964, now seen corresponding path program 1 times [2024-10-12 15:11:10,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:10,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008911687] [2024-10-12 15:11:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-10-12 15:11:10,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:10,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008911687] [2024-10-12 15:11:10,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008911687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:10,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156621242] [2024-10-12 15:11:10,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:10,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:10,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:10,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:10,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:11:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:10,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:11:10,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-10-12 15:11:10,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-10-12 15:11:10,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156621242] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:10,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:10,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-12 15:11:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952282129] [2024-10-12 15:11:10,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:10,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:10,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:10,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:10,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:10,703 INFO L87 Difference]: Start difference. First operand 1663 states and 2274 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:11,153 INFO L93 Difference]: Finished difference Result 4040 states and 5599 transitions. [2024-10-12 15:11:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 15:11:11,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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 362 [2024-10-12 15:11:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:11,162 INFO L225 Difference]: With dead ends: 4040 [2024-10-12 15:11:11,163 INFO L226 Difference]: Without dead ends: 2283 [2024-10-12 15:11:11,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-12 15:11:11,167 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 523 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:11,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1006 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:11:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2024-10-12 15:11:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 1675. [2024-10-12 15:11:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.3536439665471924) internal successors, (2266), 1674 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2266 transitions. [2024-10-12 15:11:11,205 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2266 transitions. Word has length 362 [2024-10-12 15:11:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:11,205 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2266 transitions. [2024-10-12 15:11:11,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2266 transitions. [2024-10-12 15:11:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-10-12 15:11:11,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:11,213 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:11,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:11,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-12 15:11:11,414 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:11,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:11,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1312534653, now seen corresponding path program 1 times [2024-10-12 15:11:11,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:11,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025721431] [2024-10-12 15:11:11,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:11,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 1260 proven. 0 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2024-10-12 15:11:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025721431] [2024-10-12 15:11:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025721431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:11,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:11,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:11,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949826783] [2024-10-12 15:11:11,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:11,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:11,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:11,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:11,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:11,540 INFO L87 Difference]: Start difference. First operand 1675 states and 2266 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:11,678 INFO L93 Difference]: Finished difference Result 3490 states and 4794 transitions. [2024-10-12 15:11:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:11,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 459 [2024-10-12 15:11:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:11,685 INFO L225 Difference]: With dead ends: 3490 [2024-10-12 15:11:11,686 INFO L226 Difference]: Without dead ends: 1840 [2024-10-12 15:11:11,688 INFO L431 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 [2024-10-12 15:11:11,689 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:11,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 381 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2024-10-12 15:11:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2024-10-12 15:11:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3355084284937466) internal successors, (2456), 1839 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2456 transitions. [2024-10-12 15:11:11,729 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2456 transitions. Word has length 459 [2024-10-12 15:11:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:11,730 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2456 transitions. [2024-10-12 15:11:11,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2456 transitions. [2024-10-12 15:11:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2024-10-12 15:11:11,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:11,742 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:11,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 15:11:11,743 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:11,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash 460784419, now seen corresponding path program 1 times [2024-10-12 15:11:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:11,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579736236] [2024-10-12 15:11:11,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:11,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2967 backedges. 1680 proven. 0 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2024-10-12 15:11:11,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:11,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579736236] [2024-10-12 15:11:11,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579736236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:11,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:11,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:11,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088974137] [2024-10-12 15:11:11,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:11,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:11,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:11,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:11,872 INFO L87 Difference]: Start difference. First operand 1840 states and 2456 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:12,038 INFO L93 Difference]: Finished difference Result 3830 states and 5194 transitions. [2024-10-12 15:11:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:12,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 519 [2024-10-12 15:11:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:12,046 INFO L225 Difference]: With dead ends: 3830 [2024-10-12 15:11:12,046 INFO L226 Difference]: Without dead ends: 2015 [2024-10-12 15:11:12,048 INFO L431 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 [2024-10-12 15:11:12,049 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:12,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 381 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-10-12 15:11:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 2015. [2024-10-12 15:11:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 2014 states have (on average 1.3187686196623634) internal successors, (2656), 2014 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2656 transitions. [2024-10-12 15:11:12,088 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2656 transitions. Word has length 519 [2024-10-12 15:11:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:12,089 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 2656 transitions. [2024-10-12 15:11:12,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2656 transitions. [2024-10-12 15:11:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2024-10-12 15:11:12,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:12,093 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:12,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 15:11:12,094 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:12,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:12,095 INFO L85 PathProgramCache]: Analyzing trace with hash 855549795, now seen corresponding path program 1 times [2024-10-12 15:11:12,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:12,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413572617] [2024-10-12 15:11:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2024-10-12 15:11:12,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:12,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413572617] [2024-10-12 15:11:12,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413572617] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:12,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435410688] [2024-10-12 15:11:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:12,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:12,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:12,342 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:12,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:11:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:12,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:11:12,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2024-10-12 15:11:12,653 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2024-10-12 15:11:12,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435410688] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:12,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:12,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-12 15:11:12,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657609952] [2024-10-12 15:11:12,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:12,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 15:11:12,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:12,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 15:11:12,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:11:12,745 INFO L87 Difference]: Start difference. First operand 2015 states and 2656 transitions. Second operand has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:13,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:13,207 INFO L93 Difference]: Finished difference Result 2879 states and 3810 transitions. [2024-10-12 15:11:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:11:13,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 0 states have call successors, (0), 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 583 [2024-10-12 15:11:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:13,209 INFO L225 Difference]: With dead ends: 2879 [2024-10-12 15:11:13,209 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:11:13,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1174 GetRequests, 1165 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 15:11:13,212 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 191 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:13,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1431 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:11:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:11:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:11:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:11:13,214 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 583 [2024-10-12 15:11:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:13,214 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:11:13,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:11:13,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:11:13,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:11:13,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:13,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-12 15:11:13,426 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:13,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:11:13,899 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:11:13,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:11:13 BoogieIcfgContainer [2024-10-12 15:11:13,917 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:11:13,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:11:13,920 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:11:13,921 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:11:13,921 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:05" (3/4) ... [2024-10-12 15:11:13,923 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:11:13,942 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-12 15:11:13,943 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 15:11:13,945 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:11:13,946 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:11:14,089 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:11:14,090 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:11:14,090 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:11:14,090 INFO L158 Benchmark]: Toolchain (without parser) took 10407.66ms. Allocated memory was 167.8MB in the beginning and 323.0MB in the end (delta: 155.2MB). Free memory was 95.8MB in the beginning and 255.3MB in the end (delta: -159.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:11:14,091 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 167.8MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:11:14,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.66ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 135.2MB in the end (delta: -39.7MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-10-12 15:11:14,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.03ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 136.4MB in the end (delta: -1.2MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2024-10-12 15:11:14,092 INFO L158 Benchmark]: Boogie Preprocessor took 66.05ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 132.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 15:11:14,092 INFO L158 Benchmark]: RCFGBuilder took 922.41ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 85.1MB in the end (delta: 47.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-12 15:11:14,092 INFO L158 Benchmark]: TraceAbstraction took 8680.96ms. Allocated memory was 167.8MB in the beginning and 323.0MB in the end (delta: 155.2MB). Free memory was 85.1MB in the beginning and 265.8MB in the end (delta: -180.8MB). Peak memory consumption was 110.6MB. Max. memory is 16.1GB. [2024-10-12 15:11:14,093 INFO L158 Benchmark]: Witness Printer took 169.67ms. Allocated memory is still 323.0MB. Free memory was 265.8MB in the beginning and 255.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 15:11:14,094 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.26ms. Allocated memory is still 167.8MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.66ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 135.2MB in the end (delta: -39.7MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.03ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 136.4MB in the end (delta: -1.2MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.05ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 132.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 922.41ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 85.1MB in the end (delta: 47.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8680.96ms. Allocated memory was 167.8MB in the beginning and 323.0MB in the end (delta: 155.2MB). Free memory was 85.1MB in the beginning and 265.8MB in the end (delta: -180.8MB). Peak memory consumption was 110.6MB. Max. memory is 16.1GB. * Witness Printer took 169.67ms. Allocated memory is still 323.0MB. Free memory was 265.8MB in the beginning and 255.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 681]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 160 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 20, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1461 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1461 mSDsluCounter, 10059 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4828 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2787 IncrementalHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 5231 mSDtfsCounter, 2787 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1960 GetRequests, 1925 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2015occurred in iteration=19, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 638 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 5329 NumberOfCodeBlocks, 5329 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6250 ConstructedInterpolants, 0 QuantifiedInterpolants, 8217 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1459 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 24854/25004 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((8464 == s__state) && (blastFlag == 0)) || ((2 == blastFlag) && (8560 == s__state))) || ((2 == blastFlag) && (s__state == 8512))) || ((2 == blastFlag) && (0 != s__hit))) || ((2 == blastFlag) && (8544 == s__state))) || (((s__state == 8656) && (2 == blastFlag)) && (s__s3__tmp__next_state___0 <= 8576))) || (((3 == blastFlag) && (s__state == 8672)) && (s__s3__tmp__next_state___0 <= 8576))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || ((3 == blastFlag) && (0 != s__hit))) || (s__state == 3)) || (((2 == blastFlag) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8655))) || ((8496 == s__state) && (blastFlag == 1))) || ((s__state == 8528) && (2 == blastFlag))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:11:14,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE