./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60c415120e2678b24f3b884ebcebefc19905a98d476a557ead28c297441bd0dd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:51:08,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:51:08,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:51:08,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:51:08,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:51:08,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:51:08,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:51:08,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:51:08,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:51:08,474 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:51:08,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:51:08,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:51:08,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:51:08,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:51:08,476 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:51:08,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:51:08,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:51:08,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:51:08,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:51:08,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:51:08,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:51:08,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:51:08,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:51:08,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:51:08,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:51:08,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:51:08,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:51:08,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:51:08,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:51:08,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:51:08,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:51:08,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:51:08,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:51:08,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:51:08,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:51:08,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:51:08,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:51:08,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:51:08,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:51:08,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:51:08,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:51:08,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:51:08,488 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60c415120e2678b24f3b884ebcebefc19905a98d476a557ead28c297441bd0dd [2024-11-08 15:51:08,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:51:08,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:51:08,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:51:08,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:51:08,775 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:51:08,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:51:10,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:51:10,592 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:51:10,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:51:10,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707cfbcfb/57fc12d04cac4caaab0ab0fdfa14d9ad/FLAGd0e958279 [2024-11-08 15:51:10,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707cfbcfb/57fc12d04cac4caaab0ab0fdfa14d9ad [2024-11-08 15:51:10,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:51:10,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:51:10,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:51:10,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:51:10,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:51:10,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:51:10" (1/1) ... [2024-11-08 15:51:10,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6beb14c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:10, skipping insertion in model container [2024-11-08 15:51:10,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:51:10" (1/1) ... [2024-11-08 15:51:10,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:51:11,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[12986,12999] [2024-11-08 15:51:11,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:51:11,135 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:51:11,207 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[12986,12999] [2024-11-08 15:51:11,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:51:11,289 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:51:11,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11 WrapperNode [2024-11-08 15:51:11,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:51:11,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:51:11,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:51:11,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:51:11,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (1/1) ... [2024-11-08 15:51:11,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (1/1) ... [2024-11-08 15:51:11,385 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1367 [2024-11-08 15:51:11,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:51:11,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:51:11,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:51:11,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:51:11,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (1/1) ... [2024-11-08 15:51:11,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (1/1) ... [2024-11-08 15:51:11,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (1/1) ... [2024-11-08 15:51:11,453 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-11-08 15:51:11,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (1/1) ... [2024-11-08 15:51:11,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (1/1) ... [2024-11-08 15:51:11,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (1/1) ... [2024-11-08 15:51:11,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (1/1) ... [2024-11-08 15:51:11,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (1/1) ... [2024-11-08 15:51:11,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (1/1) ... [2024-11-08 15:51:11,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:51:11,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:51:11,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:51:11,532 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:51:11,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (1/1) ... [2024-11-08 15:51:11,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:51:11,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:51:11,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:51:11,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:51:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:51:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:51:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:51:11,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:51:11,800 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:51:11,802 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:51:12,944 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-11-08 15:51:12,944 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:51:12,976 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:51:12,979 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:51:12,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:51:12 BoogieIcfgContainer [2024-11-08 15:51:12,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:51:12,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:51:12,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:51:12,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:51:12,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:51:10" (1/3) ... [2024-11-08 15:51:12,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743c661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:51:12, skipping insertion in model container [2024-11-08 15:51:12,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:11" (2/3) ... [2024-11-08 15:51:12,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743c661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:51:12, skipping insertion in model container [2024-11-08 15:51:12,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:51:12" (3/3) ... [2024-11-08 15:51:12,991 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:51:13,007 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:51:13,008 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:51:13,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:51:13,089 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;@42ec33e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:51:13,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:51:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 324 states have (on average 1.7962962962962963) internal successors, (582), 325 states have internal predecessors, (582), 0 states have call successors, (0), 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-11-08 15:51:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 15:51:13,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:13,110 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, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:13,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:13,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:13,116 INFO L85 PathProgramCache]: Analyzing trace with hash 430105228, now seen corresponding path program 1 times [2024-11-08 15:51:13,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:13,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254122089] [2024-11-08 15:51:13,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:13,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:13,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:13,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254122089] [2024-11-08 15:51:13,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254122089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:13,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:13,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:13,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075108719] [2024-11-08 15:51:13,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:13,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:13,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:13,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:13,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:13,915 INFO L87 Difference]: Start difference. First operand has 326 states, 324 states have (on average 1.7962962962962963) internal successors, (582), 325 states have internal predecessors, (582), 0 states have call successors, (0), 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 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-11-08 15:51:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:14,063 INFO L93 Difference]: Finished difference Result 589 states and 1021 transitions. [2024-11-08 15:51:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:14,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-08 15:51:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:14,086 INFO L225 Difference]: With dead ends: 589 [2024-11-08 15:51:14,087 INFO L226 Difference]: Without dead ends: 446 [2024-11-08 15:51:14,091 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-11-08 15:51:14,096 INFO L432 NwaCegarLoop]: 576 mSDtfsCounter, 232 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:14,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1074 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-08 15:51:14,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 443. [2024-11-08 15:51:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.660633484162896) internal successors, (734), 442 states have internal predecessors, (734), 0 states have call successors, (0), 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-11-08 15:51:14,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 734 transitions. [2024-11-08 15:51:14,166 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 734 transitions. Word has length 110 [2024-11-08 15:51:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:14,166 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 734 transitions. [2024-11-08 15:51:14,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-11-08 15:51:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 734 transitions. [2024-11-08 15:51:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 15:51:14,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:14,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:14,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:51:14,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:14,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:14,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1228540371, now seen corresponding path program 1 times [2024-11-08 15:51:14,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:14,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137588843] [2024-11-08 15:51:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:14,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:14,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:14,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137588843] [2024-11-08 15:51:14,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137588843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:14,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:14,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:14,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548490029] [2024-11-08 15:51:14,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:14,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:14,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:14,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:14,506 INFO L87 Difference]: Start difference. First operand 443 states and 734 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-11-08 15:51:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:14,574 INFO L93 Difference]: Finished difference Result 933 states and 1550 transitions. [2024-11-08 15:51:14,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:14,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-11-08 15:51:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:14,580 INFO L225 Difference]: With dead ends: 933 [2024-11-08 15:51:14,582 INFO L226 Difference]: Without dead ends: 679 [2024-11-08 15:51:14,584 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-11-08 15:51:14,587 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 200 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:14,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1028 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-08 15:51:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 675. [2024-11-08 15:51:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.6587537091988132) internal successors, (1118), 674 states have internal predecessors, (1118), 0 states have call successors, (0), 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-11-08 15:51:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1118 transitions. [2024-11-08 15:51:14,624 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1118 transitions. Word has length 113 [2024-11-08 15:51:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:14,624 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1118 transitions. [2024-11-08 15:51:14,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-11-08 15:51:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1118 transitions. [2024-11-08 15:51:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 15:51:14,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:14,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:14,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:51:14,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:14,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1403707664, now seen corresponding path program 1 times [2024-11-08 15:51:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:14,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580669179] [2024-11-08 15:51:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:14,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:14,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580669179] [2024-11-08 15:51:14,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580669179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:14,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:14,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:14,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550067417] [2024-11-08 15:51:14,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:14,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:14,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:14,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:14,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:14,869 INFO L87 Difference]: Start difference. First operand 675 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-08 15:51:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:14,915 INFO L93 Difference]: Finished difference Result 1611 states and 2668 transitions. [2024-11-08 15:51:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:14,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-08 15:51:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:14,922 INFO L225 Difference]: With dead ends: 1611 [2024-11-08 15:51:14,922 INFO L226 Difference]: Without dead ends: 1125 [2024-11-08 15:51:14,923 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-11-08 15:51:14,926 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 194 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:14,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1029 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:14,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-08 15:51:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1119. [2024-11-08 15:51:14,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1118 states have (on average 1.6511627906976745) internal successors, (1846), 1118 states have internal predecessors, (1846), 0 states have call successors, (0), 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-11-08 15:51:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1846 transitions. [2024-11-08 15:51:14,962 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1846 transitions. Word has length 116 [2024-11-08 15:51:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:14,963 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1846 transitions. [2024-11-08 15:51:14,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-08 15:51:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1846 transitions. [2024-11-08 15:51:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 15:51:14,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:14,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:14,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:51:14,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:14,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1658128561, now seen corresponding path program 1 times [2024-11-08 15:51:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:14,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570797534] [2024-11-08 15:51:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:14,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:15,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570797534] [2024-11-08 15:51:15,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570797534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:15,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:15,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075629698] [2024-11-08 15:51:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:15,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:15,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:15,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:15,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:15,182 INFO L87 Difference]: Start difference. First operand 1119 states and 1846 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-08 15:51:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:15,233 INFO L93 Difference]: Finished difference Result 2907 states and 4784 transitions. [2024-11-08 15:51:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:15,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-08 15:51:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:15,240 INFO L225 Difference]: With dead ends: 2907 [2024-11-08 15:51:15,241 INFO L226 Difference]: Without dead ends: 1977 [2024-11-08 15:51:15,242 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-11-08 15:51:15,243 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 188 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:15,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1030 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-11-08 15:51:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1967. [2024-11-08 15:51:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1966 states have (on average 1.6388606307222788) internal successors, (3222), 1966 states have internal predecessors, (3222), 0 states have call successors, (0), 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-11-08 15:51:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3222 transitions. [2024-11-08 15:51:15,296 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3222 transitions. Word has length 119 [2024-11-08 15:51:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:15,296 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 3222 transitions. [2024-11-08 15:51:15,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-08 15:51:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3222 transitions. [2024-11-08 15:51:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 15:51:15,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:15,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:15,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:51:15,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:15,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1735235476, now seen corresponding path program 1 times [2024-11-08 15:51:15,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:15,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641989816] [2024-11-08 15:51:15,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:15,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:15,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:15,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641989816] [2024-11-08 15:51:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641989816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:15,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:15,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:51:15,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072218590] [2024-11-08 15:51:15,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:15,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:51:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:15,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:51:15,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:51:15,579 INFO L87 Difference]: Start difference. First operand 1967 states and 3222 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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-11-08 15:51:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:15,912 INFO L93 Difference]: Finished difference Result 10223 states and 16898 transitions. [2024-11-08 15:51:15,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:51:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-08 15:51:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:15,946 INFO L225 Difference]: With dead ends: 10223 [2024-11-08 15:51:15,946 INFO L226 Difference]: Without dead ends: 8445 [2024-11-08 15:51:15,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:51:15,955 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 2115 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 3920 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:15,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2115 Valid, 3920 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:51:15,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2024-11-08 15:51:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 3625. [2024-11-08 15:51:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 3624 states have (on average 1.6382450331125828) internal successors, (5937), 3624 states have internal predecessors, (5937), 0 states have call successors, (0), 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-11-08 15:51:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 5937 transitions. [2024-11-08 15:51:16,140 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 5937 transitions. Word has length 122 [2024-11-08 15:51:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:16,140 INFO L471 AbstractCegarLoop]: Abstraction has 3625 states and 5937 transitions. [2024-11-08 15:51:16,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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-11-08 15:51:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 5937 transitions. [2024-11-08 15:51:16,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 15:51:16,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:16,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:16,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:51:16,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:16,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2109337106, now seen corresponding path program 1 times [2024-11-08 15:51:16,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:16,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497134849] [2024-11-08 15:51:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:16,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:16,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:16,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497134849] [2024-11-08 15:51:16,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497134849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:16,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:16,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:51:16,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862428165] [2024-11-08 15:51:16,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:16,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:51:16,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:16,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:51:16,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:51:16,342 INFO L87 Difference]: Start difference. First operand 3625 states and 5937 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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-11-08 15:51:16,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:16,476 INFO L93 Difference]: Finished difference Result 10605 states and 17475 transitions. [2024-11-08 15:51:16,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:51:16,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-11-08 15:51:16,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:16,506 INFO L225 Difference]: With dead ends: 10605 [2024-11-08 15:51:16,507 INFO L226 Difference]: Without dead ends: 7169 [2024-11-08 15:51:16,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:51:16,516 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 658 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:16,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1763 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states. [2024-11-08 15:51:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 5380. [2024-11-08 15:51:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5380 states, 5379 states have (on average 1.6417549730433165) internal successors, (8831), 5379 states have internal predecessors, (8831), 0 states have call successors, (0), 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-11-08 15:51:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5380 states to 5380 states and 8831 transitions. [2024-11-08 15:51:16,682 INFO L78 Accepts]: Start accepts. Automaton has 5380 states and 8831 transitions. Word has length 123 [2024-11-08 15:51:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:16,682 INFO L471 AbstractCegarLoop]: Abstraction has 5380 states and 8831 transitions. [2024-11-08 15:51:16,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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-11-08 15:51:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 5380 states and 8831 transitions. [2024-11-08 15:51:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 15:51:16,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:16,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:16,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:51:16,687 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:16,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1027444837, now seen corresponding path program 1 times [2024-11-08 15:51:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:16,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102255358] [2024-11-08 15:51:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:16,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:16,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:16,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102255358] [2024-11-08 15:51:16,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102255358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:16,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:16,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:51:16,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107284365] [2024-11-08 15:51:16,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:16,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:51:16,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:16,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:51:16,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:51:16,852 INFO L87 Difference]: Start difference. First operand 5380 states and 8831 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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-11-08 15:51:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:16,991 INFO L93 Difference]: Finished difference Result 15777 states and 25981 transitions. [2024-11-08 15:51:16,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:51:16,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-08 15:51:16,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:17,031 INFO L225 Difference]: With dead ends: 15777 [2024-11-08 15:51:17,031 INFO L226 Difference]: Without dead ends: 10586 [2024-11-08 15:51:17,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:51:17,078 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 656 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:17,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1653 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10586 states. [2024-11-08 15:51:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10586 to 7959. [2024-11-08 15:51:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7959 states, 7958 states have (on average 1.6406132194018597) internal successors, (13056), 7958 states have internal predecessors, (13056), 0 states have call successors, (0), 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-11-08 15:51:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7959 states to 7959 states and 13056 transitions. [2024-11-08 15:51:17,308 INFO L78 Accepts]: Start accepts. Automaton has 7959 states and 13056 transitions. Word has length 124 [2024-11-08 15:51:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:17,309 INFO L471 AbstractCegarLoop]: Abstraction has 7959 states and 13056 transitions. [2024-11-08 15:51:17,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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-11-08 15:51:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 7959 states and 13056 transitions. [2024-11-08 15:51:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:51:17,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:17,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:17,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:51:17,314 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:17,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:17,315 INFO L85 PathProgramCache]: Analyzing trace with hash -275676370, now seen corresponding path program 1 times [2024-11-08 15:51:17,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:17,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16845004] [2024-11-08 15:51:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:17,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:17,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:17,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16845004] [2024-11-08 15:51:17,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16845004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:17,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:17,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:17,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466334980] [2024-11-08 15:51:17,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:17,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:17,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:17,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:17,441 INFO L87 Difference]: Start difference. First operand 7959 states and 13056 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-08 15:51:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:17,608 INFO L93 Difference]: Finished difference Result 15656 states and 25739 transitions. [2024-11-08 15:51:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:17,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-08 15:51:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:17,633 INFO L225 Difference]: With dead ends: 15656 [2024-11-08 15:51:17,633 INFO L226 Difference]: Without dead ends: 11380 [2024-11-08 15:51:17,643 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-11-08 15:51:17,644 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 193 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:17,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2024-11-08 15:51:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 11378. [2024-11-08 15:51:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11378 states, 11377 states have (on average 1.6374263865693943) internal successors, (18629), 11377 states have internal predecessors, (18629), 0 states have call successors, (0), 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-11-08 15:51:17,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11378 states to 11378 states and 18629 transitions. [2024-11-08 15:51:17,860 INFO L78 Accepts]: Start accepts. Automaton has 11378 states and 18629 transitions. Word has length 125 [2024-11-08 15:51:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:17,861 INFO L471 AbstractCegarLoop]: Abstraction has 11378 states and 18629 transitions. [2024-11-08 15:51:17,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-08 15:51:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 11378 states and 18629 transitions. [2024-11-08 15:51:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:51:17,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:17,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:17,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:51:17,865 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:17,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash 15369622, now seen corresponding path program 1 times [2024-11-08 15:51:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899390705] [2024-11-08 15:51:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:18,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:18,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899390705] [2024-11-08 15:51:18,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899390705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:18,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:18,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:18,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309583410] [2024-11-08 15:51:18,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:18,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:18,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:18,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:18,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:18,043 INFO L87 Difference]: Start difference. First operand 11378 states and 18629 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-08 15:51:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:18,131 INFO L93 Difference]: Finished difference Result 22088 states and 36263 transitions. [2024-11-08 15:51:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:18,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-08 15:51:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:18,165 INFO L225 Difference]: With dead ends: 22088 [2024-11-08 15:51:18,166 INFO L226 Difference]: Without dead ends: 16096 [2024-11-08 15:51:18,180 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-11-08 15:51:18,181 INFO L432 NwaCegarLoop]: 592 mSDtfsCounter, 187 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:18,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1094 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16096 states. [2024-11-08 15:51:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16096 to 16094. [2024-11-08 15:51:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16094 states, 16093 states have (on average 1.6340645000932081) internal successors, (26297), 16093 states have internal predecessors, (26297), 0 states have call successors, (0), 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-11-08 15:51:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16094 states to 16094 states and 26297 transitions. [2024-11-08 15:51:18,489 INFO L78 Accepts]: Start accepts. Automaton has 16094 states and 26297 transitions. Word has length 125 [2024-11-08 15:51:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:18,490 INFO L471 AbstractCegarLoop]: Abstraction has 16094 states and 26297 transitions. [2024-11-08 15:51:18,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-08 15:51:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 16094 states and 26297 transitions. [2024-11-08 15:51:18,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:51:18,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:18,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:18,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:51:18,494 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:18,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:18,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1843964843, now seen corresponding path program 1 times [2024-11-08 15:51:18,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:18,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846516094] [2024-11-08 15:51:18,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:18,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:18,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:18,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846516094] [2024-11-08 15:51:18,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846516094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:18,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:18,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:51:18,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75375840] [2024-11-08 15:51:18,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:18,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:51:18,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:18,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:51:18,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:51:18,751 INFO L87 Difference]: Start difference. First operand 16094 states and 26297 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-08 15:51:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:18,945 INFO L93 Difference]: Finished difference Result 50960 states and 83572 transitions. [2024-11-08 15:51:18,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:51:18,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-08 15:51:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:19,023 INFO L225 Difference]: With dead ends: 50960 [2024-11-08 15:51:19,024 INFO L226 Difference]: Without dead ends: 35474 [2024-11-08 15:51:19,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:51:19,060 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 654 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:19,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1550 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2024-11-08 15:51:19,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 25732. [2024-11-08 15:51:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25732 states, 25731 states have (on average 1.6325444016944541) internal successors, (42007), 25731 states have internal predecessors, (42007), 0 states have call successors, (0), 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-11-08 15:51:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25732 states to 25732 states and 42007 transitions. [2024-11-08 15:51:19,575 INFO L78 Accepts]: Start accepts. Automaton has 25732 states and 42007 transitions. Word has length 125 [2024-11-08 15:51:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:19,576 INFO L471 AbstractCegarLoop]: Abstraction has 25732 states and 42007 transitions. [2024-11-08 15:51:19,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-08 15:51:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 25732 states and 42007 transitions. [2024-11-08 15:51:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:51:19,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:19,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:19,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:51:19,579 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:19,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:19,580 INFO L85 PathProgramCache]: Analyzing trace with hash -815921210, now seen corresponding path program 1 times [2024-11-08 15:51:19,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:19,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249581042] [2024-11-08 15:51:19,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:19,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:19,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:19,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249581042] [2024-11-08 15:51:19,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249581042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:19,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:19,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:19,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629544406] [2024-11-08 15:51:19,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:19,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:19,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:19,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:19,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:19,801 INFO L87 Difference]: Start difference. First operand 25732 states and 42007 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-08 15:51:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:20,112 INFO L93 Difference]: Finished difference Result 55910 states and 91585 transitions. [2024-11-08 15:51:20,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:20,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-08 15:51:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:20,209 INFO L225 Difference]: With dead ends: 55910 [2024-11-08 15:51:20,210 INFO L226 Difference]: Without dead ends: 38187 [2024-11-08 15:51:20,236 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-11-08 15:51:20,237 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 199 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:20,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:20,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38187 states. [2024-11-08 15:51:20,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38187 to 38185. [2024-11-08 15:51:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38185 states, 38184 states have (on average 1.6302639849151477) internal successors, (62250), 38184 states have internal predecessors, (62250), 0 states have call successors, (0), 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-11-08 15:51:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38185 states to 38185 states and 62250 transitions. [2024-11-08 15:51:21,061 INFO L78 Accepts]: Start accepts. Automaton has 38185 states and 62250 transitions. Word has length 125 [2024-11-08 15:51:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:21,062 INFO L471 AbstractCegarLoop]: Abstraction has 38185 states and 62250 transitions. [2024-11-08 15:51:21,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-08 15:51:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 38185 states and 62250 transitions. [2024-11-08 15:51:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:51:21,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:21,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:21,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:51:21,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:21,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1819340837, now seen corresponding path program 1 times [2024-11-08 15:51:21,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:21,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941011527] [2024-11-08 15:51:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:21,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:21,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:21,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941011527] [2024-11-08 15:51:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941011527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:21,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104587734] [2024-11-08 15:51:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:21,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:21,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:21,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:21,305 INFO L87 Difference]: Start difference. First operand 38185 states and 62250 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-08 15:51:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:21,686 INFO L93 Difference]: Finished difference Result 83692 states and 137539 transitions. [2024-11-08 15:51:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-08 15:51:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:21,840 INFO L225 Difference]: With dead ends: 83692 [2024-11-08 15:51:21,841 INFO L226 Difference]: Without dead ends: 56811 [2024-11-08 15:51:21,887 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-11-08 15:51:21,888 INFO L432 NwaCegarLoop]: 704 mSDtfsCounter, 205 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:21,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1203 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56811 states. [2024-11-08 15:51:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56811 to 56809. [2024-11-08 15:51:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56809 states, 56808 states have (on average 1.63212927756654) internal successors, (92718), 56808 states have internal predecessors, (92718), 0 states have call successors, (0), 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-11-08 15:51:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56809 states to 56809 states and 92718 transitions. [2024-11-08 15:51:22,909 INFO L78 Accepts]: Start accepts. Automaton has 56809 states and 92718 transitions. Word has length 125 [2024-11-08 15:51:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:22,910 INFO L471 AbstractCegarLoop]: Abstraction has 56809 states and 92718 transitions. [2024-11-08 15:51:22,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-08 15:51:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 56809 states and 92718 transitions. [2024-11-08 15:51:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 15:51:22,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:22,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:22,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:51:22,912 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:22,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:22,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1381723230, now seen corresponding path program 1 times [2024-11-08 15:51:22,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:22,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588892840] [2024-11-08 15:51:22,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:22,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:23,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:23,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588892840] [2024-11-08 15:51:23,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588892840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:23,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:23,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:51:23,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901966171] [2024-11-08 15:51:23,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:23,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:51:23,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:23,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:51:23,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:51:23,070 INFO L87 Difference]: Start difference. First operand 56809 states and 92718 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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-11-08 15:51:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:23,959 INFO L93 Difference]: Finished difference Result 182062 states and 297983 transitions. [2024-11-08 15:51:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:51:23,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-08 15:51:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:24,511 INFO L225 Difference]: With dead ends: 182062 [2024-11-08 15:51:24,511 INFO L226 Difference]: Without dead ends: 125497 [2024-11-08 15:51:24,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:51:24,580 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 652 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:24,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1766 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:51:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125497 states. [2024-11-08 15:51:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125497 to 90928. [2024-11-08 15:51:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90928 states, 90927 states have (on average 1.6284601933419116) internal successors, (148071), 90927 states have internal predecessors, (148071), 0 states have call successors, (0), 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-11-08 15:51:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90928 states to 90928 states and 148071 transitions. [2024-11-08 15:51:26,328 INFO L78 Accepts]: Start accepts. Automaton has 90928 states and 148071 transitions. Word has length 126 [2024-11-08 15:51:26,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:26,328 INFO L471 AbstractCegarLoop]: Abstraction has 90928 states and 148071 transitions. [2024-11-08 15:51:26,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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-11-08 15:51:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 90928 states and 148071 transitions. [2024-11-08 15:51:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 15:51:26,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:26,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:26,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:51:26,333 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:26,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2086532755, now seen corresponding path program 1 times [2024-11-08 15:51:26,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:26,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550795962] [2024-11-08 15:51:26,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:26,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:26,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550795962] [2024-11-08 15:51:26,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550795962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:26,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:26,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:51:26,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372838341] [2024-11-08 15:51:26,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:26,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:51:26,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:26,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:51:26,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:51:26,780 INFO L87 Difference]: Start difference. First operand 90928 states and 148071 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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-11-08 15:51:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:27,522 INFO L93 Difference]: Finished difference Result 181614 states and 295752 transitions. [2024-11-08 15:51:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:51:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-08 15:51:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:27,706 INFO L225 Difference]: With dead ends: 181614 [2024-11-08 15:51:27,707 INFO L226 Difference]: Without dead ends: 90930 [2024-11-08 15:51:27,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:51:27,790 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 381 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:27,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 2041 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90930 states. [2024-11-08 15:51:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90930 to 90928. [2024-11-08 15:51:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90928 states, 90927 states have (on average 1.6215865474501523) internal successors, (147446), 90927 states have internal predecessors, (147446), 0 states have call successors, (0), 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-11-08 15:51:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90928 states to 90928 states and 147446 transitions. [2024-11-08 15:51:29,617 INFO L78 Accepts]: Start accepts. Automaton has 90928 states and 147446 transitions. Word has length 128 [2024-11-08 15:51:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:29,618 INFO L471 AbstractCegarLoop]: Abstraction has 90928 states and 147446 transitions. [2024-11-08 15:51:29,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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-11-08 15:51:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 90928 states and 147446 transitions. [2024-11-08 15:51:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 15:51:29,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:29,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:29,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:51:29,620 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:29,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1082243879, now seen corresponding path program 1 times [2024-11-08 15:51:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:29,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858702759] [2024-11-08 15:51:29,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:29,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:29,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:29,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858702759] [2024-11-08 15:51:29,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858702759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:29,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:29,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:51:29,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663882090] [2024-11-08 15:51:29,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:29,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:51:29,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:29,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:51:29,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:51:29,985 INFO L87 Difference]: Start difference. First operand 90928 states and 147446 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:31,230 INFO L93 Difference]: Finished difference Result 265772 states and 431468 transitions. [2024-11-08 15:51:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:51:31,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-11-08 15:51:31,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:31,483 INFO L225 Difference]: With dead ends: 265772 [2024-11-08 15:51:31,484 INFO L226 Difference]: Without dead ends: 175088 [2024-11-08 15:51:31,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:51:31,568 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 190 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:31,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 2561 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175088 states. [2024-11-08 15:51:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175088 to 175086. [2024-11-08 15:51:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175086 states, 175085 states have (on average 1.6129023045949111) internal successors, (282395), 175085 states have internal predecessors, (282395), 0 states have call successors, (0), 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-11-08 15:51:35,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175086 states to 175086 states and 282395 transitions. [2024-11-08 15:51:35,010 INFO L78 Accepts]: Start accepts. Automaton has 175086 states and 282395 transitions. Word has length 131 [2024-11-08 15:51:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:35,011 INFO L471 AbstractCegarLoop]: Abstraction has 175086 states and 282395 transitions. [2024-11-08 15:51:35,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:35,011 INFO L276 IsEmpty]: Start isEmpty. Operand 175086 states and 282395 transitions. [2024-11-08 15:51:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 15:51:35,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:35,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:35,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:51:35,012 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:35,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:35,013 INFO L85 PathProgramCache]: Analyzing trace with hash -812087216, now seen corresponding path program 1 times [2024-11-08 15:51:35,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:35,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623080105] [2024-11-08 15:51:35,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:35,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:35,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:35,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623080105] [2024-11-08 15:51:35,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623080105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:35,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:35,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:51:35,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624949986] [2024-11-08 15:51:35,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:35,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:51:35,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:35,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:51:35,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:51:35,905 INFO L87 Difference]: Start difference. First operand 175086 states and 282395 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:36,422 INFO L93 Difference]: Finished difference Result 178960 states and 288204 transitions. [2024-11-08 15:51:36,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:51:36,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2024-11-08 15:51:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:36,709 INFO L225 Difference]: With dead ends: 178960 [2024-11-08 15:51:36,709 INFO L226 Difference]: Without dead ends: 178958 [2024-11-08 15:51:37,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:51:37,329 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:37,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2115 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178958 states. [2024-11-08 15:51:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178958 to 178958. [2024-11-08 15:51:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178958 states, 178957 states have (on average 1.5994903803707037) internal successors, (286240), 178957 states have internal predecessors, (286240), 0 states have call successors, (0), 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-11-08 15:51:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178958 states to 178958 states and 286240 transitions. [2024-11-08 15:51:40,421 INFO L78 Accepts]: Start accepts. Automaton has 178958 states and 286240 transitions. Word has length 132 [2024-11-08 15:51:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:40,421 INFO L471 AbstractCegarLoop]: Abstraction has 178958 states and 286240 transitions. [2024-11-08 15:51:40,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 178958 states and 286240 transitions. [2024-11-08 15:51:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 15:51:40,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:40,426 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:40,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:51:40,426 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:40,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:40,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1146801810, now seen corresponding path program 1 times [2024-11-08 15:51:40,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:40,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998629430] [2024-11-08 15:51:40,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:40,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 15:51:40,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:40,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998629430] [2024-11-08 15:51:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998629430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:40,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:40,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:51:40,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170066438] [2024-11-08 15:51:40,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:40,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:51:40,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:40,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:51:40,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:51:40,688 INFO L87 Difference]: Start difference. First operand 178958 states and 286240 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:42,714 INFO L93 Difference]: Finished difference Result 487720 states and 782945 transitions. [2024-11-08 15:51:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:51:42,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-11-08 15:51:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:43,585 INFO L225 Difference]: With dead ends: 487720 [2024-11-08 15:51:43,586 INFO L226 Difference]: Without dead ends: 409068 [2024-11-08 15:51:43,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:51:43,743 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 1423 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:43,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 2710 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409068 states. [2024-11-08 15:51:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409068 to 287506. [2024-11-08 15:51:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287506 states, 287505 states have (on average 1.5981913358028557) internal successors, (459488), 287505 states have internal predecessors, (459488), 0 states have call successors, (0), 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-11-08 15:51:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287506 states to 287506 states and 459488 transitions. [2024-11-08 15:51:50,091 INFO L78 Accepts]: Start accepts. Automaton has 287506 states and 459488 transitions. Word has length 163 [2024-11-08 15:51:50,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:50,091 INFO L471 AbstractCegarLoop]: Abstraction has 287506 states and 459488 transitions. [2024-11-08 15:51:50,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 287506 states and 459488 transitions. [2024-11-08 15:51:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 15:51:50,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:50,097 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:51:50,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:51:50,097 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:50,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1437847802, now seen corresponding path program 1 times [2024-11-08 15:51:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:50,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52940583] [2024-11-08 15:51:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:50,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 15:51:50,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:50,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52940583] [2024-11-08 15:51:50,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52940583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:50,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:50,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:51:50,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748626529] [2024-11-08 15:51:50,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:50,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:51:50,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:50,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:51:50,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:51:50,394 INFO L87 Difference]: Start difference. First operand 287506 states and 459488 transitions. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-11-08 15:51:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:52,728 INFO L93 Difference]: Finished difference Result 518940 states and 833205 transitions. [2024-11-08 15:51:52,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:51:52,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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 163 [2024-11-08 15:51:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:53,653 INFO L225 Difference]: With dead ends: 518940 [2024-11-08 15:51:53,653 INFO L226 Difference]: Without dead ends: 440288 [2024-11-08 15:51:53,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:51:53,832 INFO L432 NwaCegarLoop]: 753 mSDtfsCounter, 1394 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:53,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 3056 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440288 states. [2024-11-08 15:51:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440288 to 388624. [2024-11-08 15:51:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388624 states, 388623 states have (on average 1.599555353131441) internal successors, (621624), 388623 states have internal predecessors, (621624), 0 states have call successors, (0), 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-11-08 15:52:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388624 states to 388624 states and 621624 transitions. [2024-11-08 15:52:01,480 INFO L78 Accepts]: Start accepts. Automaton has 388624 states and 621624 transitions. Word has length 163 [2024-11-08 15:52:01,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:01,481 INFO L471 AbstractCegarLoop]: Abstraction has 388624 states and 621624 transitions. [2024-11-08 15:52:01,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-11-08 15:52:01,481 INFO L276 IsEmpty]: Start isEmpty. Operand 388624 states and 621624 transitions. [2024-11-08 15:52:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 15:52:01,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:01,495 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:01,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:52:01,495 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:01,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:01,499 INFO L85 PathProgramCache]: Analyzing trace with hash 606556970, now seen corresponding path program 1 times [2024-11-08 15:52:01,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:01,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470610170] [2024-11-08 15:52:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:01,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 15:52:01,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:01,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470610170] [2024-11-08 15:52:01,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470610170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:01,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:01,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:52:01,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738956614] [2024-11-08 15:52:01,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:01,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:52:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:01,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:52:01,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:52:01,983 INFO L87 Difference]: Start difference. First operand 388624 states and 621624 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)