./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 fdba2ae989c969b8ea983da7229bdc32604e4ef890fc1d03498078fc576fe644 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:56:17,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:56:17,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:56:17,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:56:17,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:56:17,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:56:17,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:56:17,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:56:17,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:56:17,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:56:17,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:56:17,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:56:17,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:56:17,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:56:17,147 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:56:17,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:56:17,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:56:17,148 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:56:17,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:56:17,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:56:17,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:56:17,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:56:17,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:56:17,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:56:17,152 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:56:17,152 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:56:17,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:56:17,152 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:56:17,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:56:17,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:56:17,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:56:17,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:56:17,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:56:17,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:56:17,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:56:17,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:56:17,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:56:17,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:56:17,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:56:17,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:56:17,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:56:17,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:56:17,157 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-clean/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-clean/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 -> fdba2ae989c969b8ea983da7229bdc32604e4ef890fc1d03498078fc576fe644 [2024-10-11 04:56:17,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:56:17,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:56:17,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:56:17,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:56:17,495 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:56:17,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-10-11 04:56:18,996 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:56:19,486 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:56:19,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-10-11 04:56:19,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/18a07f485/001c0d161c07449b8082dfffad9fda44/FLAGed3a8ff27 [2024-10-11 04:56:19,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/18a07f485/001c0d161c07449b8082dfffad9fda44 [2024-10-11 04:56:19,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:56:19,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:56:19,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:56:19,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:56:19,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:56:19,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:56:19" (1/1) ... [2024-10-11 04:56:19,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee458c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:19, skipping insertion in model container [2024-10-11 04:56:19,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:56:19" (1/1) ... [2024-10-11 04:56:19,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:56:20,171 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/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c[20454,20467] [2024-10-11 04:56:20,199 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/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c[21296,21309] [2024-10-11 04:56:20,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:56:20,868 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:56:20,913 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/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c[20454,20467] [2024-10-11 04:56:20,915 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/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c[21296,21309] [2024-10-11 04:56:21,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:56:21,363 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:56:21,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21 WrapperNode [2024-10-11 04:56:21,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:56:21,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:56:21,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:56:21,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:56:21,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (1/1) ... [2024-10-11 04:56:21,427 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (1/1) ... [2024-10-11 04:56:21,791 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5219 [2024-10-11 04:56:21,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:56:21,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:56:21,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:56:21,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:56:21,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (1/1) ... [2024-10-11 04:56:21,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (1/1) ... [2024-10-11 04:56:21,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (1/1) ... [2024-10-11 04:56:22,079 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-11 04:56:22,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (1/1) ... [2024-10-11 04:56:22,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (1/1) ... [2024-10-11 04:56:22,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (1/1) ... [2024-10-11 04:56:22,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (1/1) ... [2024-10-11 04:56:22,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (1/1) ... [2024-10-11 04:56:22,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (1/1) ... [2024-10-11 04:56:22,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:56:22,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:56:22,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:56:22,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:56:22,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (1/1) ... [2024-10-11 04:56:22,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:56:22,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:56:22,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:56:22,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:56:22,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:56:22,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:56:22,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:56:22,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:56:22,593 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:56:22,596 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:56:27,331 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-10-11 04:56:27,331 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:56:27,412 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:56:27,415 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:56:27,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:56:27 BoogieIcfgContainer [2024-10-11 04:56:27,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:56:27,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:56:27,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:56:27,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:56:27,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:56:19" (1/3) ... [2024-10-11 04:56:27,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259c8d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:56:27, skipping insertion in model container [2024-10-11 04:56:27,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:21" (2/3) ... [2024-10-11 04:56:27,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259c8d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:56:27, skipping insertion in model container [2024-10-11 04:56:27,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:56:27" (3/3) ... [2024-10-11 04:56:27,426 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-10-11 04:56:27,444 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:56:27,444 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:56:27,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:56:27,557 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;@5ee68bb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:56:27,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:56:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 867 states, 864 states have (on average 1.9710648148148149) internal successors, (1703), 866 states have internal predecessors, (1703), 0 states have call successors, (0), 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-11 04:56:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 04:56:27,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:27,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 04:56:27,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:27,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1750769947, now seen corresponding path program 1 times [2024-10-11 04:56:27,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740056676] [2024-10-11 04:56:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:27,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:27,830 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-11 04:56:27,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:27,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740056676] [2024-10-11 04:56:27,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740056676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:27,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:27,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:56:27,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208238380] [2024-10-11 04:56:27,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:27,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:27,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:27,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:27,864 INFO L87 Difference]: Start difference. First operand has 867 states, 864 states have (on average 1.9710648148148149) internal successors, (1703), 866 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-11 04:56:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:31,071 INFO L93 Difference]: Finished difference Result 2433 states and 4800 transitions. [2024-10-11 04:56:31,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:31,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 04:56:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:31,096 INFO L225 Difference]: With dead ends: 2433 [2024-10-11 04:56:31,096 INFO L226 Difference]: Without dead ends: 1614 [2024-10-11 04:56:31,102 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-11 04:56:31,105 INFO L432 NwaCegarLoop]: 613 mSDtfsCounter, 1008 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:31,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 622 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 04:56:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2024-10-11 04:56:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2024-10-11 04:56:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1612 states have (on average 1.6495037220843674) internal successors, (2659), 1613 states have internal predecessors, (2659), 0 states have call successors, (0), 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-11 04:56:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2659 transitions. [2024-10-11 04:56:31,219 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2659 transitions. Word has length 6 [2024-10-11 04:56:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:31,219 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2659 transitions. [2024-10-11 04:56:31,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-11 04:56:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2659 transitions. [2024-10-11 04:56:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 04:56:31,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:31,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:31,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:56:31,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:31,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1401331215, now seen corresponding path program 1 times [2024-10-11 04:56:31,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:31,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809027438] [2024-10-11 04:56:31,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:31,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:31,492 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-11 04:56:31,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:31,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809027438] [2024-10-11 04:56:31,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809027438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:31,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:31,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:56:31,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495253938] [2024-10-11 04:56:31,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:31,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:56:31,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:31,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:56:31,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:56:31,500 INFO L87 Difference]: Start difference. First operand 1614 states and 2659 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-11 04:56:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:31,592 INFO L93 Difference]: Finished difference Result 1672 states and 2751 transitions. [2024-10-11 04:56:31,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:56:31,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-11 04:56:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:31,599 INFO L225 Difference]: With dead ends: 1672 [2024-10-11 04:56:31,600 INFO L226 Difference]: Without dead ends: 1614 [2024-10-11 04:56:31,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:56:31,602 INFO L432 NwaCegarLoop]: 1629 mSDtfsCounter, 0 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4833 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:31,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4833 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:56:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2024-10-11 04:56:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2024-10-11 04:56:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1612 states have (on average 1.61848635235732) internal successors, (2609), 1613 states have internal predecessors, (2609), 0 states have call successors, (0), 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-11 04:56:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2609 transitions. [2024-10-11 04:56:31,687 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2609 transitions. Word has length 25 [2024-10-11 04:56:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:31,688 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2609 transitions. [2024-10-11 04:56:31,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-11 04:56:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2609 transitions. [2024-10-11 04:56:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 04:56:31,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:31,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:56:31,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:56:31,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:31,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:31,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1958226728, now seen corresponding path program 1 times [2024-10-11 04:56:31,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:31,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450628903] [2024-10-11 04:56:31,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:31,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:32,017 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-11 04:56:32,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:32,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450628903] [2024-10-11 04:56:32,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450628903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:32,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:32,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:56:32,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738978463] [2024-10-11 04:56:32,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:32,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:56:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:32,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:56:32,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:56:32,021 INFO L87 Difference]: Start difference. First operand 1614 states and 2609 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 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-11 04:56:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:32,467 INFO L93 Difference]: Finished difference Result 2384 states and 3855 transitions. [2024-10-11 04:56:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:56:32,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-11 04:56:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:32,478 INFO L225 Difference]: With dead ends: 2384 [2024-10-11 04:56:32,478 INFO L226 Difference]: Without dead ends: 2329 [2024-10-11 04:56:32,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-10-11 04:56:32,482 INFO L432 NwaCegarLoop]: 1573 mSDtfsCounter, 11585 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11585 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:32,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11585 Valid, 4253 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:56:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2024-10-11 04:56:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1667. [2024-10-11 04:56:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.6186186186186187) internal successors, (2695), 1666 states have internal predecessors, (2695), 0 states have call successors, (0), 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-11 04:56:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2695 transitions. [2024-10-11 04:56:32,524 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2695 transitions. Word has length 74 [2024-10-11 04:56:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:32,528 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2695 transitions. [2024-10-11 04:56:32,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 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-11 04:56:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2695 transitions. [2024-10-11 04:56:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 04:56:32,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:32,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:56:32,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:56:32,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:32,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:32,533 INFO L85 PathProgramCache]: Analyzing trace with hash -783812792, now seen corresponding path program 1 times [2024-10-11 04:56:32,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:32,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872196329] [2024-10-11 04:56:32,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:32,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:32,646 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-11 04:56:32,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:32,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872196329] [2024-10-11 04:56:32,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872196329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:32,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334409686] [2024-10-11 04:56:32,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:32,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:32,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:32,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:32,648 INFO L87 Difference]: Start difference. First operand 1667 states and 2695 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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-11 04:56:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:32,692 INFO L93 Difference]: Finished difference Result 1872 states and 3026 transitions. [2024-10-11 04:56:32,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:32,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-11 04:56:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:32,699 INFO L225 Difference]: With dead ends: 1872 [2024-10-11 04:56:32,699 INFO L226 Difference]: Without dead ends: 1764 [2024-10-11 04:56:32,700 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-11 04:56:32,701 INFO L432 NwaCegarLoop]: 1575 mSDtfsCounter, 1498 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:32,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1656 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:32,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2024-10-11 04:56:32,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1760. [2024-10-11 04:56:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1758 states have (on average 1.617178612059158) internal successors, (2843), 1759 states have internal predecessors, (2843), 0 states have call successors, (0), 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-11 04:56:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2843 transitions. [2024-10-11 04:56:32,740 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2843 transitions. Word has length 76 [2024-10-11 04:56:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:32,741 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2843 transitions. [2024-10-11 04:56:32,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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-11 04:56:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2843 transitions. [2024-10-11 04:56:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 04:56:32,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:32,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:56:32,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:56:32,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:32,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:32,744 INFO L85 PathProgramCache]: Analyzing trace with hash -781667840, now seen corresponding path program 1 times [2024-10-11 04:56:32,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:32,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175812497] [2024-10-11 04:56:32,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:32,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:33,158 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-11 04:56:33,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:33,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175812497] [2024-10-11 04:56:33,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175812497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:33,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:33,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:56:33,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681418300] [2024-10-11 04:56:33,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:33,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:56:33,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:33,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:56:33,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:56:33,161 INFO L87 Difference]: Start difference. First operand 1760 states and 2843 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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-11 04:56:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:33,509 INFO L93 Difference]: Finished difference Result 1963 states and 3167 transitions. [2024-10-11 04:56:33,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:56:33,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-11 04:56:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:33,518 INFO L225 Difference]: With dead ends: 1963 [2024-10-11 04:56:33,518 INFO L226 Difference]: Without dead ends: 1762 [2024-10-11 04:56:33,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-11 04:56:33,521 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 4560 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4560 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:33,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4560 Valid, 2084 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:56:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2024-10-11 04:56:33,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1760. [2024-10-11 04:56:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1758 states have (on average 1.6160409556313993) internal successors, (2841), 1759 states have internal predecessors, (2841), 0 states have call successors, (0), 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-11 04:56:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2841 transitions. [2024-10-11 04:56:33,563 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2841 transitions. Word has length 76 [2024-10-11 04:56:33,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:33,564 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2841 transitions. [2024-10-11 04:56:33,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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-11 04:56:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2841 transitions. [2024-10-11 04:56:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 04:56:33,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:33,566 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:56:33,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:56:33,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:33,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash -948794983, now seen corresponding path program 1 times [2024-10-11 04:56:33,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:33,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417132254] [2024-10-11 04:56:33,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:33,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 04:56:33,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417132254] [2024-10-11 04:56:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417132254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:33,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:33,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:56:33,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466095521] [2024-10-11 04:56:33,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:33,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:33,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:33,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:33,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:33,666 INFO L87 Difference]: Start difference. First operand 1760 states and 2841 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:36,754 INFO L93 Difference]: Finished difference Result 4766 states and 7768 transitions. [2024-10-11 04:56:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:36,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-11 04:56:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:36,768 INFO L225 Difference]: With dead ends: 4766 [2024-10-11 04:56:36,768 INFO L226 Difference]: Without dead ends: 3262 [2024-10-11 04:56:36,771 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-11 04:56:36,772 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 869 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:36,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 615 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 04:56:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-10-11 04:56:36,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2024-10-11 04:56:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3262 states, 3260 states have (on average 1.429754601226994) internal successors, (4661), 3261 states have internal predecessors, (4661), 0 states have call successors, (0), 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-11 04:56:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4661 transitions. [2024-10-11 04:56:36,836 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4661 transitions. Word has length 77 [2024-10-11 04:56:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:36,836 INFO L471 AbstractCegarLoop]: Abstraction has 3262 states and 4661 transitions. [2024-10-11 04:56:36,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4661 transitions. [2024-10-11 04:56:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 04:56:36,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:36,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:56:36,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:56:36,838 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:36,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:36,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1409717390, now seen corresponding path program 1 times [2024-10-11 04:56:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:36,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625342721] [2024-10-11 04:56:36,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:36,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:37,023 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-11 04:56:37,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625342721] [2024-10-11 04:56:37,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625342721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:37,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:37,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:56:37,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560046169] [2024-10-11 04:56:37,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:37,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:56:37,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:37,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:56:37,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:56:37,027 INFO L87 Difference]: Start difference. First operand 3262 states and 4661 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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-11 04:56:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:37,066 INFO L93 Difference]: Finished difference Result 3268 states and 4668 transitions. [2024-10-11 04:56:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:56:37,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-11 04:56:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:37,079 INFO L225 Difference]: With dead ends: 3268 [2024-10-11 04:56:37,079 INFO L226 Difference]: Without dead ends: 3266 [2024-10-11 04:56:37,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:56:37,083 INFO L432 NwaCegarLoop]: 1578 mSDtfsCounter, 0 mSDsluCounter, 3148 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4726 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:37,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4726 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:37,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2024-10-11 04:56:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2024-10-11 04:56:37,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3264 states have (on average 1.428921568627451) internal successors, (4664), 3265 states have internal predecessors, (4664), 0 states have call successors, (0), 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-11 04:56:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4664 transitions. [2024-10-11 04:56:37,141 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4664 transitions. Word has length 77 [2024-10-11 04:56:37,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:37,142 INFO L471 AbstractCegarLoop]: Abstraction has 3266 states and 4664 transitions. [2024-10-11 04:56:37,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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-11 04:56:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4664 transitions. [2024-10-11 04:56:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:37,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:37,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:56:37,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:56:37,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:37,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash 89162976, now seen corresponding path program 1 times [2024-10-11 04:56:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231534094] [2024-10-11 04:56:37,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:37,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:37,210 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-11 04:56:37,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231534094] [2024-10-11 04:56:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231534094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:37,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:37,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442264549] [2024-10-11 04:56:37,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:37,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:37,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:37,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:37,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:37,212 INFO L87 Difference]: Start difference. First operand 3266 states and 4664 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 04:56:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:37,253 INFO L93 Difference]: Finished difference Result 3660 states and 5284 transitions. [2024-10-11 04:56:37,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:37,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 04:56:37,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:37,267 INFO L225 Difference]: With dead ends: 3660 [2024-10-11 04:56:37,267 INFO L226 Difference]: Without dead ends: 3455 [2024-10-11 04:56:37,269 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-11 04:56:37,270 INFO L432 NwaCegarLoop]: 1644 mSDtfsCounter, 1515 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:37,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1737 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:37,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3455 states. [2024-10-11 04:56:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3455 to 3453. [2024-10-11 04:56:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3453 states, 3451 states have (on average 1.4358157055925818) internal successors, (4955), 3452 states have internal predecessors, (4955), 0 states have call successors, (0), 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-11 04:56:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3453 states to 3453 states and 4955 transitions. [2024-10-11 04:56:37,371 INFO L78 Accepts]: Start accepts. Automaton has 3453 states and 4955 transitions. Word has length 78 [2024-10-11 04:56:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:37,372 INFO L471 AbstractCegarLoop]: Abstraction has 3453 states and 4955 transitions. [2024-10-11 04:56:37,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 04:56:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3453 states and 4955 transitions. [2024-10-11 04:56:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:37,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:37,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:56:37,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:56:37,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:37,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash -321223712, now seen corresponding path program 1 times [2024-10-11 04:56:37,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:37,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694373060] [2024-10-11 04:56:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:37,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:37,458 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-11 04:56:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:37,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694373060] [2024-10-11 04:56:37,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694373060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:37,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:37,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:37,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560210909] [2024-10-11 04:56:37,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:37,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:37,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:37,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:37,463 INFO L87 Difference]: Start difference. First operand 3453 states and 4955 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 04:56:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:37,521 INFO L93 Difference]: Finished difference Result 4205 states and 6129 transitions. [2024-10-11 04:56:37,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:37,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 04:56:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:37,535 INFO L225 Difference]: With dead ends: 4205 [2024-10-11 04:56:37,535 INFO L226 Difference]: Without dead ends: 3813 [2024-10-11 04:56:37,537 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-11 04:56:37,538 INFO L432 NwaCegarLoop]: 1642 mSDtfsCounter, 1513 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:37,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1739 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2024-10-11 04:56:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3811. [2024-10-11 04:56:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3811 states, 3809 states have (on average 1.44526122341822) internal successors, (5505), 3810 states have internal predecessors, (5505), 0 states have call successors, (0), 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-11 04:56:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3811 states to 3811 states and 5505 transitions. [2024-10-11 04:56:37,629 INFO L78 Accepts]: Start accepts. Automaton has 3811 states and 5505 transitions. Word has length 78 [2024-10-11 04:56:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:37,630 INFO L471 AbstractCegarLoop]: Abstraction has 3811 states and 5505 transitions. [2024-10-11 04:56:37,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 04:56:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3811 states and 5505 transitions. [2024-10-11 04:56:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:37,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:37,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:56:37,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:56:37,632 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:37,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:37,632 INFO L85 PathProgramCache]: Analyzing trace with hash -549862944, now seen corresponding path program 1 times [2024-10-11 04:56:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:37,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130373292] [2024-10-11 04:56:37,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:37,717 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-11 04:56:37,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:37,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130373292] [2024-10-11 04:56:37,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130373292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:37,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:37,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203048288] [2024-10-11 04:56:37,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:37,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:37,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:37,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:37,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:37,720 INFO L87 Difference]: Start difference. First operand 3811 states and 5505 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 04:56:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:37,799 INFO L93 Difference]: Finished difference Result 5247 states and 7723 transitions. [2024-10-11 04:56:37,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:37,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 04:56:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:37,818 INFO L225 Difference]: With dead ends: 5247 [2024-10-11 04:56:37,819 INFO L226 Difference]: Without dead ends: 4497 [2024-10-11 04:56:37,822 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-11 04:56:37,823 INFO L432 NwaCegarLoop]: 1630 mSDtfsCounter, 1509 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:37,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 1735 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:37,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2024-10-11 04:56:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 4495. [2024-10-11 04:56:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4495 states, 4493 states have (on average 1.4558201647006455) internal successors, (6541), 4494 states have internal predecessors, (6541), 0 states have call successors, (0), 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-11 04:56:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4495 states to 4495 states and 6541 transitions. [2024-10-11 04:56:37,946 INFO L78 Accepts]: Start accepts. Automaton has 4495 states and 6541 transitions. Word has length 78 [2024-10-11 04:56:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:37,946 INFO L471 AbstractCegarLoop]: Abstraction has 4495 states and 6541 transitions. [2024-10-11 04:56:37,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 04:56:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4495 states and 6541 transitions. [2024-10-11 04:56:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:37,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:37,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:56:37,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:56:37,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:37,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1175519008, now seen corresponding path program 1 times [2024-10-11 04:56:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:37,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693698482] [2024-10-11 04:56:37,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:37,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:38,023 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-11 04:56:38,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693698482] [2024-10-11 04:56:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693698482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:38,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:38,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:38,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495355038] [2024-10-11 04:56:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:38,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:38,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:38,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:38,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:38,025 INFO L87 Difference]: Start difference. First operand 4495 states and 6541 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 04:56:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:38,132 INFO L93 Difference]: Finished difference Result 7235 states and 10719 transitions. [2024-10-11 04:56:38,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:38,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 04:56:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:38,149 INFO L225 Difference]: With dead ends: 7235 [2024-10-11 04:56:38,150 INFO L226 Difference]: Without dead ends: 5801 [2024-10-11 04:56:38,154 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-11 04:56:38,155 INFO L432 NwaCegarLoop]: 1628 mSDtfsCounter, 1507 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:38,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1737 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5801 states. [2024-10-11 04:56:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5801 to 5799. [2024-10-11 04:56:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5799 states, 5797 states have (on average 1.4636881145420044) internal successors, (8485), 5798 states have internal predecessors, (8485), 0 states have call successors, (0), 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-11 04:56:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5799 states to 5799 states and 8485 transitions. [2024-10-11 04:56:38,292 INFO L78 Accepts]: Start accepts. Automaton has 5799 states and 8485 transitions. Word has length 78 [2024-10-11 04:56:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:38,294 INFO L471 AbstractCegarLoop]: Abstraction has 5799 states and 8485 transitions. [2024-10-11 04:56:38,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 04:56:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 5799 states and 8485 transitions. [2024-10-11 04:56:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:38,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:38,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:56:38,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:56:38,295 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:38,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:38,296 INFO L85 PathProgramCache]: Analyzing trace with hash -286785568, now seen corresponding path program 1 times [2024-10-11 04:56:38,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:38,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640222792] [2024-10-11 04:56:38,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:38,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:38,381 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-11 04:56:38,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:38,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640222792] [2024-10-11 04:56:38,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640222792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:38,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:38,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:38,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327331804] [2024-10-11 04:56:38,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:38,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:38,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:38,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:38,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:38,384 INFO L87 Difference]: Start difference. First operand 5799 states and 8485 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 04:56:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:38,500 INFO L93 Difference]: Finished difference Result 11019 states and 16327 transitions. [2024-10-11 04:56:38,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:38,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 04:56:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:38,518 INFO L225 Difference]: With dead ends: 11019 [2024-10-11 04:56:38,518 INFO L226 Difference]: Without dead ends: 8281 [2024-10-11 04:56:38,525 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-11 04:56:38,526 INFO L432 NwaCegarLoop]: 1626 mSDtfsCounter, 1505 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:38,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1739 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8281 states. [2024-10-11 04:56:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8281 to 8279. [2024-10-11 04:56:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8279 states, 8277 states have (on average 1.463936208771294) internal successors, (12117), 8278 states have internal predecessors, (12117), 0 states have call successors, (0), 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-11 04:56:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8279 states to 8279 states and 12117 transitions. [2024-10-11 04:56:38,707 INFO L78 Accepts]: Start accepts. Automaton has 8279 states and 12117 transitions. Word has length 78 [2024-10-11 04:56:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:38,707 INFO L471 AbstractCegarLoop]: Abstraction has 8279 states and 12117 transitions. [2024-10-11 04:56:38,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 04:56:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8279 states and 12117 transitions. [2024-10-11 04:56:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:38,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:38,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:56:38,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:56:38,709 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:38,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash -589806880, now seen corresponding path program 1 times [2024-10-11 04:56:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:38,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206634714] [2024-10-11 04:56:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:38,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:38,771 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-11 04:56:38,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:38,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206634714] [2024-10-11 04:56:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206634714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:38,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:38,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:38,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299928708] [2024-10-11 04:56:38,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:38,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:38,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:38,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:38,774 INFO L87 Difference]: Start difference. First operand 8279 states and 12117 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 04:56:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:39,008 INFO L93 Difference]: Finished difference Result 18203 states and 26775 transitions. [2024-10-11 04:56:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:39,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 04:56:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:39,038 INFO L225 Difference]: With dead ends: 18203 [2024-10-11 04:56:39,038 INFO L226 Difference]: Without dead ends: 12985 [2024-10-11 04:56:39,049 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-11 04:56:39,050 INFO L432 NwaCegarLoop]: 1640 mSDtfsCounter, 1511 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:39,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1741 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12985 states. [2024-10-11 04:56:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12985 to 12983. [2024-10-11 04:56:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12983 states, 12981 states have (on average 1.4535860103227793) internal successors, (18869), 12982 states have internal predecessors, (18869), 0 states have call successors, (0), 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-11 04:56:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12983 states to 12983 states and 18869 transitions. [2024-10-11 04:56:39,385 INFO L78 Accepts]: Start accepts. Automaton has 12983 states and 18869 transitions. Word has length 78 [2024-10-11 04:56:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:39,386 INFO L471 AbstractCegarLoop]: Abstraction has 12983 states and 18869 transitions. [2024-10-11 04:56:39,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 04:56:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 12983 states and 18869 transitions. [2024-10-11 04:56:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 04:56:39,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:39,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:56:39,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:56:39,387 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:39,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1500697979, now seen corresponding path program 1 times [2024-10-11 04:56:39,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:39,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771726742] [2024-10-11 04:56:39,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:39,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:39,452 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-11 04:56:39,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:39,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771726742] [2024-10-11 04:56:39,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771726742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:39,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:39,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:39,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489016354] [2024-10-11 04:56:39,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:39,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:39,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:39,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:39,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:39,455 INFO L87 Difference]: Start difference. First operand 12983 states and 18869 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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-11 04:56:39,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:39,717 INFO L93 Difference]: Finished difference Result 23230 states and 34107 transitions. [2024-10-11 04:56:39,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:39,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-11 04:56:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:39,756 INFO L225 Difference]: With dead ends: 23230 [2024-10-11 04:56:39,756 INFO L226 Difference]: Without dead ends: 17723 [2024-10-11 04:56:39,770 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-11 04:56:39,771 INFO L432 NwaCegarLoop]: 1649 mSDtfsCounter, 1514 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:39,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1738 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17723 states. [2024-10-11 04:56:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17723 to 17721. [2024-10-11 04:56:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17721 states, 17719 states have (on average 1.4514927478977369) internal successors, (25719), 17720 states have internal predecessors, (25719), 0 states have call successors, (0), 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-11 04:56:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17721 states to 17721 states and 25719 transitions. [2024-10-11 04:56:40,308 INFO L78 Accepts]: Start accepts. Automaton has 17721 states and 25719 transitions. Word has length 80 [2024-10-11 04:56:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:40,308 INFO L471 AbstractCegarLoop]: Abstraction has 17721 states and 25719 transitions. [2024-10-11 04:56:40,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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-11 04:56:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 17721 states and 25719 transitions. [2024-10-11 04:56:40,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:56:40,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:40,309 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:56:40,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:56:40,310 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:40,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:40,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2007488945, now seen corresponding path program 1 times [2024-10-11 04:56:40,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:40,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100778189] [2024-10-11 04:56:40,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:40,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:40,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:40,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100778189] [2024-10-11 04:56:40,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100778189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:40,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:40,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:56:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255590046] [2024-10-11 04:56:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:40,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:40,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:40,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:40,394 INFO L87 Difference]: Start difference. First operand 17721 states and 25719 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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-11 04:56:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:43,360 INFO L93 Difference]: Finished difference Result 23733 states and 34287 transitions. [2024-10-11 04:56:43,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:43,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-11 04:56:43,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:43,401 INFO L225 Difference]: With dead ends: 23733 [2024-10-11 04:56:43,401 INFO L226 Difference]: Without dead ends: 20727 [2024-10-11 04:56:43,411 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-11 04:56:43,411 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 1059 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:43,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 723 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:56:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20727 states. [2024-10-11 04:56:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20727 to 20725. [2024-10-11 04:56:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20725 states, 20723 states have (on average 1.41967861796072) internal successors, (29420), 20724 states have internal predecessors, (29420), 0 states have call successors, (0), 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-11 04:56:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20725 states to 20725 states and 29420 transitions. [2024-10-11 04:56:43,824 INFO L78 Accepts]: Start accepts. Automaton has 20725 states and 29420 transitions. Word has length 81 [2024-10-11 04:56:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:43,825 INFO L471 AbstractCegarLoop]: Abstraction has 20725 states and 29420 transitions. [2024-10-11 04:56:43,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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-11 04:56:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 20725 states and 29420 transitions. [2024-10-11 04:56:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:56:43,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:43,830 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:56:43,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:56:43,831 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:43,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1592155180, now seen corresponding path program 1 times [2024-10-11 04:56:43,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:43,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775091627] [2024-10-11 04:56:43,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:56:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:44,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775091627] [2024-10-11 04:56:44,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775091627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:44,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:44,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:56:44,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255513277] [2024-10-11 04:56:44,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:44,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:56:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:44,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:56:44,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:56:44,088 INFO L87 Difference]: Start difference. First operand 20725 states and 29420 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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-11 04:56:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:45,939 INFO L93 Difference]: Finished difference Result 126277 states and 183220 transitions. [2024-10-11 04:56:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:56:45,940 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 100 [2024-10-11 04:56:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:46,171 INFO L225 Difference]: With dead ends: 126277 [2024-10-11 04:56:46,171 INFO L226 Difference]: Without dead ends: 111619 [2024-10-11 04:56:46,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 04:56:46,218 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 9880 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9880 SdHoareTripleChecker+Valid, 4406 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:46,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9880 Valid, 4406 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:56:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111619 states. [2024-10-11 04:56:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111619 to 35381. [2024-10-11 04:56:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35381 states, 35379 states have (on average 1.4303400322225048) internal successors, (50604), 35380 states have internal predecessors, (50604), 0 states have call successors, (0), 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-11 04:56:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35381 states to 35381 states and 50604 transitions. [2024-10-11 04:56:47,860 INFO L78 Accepts]: Start accepts. Automaton has 35381 states and 50604 transitions. Word has length 100 [2024-10-11 04:56:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:47,863 INFO L471 AbstractCegarLoop]: Abstraction has 35381 states and 50604 transitions. [2024-10-11 04:56:47,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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-11 04:56:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 35381 states and 50604 transitions. [2024-10-11 04:56:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:56:47,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:47,869 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:56:47,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:56:47,869 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:47,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1181768492, now seen corresponding path program 1 times [2024-10-11 04:56:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:47,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704441126] [2024-10-11 04:56:47,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:47,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 04:56:48,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:48,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704441126] [2024-10-11 04:56:48,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704441126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:48,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:48,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:56:48,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016310878] [2024-10-11 04:56:48,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:48,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:56:48,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:48,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:56:48,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:56:48,125 INFO L87 Difference]: Start difference. First operand 35381 states and 50604 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 04:56:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:50,922 INFO L93 Difference]: Finished difference Result 140933 states and 204404 transitions. [2024-10-11 04:56:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:56:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 100 [2024-10-11 04:56:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:51,195 INFO L225 Difference]: With dead ends: 140933 [2024-10-11 04:56:51,196 INFO L226 Difference]: Without dead ends: 126275 [2024-10-11 04:56:51,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 04:56:51,248 INFO L432 NwaCegarLoop]: 1664 mSDtfsCounter, 9924 mSDsluCounter, 2610 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9924 SdHoareTripleChecker+Valid, 4274 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:51,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9924 Valid, 4274 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:56:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126275 states. [2024-10-11 04:56:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126275 to 57397. [2024-10-11 04:56:53,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57397 states, 57395 states have (on average 1.4325289659377995) internal successors, (82220), 57396 states have internal predecessors, (82220), 0 states have call successors, (0), 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-11 04:56:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57397 states to 57397 states and 82220 transitions. [2024-10-11 04:56:53,719 INFO L78 Accepts]: Start accepts. Automaton has 57397 states and 82220 transitions. Word has length 100 [2024-10-11 04:56:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:53,720 INFO L471 AbstractCegarLoop]: Abstraction has 57397 states and 82220 transitions. [2024-10-11 04:56:53,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 04:56:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 57397 states and 82220 transitions. [2024-10-11 04:56:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:56:53,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:53,727 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:56:53,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:56:53,727 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:53,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash 953129260, now seen corresponding path program 1 times [2024-10-11 04:56:53,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:53,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731479003] [2024-10-11 04:56:53,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:53,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 04:56:53,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:53,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731479003] [2024-10-11 04:56:53,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731479003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:53,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:53,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:56:53,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624487433] [2024-10-11 04:56:53,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:53,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:56:53,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:53,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:56:53,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:56:53,967 INFO L87 Difference]: Start difference. First operand 57397 states and 82220 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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-11 04:56:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:57,242 INFO L93 Difference]: Finished difference Result 155589 states and 225588 transitions. [2024-10-11 04:56:57,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:56:57,243 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 100 [2024-10-11 04:56:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:57,538 INFO L225 Difference]: With dead ends: 155589 [2024-10-11 04:56:57,538 INFO L226 Difference]: Without dead ends: 140931 [2024-10-11 04:56:57,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 04:56:57,577 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 9999 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9999 SdHoareTripleChecker+Valid, 4250 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:57,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9999 Valid, 4250 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:56:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140931 states. [2024-10-11 04:57:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140931 to 72053. [2024-10-11 04:57:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72053 states, 72051 states have (on average 1.4351501020110755) internal successors, (103404), 72052 states have internal predecessors, (103404), 0 states have call successors, (0), 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-11 04:57:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72053 states to 72053 states and 103404 transitions. [2024-10-11 04:57:00,290 INFO L78 Accepts]: Start accepts. Automaton has 72053 states and 103404 transitions. Word has length 100 [2024-10-11 04:57:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:00,290 INFO L471 AbstractCegarLoop]: Abstraction has 72053 states and 103404 transitions. [2024-10-11 04:57:00,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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-11 04:57:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 72053 states and 103404 transitions. [2024-10-11 04:57:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:57:00,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:00,296 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:57:00,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:57:00,296 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:00,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:00,297 INFO L85 PathProgramCache]: Analyzing trace with hash 327473196, now seen corresponding path program 1 times [2024-10-11 04:57:00,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:00,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103213324] [2024-10-11 04:57:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 04:57:00,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:00,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103213324] [2024-10-11 04:57:00,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103213324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:00,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:00,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:57:00,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522818580] [2024-10-11 04:57:00,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:00,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:57:00,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:00,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:57:00,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:57:00,666 INFO L87 Difference]: Start difference. First operand 72053 states and 103404 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 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-11 04:57:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:04,005 INFO L93 Difference]: Finished difference Result 170245 states and 246772 transitions. [2024-10-11 04:57:04,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:57:04,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 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 100 [2024-10-11 04:57:04,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:04,270 INFO L225 Difference]: With dead ends: 170245 [2024-10-11 04:57:04,270 INFO L226 Difference]: Without dead ends: 155587 [2024-10-11 04:57:04,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 04:57:04,310 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 10065 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10065 SdHoareTripleChecker+Valid, 4214 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:04,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10065 Valid, 4214 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:57:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155587 states. [2024-10-11 04:57:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155587 to 86709. [2024-10-11 04:57:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86709 states, 86707 states have (on average 1.4368851419147244) internal successors, (124588), 86708 states have internal predecessors, (124588), 0 states have call successors, (0), 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-11 04:57:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86709 states to 86709 states and 124588 transitions. [2024-10-11 04:57:07,389 INFO L78 Accepts]: Start accepts. Automaton has 86709 states and 124588 transitions. Word has length 100 [2024-10-11 04:57:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:07,390 INFO L471 AbstractCegarLoop]: Abstraction has 86709 states and 124588 transitions. [2024-10-11 04:57:07,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 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-11 04:57:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 86709 states and 124588 transitions. [2024-10-11 04:57:07,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:57:07,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:07,396 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:57:07,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 04:57:07,397 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:07,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:07,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1216206636, now seen corresponding path program 1 times [2024-10-11 04:57:07,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:07,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129859830] [2024-10-11 04:57:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:57:07,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:07,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129859830] [2024-10-11 04:57:07,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129859830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:07,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:07,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:57:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850473359] [2024-10-11 04:57:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:07,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:57:07,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:07,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:57:07,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:57:07,817 INFO L87 Difference]: Start difference. First operand 86709 states and 124588 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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-11 04:57:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:11,986 INFO L93 Difference]: Finished difference Result 184901 states and 267956 transitions. [2024-10-11 04:57:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:57:11,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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 100 [2024-10-11 04:57:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:12,226 INFO L225 Difference]: With dead ends: 184901 [2024-10-11 04:57:12,226 INFO L226 Difference]: Without dead ends: 170243 [2024-10-11 04:57:12,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 04:57:12,263 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 9915 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9915 SdHoareTripleChecker+Valid, 4321 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:12,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9915 Valid, 4321 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:57:12,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170243 states. [2024-10-11 04:57:15,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170243 to 101365. [2024-10-11 04:57:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101365 states, 101363 states have (on average 1.4381184455866538) internal successors, (145772), 101364 states have internal predecessors, (145772), 0 states have call successors, (0), 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-11 04:57:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101365 states to 101365 states and 145772 transitions. [2024-10-11 04:57:15,967 INFO L78 Accepts]: Start accepts. Automaton has 101365 states and 145772 transitions. Word has length 100 [2024-10-11 04:57:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:15,968 INFO L471 AbstractCegarLoop]: Abstraction has 101365 states and 145772 transitions. [2024-10-11 04:57:15,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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-11 04:57:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 101365 states and 145772 transitions. [2024-10-11 04:57:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:57:15,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:15,974 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:57:15,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 04:57:15,974 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:15,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:15,975 INFO L85 PathProgramCache]: Analyzing trace with hash 913185324, now seen corresponding path program 1 times [2024-10-11 04:57:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:15,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163584887] [2024-10-11 04:57:15,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:15,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 04:57:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163584887] [2024-10-11 04:57:16,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163584887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:16,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:16,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:57:16,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760720419] [2024-10-11 04:57:16,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:16,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:57:16,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:16,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:57:16,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:57:16,175 INFO L87 Difference]: Start difference. First operand 101365 states and 145772 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)