./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/eca-rers2012/Problem13_label21.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 14f7b86bfc883455824a54ae68bb832997924960967cf306b251b3f457d9ff4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:12:08,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:12:08,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:12:08,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:12:08,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:12:08,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:12:08,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:12:08,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:12:08,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:12:08,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:12:08,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:12:08,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:12:08,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:12:08,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:12:08,748 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:12:08,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:12:08,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:12:08,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:12:08,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:12:08,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:12:08,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:12:08,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:12:08,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:12:08,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:12:08,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:12:08,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:12:08,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:12:08,754 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:12:08,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:12:08,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:12:08,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:12:08,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:12:08,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:12:08,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:12:08,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:12:08,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:12:08,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:12:08,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:12:08,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:12:08,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:12:08,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:12:08,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:12:08,758 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 -> 14f7b86bfc883455824a54ae68bb832997924960967cf306b251b3f457d9ff4b [2024-10-23 21:12:09,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:12:09,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:12:09,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:12:09,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:12:09,042 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:12:09,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label21.c [2024-10-23 21:12:10,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:12:10,950 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:12:10,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label21.c [2024-10-23 21:12:10,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c8399fb/7308644a504b4f1b936c24b38f3cb536/FLAG9d6a0accf [2024-10-23 21:12:11,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c8399fb/7308644a504b4f1b936c24b38f3cb536 [2024-10-23 21:12:11,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:12:11,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:12:11,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:12:11,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:12:11,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:12:11,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:12:11" (1/1) ... [2024-10-23 21:12:11,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b685cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:11, skipping insertion in model container [2024-10-23 21:12:11,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:12:11" (1/1) ... [2024-10-23 21:12:11,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:12:11,437 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/eca-rers2012/Problem13_label21.c[3130,3143] [2024-10-23 21:12:12,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:12:12,278 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:12:12,294 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/eca-rers2012/Problem13_label21.c[3130,3143] [2024-10-23 21:12:12,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:12:12,881 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:12:12,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12 WrapperNode [2024-10-23 21:12:12,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:12:12,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:12:12,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:12:12,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:12:12,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (1/1) ... [2024-10-23 21:12:12,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (1/1) ... [2024-10-23 21:12:13,582 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-23 21:12:13,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:12:13,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:12:13,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:12:13,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:12:13,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (1/1) ... [2024-10-23 21:12:13,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (1/1) ... [2024-10-23 21:12:13,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (1/1) ... [2024-10-23 21:12:14,028 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-23 21:12:14,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (1/1) ... [2024-10-23 21:12:14,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (1/1) ... [2024-10-23 21:12:14,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (1/1) ... [2024-10-23 21:12:14,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (1/1) ... [2024-10-23 21:12:14,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (1/1) ... [2024-10-23 21:12:14,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (1/1) ... [2024-10-23 21:12:14,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:12:14,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:12:14,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:12:14,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:12:14,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (1/1) ... [2024-10-23 21:12:14,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:12:14,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:12:14,434 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-23 21:12:14,438 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-23 21:12:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:12:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:12:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:12:14,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:12:14,600 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:12:14,602 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:12:20,182 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-23 21:12:20,182 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:12:20,254 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:12:20,254 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:12:20,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:12:20 BoogieIcfgContainer [2024-10-23 21:12:20,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:12:20,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:12:20,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:12:20,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:12:20,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:12:11" (1/3) ... [2024-10-23 21:12:20,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6c05f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:12:20, skipping insertion in model container [2024-10-23 21:12:20,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:12:12" (2/3) ... [2024-10-23 21:12:20,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6c05f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:12:20, skipping insertion in model container [2024-10-23 21:12:20,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:12:20" (3/3) ... [2024-10-23 21:12:20,264 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label21.c [2024-10-23 21:12:20,281 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:12:20,281 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:12:20,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:12:20,389 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;@d0fe112, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:12:20,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:12:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 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-23 21:12:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-23 21:12:20,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:12:20,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:12:20,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:12:20,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:12:20,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2045375979, now seen corresponding path program 1 times [2024-10-23 21:12:20,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:12:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864421488] [2024-10-23 21:12:20,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:12:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:12:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:12:20,579 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-23 21:12:20,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:12:20,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864421488] [2024-10-23 21:12:20,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864421488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:12:20,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:12:20,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:12:20,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247766231] [2024-10-23 21:12:20,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:12:20,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:12:20,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:12:20,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:12:20,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:12:20,617 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-23 21:12:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:12:20,724 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-23 21:12:20,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:12:20,728 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-23 21:12:20,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:12:20,751 INFO L225 Difference]: With dead ends: 2071 [2024-10-23 21:12:20,751 INFO L226 Difference]: Without dead ends: 1034 [2024-10-23 21:12:20,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:12:20,765 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:12:20,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:12:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-23 21:12:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-23 21:12:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 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-23 21:12:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-23 21:12:20,861 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 19 [2024-10-23 21:12:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:12:20,861 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-23 21:12:20,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-23 21:12:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-23 21:12:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-23 21:12:20,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:12:20,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:12:20,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:12:20,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:12:20,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:12:20,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1708316331, now seen corresponding path program 1 times [2024-10-23 21:12:20,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:12:20,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990775021] [2024-10-23 21:12:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:12:20,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:12:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:12:20,997 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-23 21:12:20,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:12:20,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990775021] [2024-10-23 21:12:20,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990775021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:12:20,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:12:20,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:12:20,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833587421] [2024-10-23 21:12:20,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:12:20,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:12:21,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:12:21,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:12:21,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:12:21,002 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-23 21:12:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:12:25,324 INFO L93 Difference]: Finished difference Result 2976 states and 5471 transitions. [2024-10-23 21:12:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:12:25,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-23 21:12:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:12:25,333 INFO L225 Difference]: With dead ends: 2976 [2024-10-23 21:12:25,333 INFO L226 Difference]: Without dead ends: 1943 [2024-10-23 21:12:25,336 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-23 21:12:25,338 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 935 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:12:25,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 538 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-23 21:12:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-10-23 21:12:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1872. [2024-10-23 21:12:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.7397113842864778) internal successors, (3255), 1871 states have internal predecessors, (3255), 0 states have call successors, (0), 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-23 21:12:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3255 transitions. [2024-10-23 21:12:25,391 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3255 transitions. Word has length 19 [2024-10-23 21:12:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:12:25,392 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 3255 transitions. [2024-10-23 21:12:25,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-23 21:12:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3255 transitions. [2024-10-23 21:12:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-23 21:12:25,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:12:25,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:12:25,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:12:25,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:12:25,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:12:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash -873867679, now seen corresponding path program 1 times [2024-10-23 21:12:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:12:25,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045954447] [2024-10-23 21:12:25,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:12:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:12:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:12:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:12:25,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:12:25,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045954447] [2024-10-23 21:12:25,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045954447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:12:25,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:12:25,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:12:25,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819044976] [2024-10-23 21:12:25,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:12:25,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:12:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:12:25,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:12:25,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:12:25,640 INFO L87 Difference]: Start difference. First operand 1872 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 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-23 21:12:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:12:29,031 INFO L93 Difference]: Finished difference Result 5350 states and 9368 transitions. [2024-10-23 21:12:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:12:29,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 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 84 [2024-10-23 21:12:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:12:29,044 INFO L225 Difference]: With dead ends: 5350 [2024-10-23 21:12:29,045 INFO L226 Difference]: Without dead ends: 3479 [2024-10-23 21:12:29,048 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-23 21:12:29,053 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:12:29,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1077 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-23 21:12:29,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2024-10-23 21:12:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3478. [2024-10-23 21:12:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3477 states have (on average 1.5188380788035662) internal successors, (5281), 3477 states have internal predecessors, (5281), 0 states have call successors, (0), 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-23 21:12:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 5281 transitions. [2024-10-23 21:12:29,118 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 5281 transitions. Word has length 84 [2024-10-23 21:12:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:12:29,119 INFO L471 AbstractCegarLoop]: Abstraction has 3478 states and 5281 transitions. [2024-10-23 21:12:29,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 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-23 21:12:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 5281 transitions. [2024-10-23 21:12:29,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-23 21:12:29,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:12:29,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:12:29,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:12:29,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:12:29,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:12:29,125 INFO L85 PathProgramCache]: Analyzing trace with hash -790808676, now seen corresponding path program 1 times [2024-10-23 21:12:29,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:12:29,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592319353] [2024-10-23 21:12:29,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:12:29,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:12:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:12:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:12:29,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:12:29,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592319353] [2024-10-23 21:12:29,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592319353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:12:29,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:12:29,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:12:29,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223766654] [2024-10-23 21:12:29,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:12:29,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:12:29,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:12:29,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:12:29,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:12:29,286 INFO L87 Difference]: Start difference. First operand 3478 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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-23 21:12:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:12:32,411 INFO L93 Difference]: Finished difference Result 10141 states and 15437 transitions. [2024-10-23 21:12:32,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:12:32,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-23 21:12:32,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:12:32,434 INFO L225 Difference]: With dead ends: 10141 [2024-10-23 21:12:32,434 INFO L226 Difference]: Without dead ends: 6664 [2024-10-23 21:12:32,442 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-23 21:12:32,443 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 976 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:12:32,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 875 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-23 21:12:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2024-10-23 21:12:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6656. [2024-10-23 21:12:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6656 states, 6655 states have (on average 1.3729526671675432) internal successors, (9137), 6655 states have internal predecessors, (9137), 0 states have call successors, (0), 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-23 21:12:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 9137 transitions. [2024-10-23 21:12:32,551 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 9137 transitions. Word has length 86 [2024-10-23 21:12:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:12:32,552 INFO L471 AbstractCegarLoop]: Abstraction has 6656 states and 9137 transitions. [2024-10-23 21:12:32,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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-23 21:12:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 9137 transitions. [2024-10-23 21:12:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-23 21:12:32,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:12:32,557 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:12:32,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:12:32,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:12:32,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:12:32,558 INFO L85 PathProgramCache]: Analyzing trace with hash 370520461, now seen corresponding path program 1 times [2024-10-23 21:12:32,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:12:32,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017314112] [2024-10-23 21:12:32,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:12:32,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:12:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:12:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:12:32,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:12:32,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017314112] [2024-10-23 21:12:32,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017314112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:12:32,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:12:32,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:12:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152153770] [2024-10-23 21:12:32,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:12:32,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:12:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:12:32,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:12:32,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:12:32,711 INFO L87 Difference]: Start difference. First operand 6656 states and 9137 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:12:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:12:35,557 INFO L93 Difference]: Finished difference Result 19636 states and 26968 transitions. [2024-10-23 21:12:35,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:12:35,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-23 21:12:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:12:35,591 INFO L225 Difference]: With dead ends: 19636 [2024-10-23 21:12:35,591 INFO L226 Difference]: Without dead ends: 12981 [2024-10-23 21:12:35,601 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-23 21:12:35,602 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 792 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:12:35,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1160 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-23 21:12:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2024-10-23 21:12:35,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 12963. [2024-10-23 21:12:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12963 states, 12962 states have (on average 1.2390834747724118) internal successors, (16061), 12962 states have internal predecessors, (16061), 0 states have call successors, (0), 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-23 21:12:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12963 states to 12963 states and 16061 transitions. [2024-10-23 21:12:35,808 INFO L78 Accepts]: Start accepts. Automaton has 12963 states and 16061 transitions. Word has length 92 [2024-10-23 21:12:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:12:35,808 INFO L471 AbstractCegarLoop]: Abstraction has 12963 states and 16061 transitions. [2024-10-23 21:12:35,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:12:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 12963 states and 16061 transitions. [2024-10-23 21:12:35,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-23 21:12:35,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:12:35,810 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:12:35,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:12:35,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:12:35,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:12:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1892637787, now seen corresponding path program 1 times [2024-10-23 21:12:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:12:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458744981] [2024-10-23 21:12:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:12:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:12:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:12:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-23 21:12:35,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:12:35,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458744981] [2024-10-23 21:12:35,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458744981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:12:35,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:12:35,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:12:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143378963] [2024-10-23 21:12:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:12:35,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:12:35,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:12:35,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:12:35,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:12:35,967 INFO L87 Difference]: Start difference. First operand 12963 states and 16061 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:12:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:12:39,272 INFO L93 Difference]: Finished difference Result 37780 states and 46951 transitions. [2024-10-23 21:12:39,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:12:39,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-10-23 21:12:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:12:39,341 INFO L225 Difference]: With dead ends: 37780 [2024-10-23 21:12:39,342 INFO L226 Difference]: Without dead ends: 24818 [2024-10-23 21:12:39,360 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-23 21:12:39,362 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 914 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2920 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 3451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:12:39,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 697 Invalid, 3451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2920 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-23 21:12:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24818 states. [2024-10-23 21:12:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24818 to 24811. [2024-10-23 21:12:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24811 states, 24810 states have (on average 1.2119709794437727) internal successors, (30069), 24810 states have internal predecessors, (30069), 0 states have call successors, (0), 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-23 21:12:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24811 states to 24811 states and 30069 transitions. [2024-10-23 21:12:39,769 INFO L78 Accepts]: Start accepts. Automaton has 24811 states and 30069 transitions. Word has length 108 [2024-10-23 21:12:39,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:12:39,769 INFO L471 AbstractCegarLoop]: Abstraction has 24811 states and 30069 transitions. [2024-10-23 21:12:39,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:12:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 24811 states and 30069 transitions. [2024-10-23 21:12:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-23 21:12:39,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:12:39,771 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:12:39,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:12:39,771 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:12:39,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:12:39,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1540503247, now seen corresponding path program 1 times [2024-10-23 21:12:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:12:39,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523487304] [2024-10-23 21:12:39,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:12:39,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:12:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:12:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:12:40,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:12:40,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523487304] [2024-10-23 21:12:40,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523487304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:12:40,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:12:40,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:12:40,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676737680] [2024-10-23 21:12:40,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:12:40,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:12:40,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:12:40,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:12:40,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:12:40,073 INFO L87 Difference]: Start difference. First operand 24811 states and 30069 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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-23 21:12:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:12:42,956 INFO L93 Difference]: Finished difference Result 44111 states and 54198 transitions. [2024-10-23 21:12:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:12:42,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2024-10-23 21:12:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:12:43,005 INFO L225 Difference]: With dead ends: 44111 [2024-10-23 21:12:43,005 INFO L226 Difference]: Without dead ends: 24820 [2024-10-23 21:12:43,024 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-23 21:12:43,025 INFO L432 NwaCegarLoop]: 1025 mSDtfsCounter, 730 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:12:43,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1209 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-23 21:12:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24820 states. [2024-10-23 21:12:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24820 to 24811. [2024-10-23 21:12:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24811 states, 24810 states have (on average 1.2105602579604997) internal successors, (30034), 24810 states have internal predecessors, (30034), 0 states have call successors, (0), 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-23 21:12:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24811 states to 24811 states and 30034 transitions. [2024-10-23 21:12:43,420 INFO L78 Accepts]: Start accepts. Automaton has 24811 states and 30034 transitions. Word has length 135 [2024-10-23 21:12:43,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:12:43,422 INFO L471 AbstractCegarLoop]: Abstraction has 24811 states and 30034 transitions. [2024-10-23 21:12:43,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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-23 21:12:43,422 INFO L276 IsEmpty]: Start isEmpty. Operand 24811 states and 30034 transitions. [2024-10-23 21:12:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-23 21:12:43,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:12:43,429 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 21:12:43,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:12:43,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:12:43,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:12:43,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1808815860, now seen corresponding path program 1 times [2024-10-23 21:12:43,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:12:43,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916447770] [2024-10-23 21:12:43,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:12:43,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:12:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:12:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:12:43,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:12:43,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916447770] [2024-10-23 21:12:43,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916447770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:12:43,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:12:43,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:12:43,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764121987] [2024-10-23 21:12:43,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:12:43,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:12:43,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:12:43,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:12:43,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:12:43,656 INFO L87 Difference]: Start difference. First operand 24811 states and 30034 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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-23 21:12:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:12:46,853 INFO L93 Difference]: Finished difference Result 70073 states and 85508 transitions. [2024-10-23 21:12:46,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:12:46,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2024-10-23 21:12:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:12:46,924 INFO L225 Difference]: With dead ends: 70073 [2024-10-23 21:12:46,925 INFO L226 Difference]: Without dead ends: 45263 [2024-10-23 21:12:46,956 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-23 21:12:46,957 INFO L432 NwaCegarLoop]: 1847 mSDtfsCounter, 840 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:12:46,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1984 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-23 21:12:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45263 states. [2024-10-23 21:12:47,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45263 to 42892. [2024-10-23 21:12:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42892 states, 42891 states have (on average 1.1765871628080482) internal successors, (50465), 42891 states have internal predecessors, (50465), 0 states have call successors, (0), 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-23 21:12:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42892 states to 42892 states and 50465 transitions. [2024-10-23 21:12:47,611 INFO L78 Accepts]: Start accepts. Automaton has 42892 states and 50465 transitions. Word has length 233 [2024-10-23 21:12:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:12:47,612 INFO L471 AbstractCegarLoop]: Abstraction has 42892 states and 50465 transitions. [2024-10-23 21:12:47,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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-23 21:12:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 42892 states and 50465 transitions. [2024-10-23 21:12:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-23 21:12:47,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:12:47,616 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:12:47,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 21:12:47,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:12:47,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:12:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1334013812, now seen corresponding path program 1 times [2024-10-23 21:12:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:12:47,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336400905] [2024-10-23 21:12:47,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:12:47,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:12:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:12:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-10-23 21:12:48,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:12:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336400905] [2024-10-23 21:12:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336400905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:12:48,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:12:48,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:12:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554824715] [2024-10-23 21:12:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:12:48,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:12:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:12:48,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:12:48,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:12:48,038 INFO L87 Difference]: Start difference. First operand 42892 states and 50465 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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-23 21:12:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:12:51,107 INFO L93 Difference]: Finished difference Result 84996 states and 100132 transitions. [2024-10-23 21:12:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:12:51,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 248 [2024-10-23 21:12:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:12:51,354 INFO L225 Difference]: With dead ends: 84996 [2024-10-23 21:12:51,354 INFO L226 Difference]: Without dead ends: 42892 [2024-10-23 21:12:51,373 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-23 21:12:51,374 INFO L432 NwaCegarLoop]: 1064 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:12:51,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1193 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-23 21:12:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42892 states. [2024-10-23 21:12:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42892 to 42892. [2024-10-23 21:12:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42892 states, 42891 states have (on average 1.1764705882352942) internal successors, (50460), 42891 states have internal predecessors, (50460), 0 states have call successors, (0), 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-23 21:12:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42892 states to 42892 states and 50460 transitions. [2024-10-23 21:12:51,950 INFO L78 Accepts]: Start accepts. Automaton has 42892 states and 50460 transitions. Word has length 248 [2024-10-23 21:12:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:12:51,950 INFO L471 AbstractCegarLoop]: Abstraction has 42892 states and 50460 transitions. [2024-10-23 21:12:51,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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-23 21:12:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 42892 states and 50460 transitions. [2024-10-23 21:12:51,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-23 21:12:51,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:12:51,954 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-23 21:12:51,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:12:51,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:12:51,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:12:51,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1504502843, now seen corresponding path program 1 times [2024-10-23 21:12:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:12:51,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359634351] [2024-10-23 21:12:51,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:12:51,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:12:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:12:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-23 21:12:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:12:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359634351] [2024-10-23 21:12:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359634351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:12:52,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:12:52,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:12:52,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025331490] [2024-10-23 21:12:52,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:12:52,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:12:52,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:12:52,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:12:52,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:12:52,144 INFO L87 Difference]: Start difference. First operand 42892 states and 50460 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 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-23 21:12:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:12:55,882 INFO L93 Difference]: Finished difference Result 104681 states and 125380 transitions. [2024-10-23 21:12:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:12:55,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 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 255 [2024-10-23 21:12:55,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:12:55,945 INFO L225 Difference]: With dead ends: 104681 [2024-10-23 21:12:55,945 INFO L226 Difference]: Without dead ends: 62577 [2024-10-23 21:12:55,971 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-23 21:12:55,972 INFO L432 NwaCegarLoop]: 811 mSDtfsCounter, 882 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:12:55,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 928 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-23 21:12:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62577 states. [2024-10-23 21:12:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62577 to 60993. [2024-10-23 21:12:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60993 states, 60992 states have (on average 1.1660545645330536) internal successors, (71120), 60992 states have internal predecessors, (71120), 0 states have call successors, (0), 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-23 21:12:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60993 states to 60993 states and 71120 transitions. [2024-10-23 21:12:56,801 INFO L78 Accepts]: Start accepts. Automaton has 60993 states and 71120 transitions. Word has length 255 [2024-10-23 21:12:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:12:56,801 INFO L471 AbstractCegarLoop]: Abstraction has 60993 states and 71120 transitions. [2024-10-23 21:12:56,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 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-23 21:12:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 60993 states and 71120 transitions. [2024-10-23 21:12:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-23 21:12:56,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:12:56,805 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:12:56,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:12:56,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:12:56,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:12:56,807 INFO L85 PathProgramCache]: Analyzing trace with hash 682756360, now seen corresponding path program 1 times [2024-10-23 21:12:56,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:12:56,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158413133] [2024-10-23 21:12:56,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:12:56,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:12:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:12:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 35 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:12:58,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:12:58,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158413133] [2024-10-23 21:12:58,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158413133] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:12:58,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449871649] [2024-10-23 21:12:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:12:58,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:12:58,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:12:58,293 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-23 21:12:58,295 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-23 21:12:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:12:58,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:12:58,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:12:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-23 21:12:58,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:12:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449871649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:12:58,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:12:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-23 21:12:58,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952516585] [2024-10-23 21:12:58,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:12:58,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:12:58,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:12:58,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:12:58,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-23 21:12:58,515 INFO L87 Difference]: Start difference. First operand 60993 states and 71120 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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-23 21:13:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:13:01,471 INFO L93 Difference]: Finished difference Result 121196 states and 141446 transitions. [2024-10-23 21:13:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:13:01,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 260 [2024-10-23 21:13:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:13:01,534 INFO L225 Difference]: With dead ends: 121196 [2024-10-23 21:13:01,534 INFO L226 Difference]: Without dead ends: 60991 [2024-10-23 21:13:01,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-23 21:13:01,565 INFO L432 NwaCegarLoop]: 1356 mSDtfsCounter, 1187 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:13:01,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1436 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2470 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-23 21:13:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60991 states. [2024-10-23 21:13:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60991 to 60990. [2024-10-23 21:13:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60990 states, 60989 states have (on average 1.1285313745101575) internal successors, (68828), 60989 states have internal predecessors, (68828), 0 states have call successors, (0), 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-23 21:13:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60990 states to 60990 states and 68828 transitions. [2024-10-23 21:13:02,391 INFO L78 Accepts]: Start accepts. Automaton has 60990 states and 68828 transitions. Word has length 260 [2024-10-23 21:13:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:13:02,392 INFO L471 AbstractCegarLoop]: Abstraction has 60990 states and 68828 transitions. [2024-10-23 21:13:02,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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-23 21:13:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 60990 states and 68828 transitions. [2024-10-23 21:13:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-10-23 21:13:02,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:13:02,400 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 21:13:02,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 21:13:02,603 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,SelfDestructingSolverStorable10 [2024-10-23 21:13:02,604 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:13:02,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:13:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash 554785925, now seen corresponding path program 1 times [2024-10-23 21:13:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:13:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923836950] [2024-10-23 21:13:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:13:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:13:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:13:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-23 21:13:02,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:13:02,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923836950] [2024-10-23 21:13:02,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923836950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:13:02,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:13:02,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:13:02,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504171796] [2024-10-23 21:13:02,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:13:02,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:13:02,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:13:02,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:13:02,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:13:02,894 INFO L87 Difference]: Start difference. First operand 60990 states and 68828 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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-23 21:13:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:13:06,542 INFO L93 Difference]: Finished difference Result 140088 states and 159777 transitions. [2024-10-23 21:13:06,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:13:06,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 310 [2024-10-23 21:13:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:13:06,623 INFO L225 Difference]: With dead ends: 140088 [2024-10-23 21:13:06,624 INFO L226 Difference]: Without dead ends: 79886 [2024-10-23 21:13:06,638 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-23 21:13:06,639 INFO L432 NwaCegarLoop]: 1808 mSDtfsCounter, 840 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:13:06,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1950 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-23 21:13:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79886 states. [2024-10-23 21:13:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79886 to 79095. [2024-10-23 21:13:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79095 states, 79094 states have (on average 1.1100083445014792) internal successors, (87795), 79094 states have internal predecessors, (87795), 0 states have call successors, (0), 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-23 21:13:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79095 states to 79095 states and 87795 transitions. [2024-10-23 21:13:07,520 INFO L78 Accepts]: Start accepts. Automaton has 79095 states and 87795 transitions. Word has length 310 [2024-10-23 21:13:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:13:07,520 INFO L471 AbstractCegarLoop]: Abstraction has 79095 states and 87795 transitions. [2024-10-23 21:13:07,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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-23 21:13:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 79095 states and 87795 transitions. [2024-10-23 21:13:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-10-23 21:13:07,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:13:07,525 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:13:07,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 21:13:07,525 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:13:07,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:13:07,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1195026524, now seen corresponding path program 1 times [2024-10-23 21:13:07,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:13:07,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32839960] [2024-10-23 21:13:07,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:13:07,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:13:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:13:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 167 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-23 21:13:08,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:13:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32839960] [2024-10-23 21:13:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32839960] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:13:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969983744] [2024-10-23 21:13:08,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:13:08,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:13:08,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:13:08,875 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-23 21:13:08,877 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-23 21:13:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:13:09,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:13:09,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:13:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-23 21:13:09,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:13:09,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969983744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:13:09,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:13:09,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-23 21:13:09,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000234580] [2024-10-23 21:13:09,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:13:09,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:13:09,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:13:09,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:13:09,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:13:09,141 INFO L87 Difference]: Start difference. First operand 79095 states and 87795 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-23 21:13:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:13:12,194 INFO L93 Difference]: Finished difference Result 157393 states and 174789 transitions. [2024-10-23 21:13:12,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:13:12,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 325 [2024-10-23 21:13:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:13:12,269 INFO L225 Difference]: With dead ends: 157393 [2024-10-23 21:13:12,269 INFO L226 Difference]: Without dead ends: 79086 [2024-10-23 21:13:12,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:13:12,292 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 1073 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:13:12,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 809 Invalid, 2921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-23 21:13:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79086 states. [2024-10-23 21:13:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79086 to 79085. [2024-10-23 21:13:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79085 states, 79084 states have (on average 1.0809013201153204) internal successors, (85482), 79084 states have internal predecessors, (85482), 0 states have call successors, (0), 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-23 21:13:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79085 states to 79085 states and 85482 transitions. [2024-10-23 21:13:13,209 INFO L78 Accepts]: Start accepts. Automaton has 79085 states and 85482 transitions. Word has length 325 [2024-10-23 21:13:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:13:13,209 INFO L471 AbstractCegarLoop]: Abstraction has 79085 states and 85482 transitions. [2024-10-23 21:13:13,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-23 21:13:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 79085 states and 85482 transitions. [2024-10-23 21:13:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-10-23 21:13:13,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:13:13,216 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:13:13,232 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-23 21:13:13,419 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,SelfDestructingSolverStorable12 [2024-10-23 21:13:13,420 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:13:13,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:13:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash -281232766, now seen corresponding path program 1 times [2024-10-23 21:13:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:13:13,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617223707] [2024-10-23 21:13:13,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:13:13,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:13:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:13:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-23 21:13:14,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:13:14,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617223707] [2024-10-23 21:13:14,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617223707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:13:14,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:13:14,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:13:14,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303700611] [2024-10-23 21:13:14,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:13:14,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:13:14,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:13:14,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:13:14,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:13:14,049 INFO L87 Difference]: Start difference. First operand 79085 states and 85482 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-23 21:13:20,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:13:20,621 INFO L93 Difference]: Finished difference Result 221340 states and 239936 transitions. [2024-10-23 21:13:20,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:13:20,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 367 [2024-10-23 21:13:20,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:13:20,761 INFO L225 Difference]: With dead ends: 221340 [2024-10-23 21:13:20,761 INFO L226 Difference]: Without dead ends: 143043 [2024-10-23 21:13:20,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:13:20,791 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 1707 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 6621 mSolverCounterSat, 1039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 7660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 6621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:13:20,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 783 Invalid, 7660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 6621 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-23 21:13:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143043 states. [2024-10-23 21:13:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143043 to 139765. [2024-10-23 21:13:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139765 states, 139764 states have (on average 1.0780530036346985) internal successors, (150673), 139764 states have internal predecessors, (150673), 0 states have call successors, (0), 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-23 21:13:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139765 states to 139765 states and 150673 transitions. [2024-10-23 21:13:22,579 INFO L78 Accepts]: Start accepts. Automaton has 139765 states and 150673 transitions. Word has length 367 [2024-10-23 21:13:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:13:22,579 INFO L471 AbstractCegarLoop]: Abstraction has 139765 states and 150673 transitions. [2024-10-23 21:13:22,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-23 21:13:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 139765 states and 150673 transitions. [2024-10-23 21:13:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-10-23 21:13:22,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:13:22,584 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:13:22,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 21:13:22,584 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:13:22,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:13:22,584 INFO L85 PathProgramCache]: Analyzing trace with hash -467210533, now seen corresponding path program 1 times [2024-10-23 21:13:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:13:22,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587593892] [2024-10-23 21:13:22,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:13:22,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:13:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:13:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 251 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-23 21:13:23,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:13:23,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587593892] [2024-10-23 21:13:23,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587593892] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:13:23,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929387946] [2024-10-23 21:13:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:13:23,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:13:23,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:13:23,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:13:23,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 21:13:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:13:24,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:13:24,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:13:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-23 21:13:24,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:13:24,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929387946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:13:24,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:13:24,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-23 21:13:24,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120344616] [2024-10-23 21:13:24,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:13:24,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:13:24,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:13:24,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:13:24,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:13:24,377 INFO L87 Difference]: Start difference. First operand 139765 states and 150673 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)