./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.3.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7eede2d26a445be0bc2850b4aae5c570af9ea0b845e235e7359967bb638a4a3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:19:54,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:19:54,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:19:54,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:19:54,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:19:54,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:19:54,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:19:54,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:19:54,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:19:54,742 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:19:54,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:19:54,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:19:54,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:19:54,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:19:54,743 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:19:54,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:19:54,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:19:54,746 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:19:54,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:19:54,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:19:54,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:19:54,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:19:54,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:19:54,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:19:54,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:19:54,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:19:54,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:19:54,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:19:54,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:19:54,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:19:54,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:19:54,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:19:54,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:19:54,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:19:54,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:19:54,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:19:54,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:19:54,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:19:54,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:19:54,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:19:54,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:19:54,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:19:54,758 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7eede2d26a445be0bc2850b4aae5c570af9ea0b845e235e7359967bb638a4a3 [2024-10-11 03:19:54,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:19:55,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:19:55,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:19:55,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:19:55,011 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:19:55,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.3.ufo.UNBOUNDED.pals.c [2024-10-11 03:19:56,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:19:56,488 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:19:56,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.3.ufo.UNBOUNDED.pals.c [2024-10-11 03:19:56,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b05d6fe7d/30baea9a196e4864ab7388f752ed4a4f/FLAG241d7f815 [2024-10-11 03:19:56,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b05d6fe7d/30baea9a196e4864ab7388f752ed4a4f [2024-10-11 03:19:56,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:19:56,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:19:56,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:19:56,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:19:56,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:19:56,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:19:56" (1/1) ... [2024-10-11 03:19:56,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca4330f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:56, skipping insertion in model container [2024-10-11 03:19:56,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:19:56" (1/1) ... [2024-10-11 03:19:56,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:19:56,902 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.3.ufo.UNBOUNDED.pals.c[61125,61138] [2024-10-11 03:19:56,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:19:56,919 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:19:56,999 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.3.ufo.UNBOUNDED.pals.c[61125,61138] [2024-10-11 03:19:56,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:19:57,017 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:19:57,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57 WrapperNode [2024-10-11 03:19:57,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:19:57,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:19:57,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:19:57,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:19:57,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (1/1) ... [2024-10-11 03:19:57,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (1/1) ... [2024-10-11 03:19:57,108 INFO L138 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 2052 [2024-10-11 03:19:57,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:19:57,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:19:57,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:19:57,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:19:57,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (1/1) ... [2024-10-11 03:19:57,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (1/1) ... [2024-10-11 03:19:57,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (1/1) ... [2024-10-11 03:19:57,165 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:19:57,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (1/1) ... [2024-10-11 03:19:57,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (1/1) ... [2024-10-11 03:19:57,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (1/1) ... [2024-10-11 03:19:57,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (1/1) ... [2024-10-11 03:19:57,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (1/1) ... [2024-10-11 03:19:57,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (1/1) ... [2024-10-11 03:19:57,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:19:57,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:19:57,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:19:57,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:19:57,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (1/1) ... [2024-10-11 03:19:57,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:19:57,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:19:57,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:19:57,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:19:57,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:19:57,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:19:57,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:19:57,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:19:57,503 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:19:57,505 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:19:58,874 INFO L? ?]: Removed 235 outVars from TransFormulas that were not future-live. [2024-10-11 03:19:58,874 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:19:58,970 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:19:58,970 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:19:58,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:19:58 BoogieIcfgContainer [2024-10-11 03:19:58,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:19:58,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:19:58,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:19:58,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:19:58,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:19:56" (1/3) ... [2024-10-11 03:19:58,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5263d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:19:58, skipping insertion in model container [2024-10-11 03:19:58,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:57" (2/3) ... [2024-10-11 03:19:58,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5263d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:19:58, skipping insertion in model container [2024-10-11 03:19:58,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:19:58" (3/3) ... [2024-10-11 03:19:58,977 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.3.ufo.UNBOUNDED.pals.c [2024-10-11 03:19:58,989 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:19:58,990 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:19:59,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:19:59,067 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;@6ac392d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:19:59,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:19:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 671 states, 669 states have (on average 1.8729446935724963) internal successors, (1253), 670 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:19:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:19:59,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:19:59,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:19:59,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:19:59,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:19:59,097 INFO L85 PathProgramCache]: Analyzing trace with hash -881425060, now seen corresponding path program 1 times [2024-10-11 03:19:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:19:59,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996567854] [2024-10-11 03:19:59,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:19:59,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:19:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:19:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:19:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:19:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996567854] [2024-10-11 03:19:59,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996567854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:19:59,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:19:59,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:19:59,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062009262] [2024-10-11 03:19:59,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:19:59,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:19:59,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:19:59,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:19:59,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:19:59,634 INFO L87 Difference]: Start difference. First operand has 671 states, 669 states have (on average 1.8729446935724963) internal successors, (1253), 670 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:19:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:19:59,703 INFO L93 Difference]: Finished difference Result 797 states and 1481 transitions. [2024-10-11 03:19:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:19:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2024-10-11 03:19:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:19:59,721 INFO L225 Difference]: With dead ends: 797 [2024-10-11 03:19:59,723 INFO L226 Difference]: Without dead ends: 669 [2024-10-11 03:19:59,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:19:59,730 INFO L432 NwaCegarLoop]: 1245 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:19:59,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1245 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:19:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-10-11 03:19:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2024-10-11 03:19:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 1.8682634730538923) internal successors, (1248), 668 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:19:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1248 transitions. [2024-10-11 03:19:59,783 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1248 transitions. Word has length 150 [2024-10-11 03:19:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:19:59,784 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 1248 transitions. [2024-10-11 03:19:59,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:19:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1248 transitions. [2024-10-11 03:19:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:19:59,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:19:59,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:19:59,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:19:59,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:19:59,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:19:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1041802974, now seen corresponding path program 1 times [2024-10-11 03:19:59,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:19:59,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764788154] [2024-10-11 03:19:59,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:19:59,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:19:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:00,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:00,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764788154] [2024-10-11 03:20:00,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764788154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:00,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:00,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:20:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547230405] [2024-10-11 03:20:00,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:00,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:20:00,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:00,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:20:00,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:00,156 INFO L87 Difference]: Start difference. First operand 669 states and 1248 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:00,271 INFO L93 Difference]: Finished difference Result 797 states and 1475 transitions. [2024-10-11 03:20:00,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:20:00,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2024-10-11 03:20:00,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:00,275 INFO L225 Difference]: With dead ends: 797 [2024-10-11 03:20:00,277 INFO L226 Difference]: Without dead ends: 669 [2024-10-11 03:20:00,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:00,280 INFO L432 NwaCegarLoop]: 1245 mSDtfsCounter, 0 mSDsluCounter, 2427 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:00,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3672 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-10-11 03:20:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2024-10-11 03:20:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 1.778443113772455) internal successors, (1188), 668 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1188 transitions. [2024-10-11 03:20:00,303 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1188 transitions. Word has length 150 [2024-10-11 03:20:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:00,304 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 1188 transitions. [2024-10-11 03:20:00,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:00,304 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1188 transitions. [2024-10-11 03:20:00,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 03:20:00,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:00,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:00,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:20:00,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:00,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:00,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1459608935, now seen corresponding path program 1 times [2024-10-11 03:20:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189219833] [2024-10-11 03:20:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:00,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:00,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189219833] [2024-10-11 03:20:00,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189219833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:00,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:00,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:00,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609591952] [2024-10-11 03:20:00,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:00,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:00,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:00,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:00,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:00,581 INFO L87 Difference]: Start difference. First operand 669 states and 1188 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:00,655 INFO L93 Difference]: Finished difference Result 906 states and 1611 transitions. [2024-10-11 03:20:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:00,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2024-10-11 03:20:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:00,659 INFO L225 Difference]: With dead ends: 906 [2024-10-11 03:20:00,659 INFO L226 Difference]: Without dead ends: 781 [2024-10-11 03:20:00,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:00,664 INFO L432 NwaCegarLoop]: 1179 mSDtfsCounter, 190 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:00,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 2302 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2024-10-11 03:20:00,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 778. [2024-10-11 03:20:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.7747747747747749) internal successors, (1379), 777 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1379 transitions. [2024-10-11 03:20:00,681 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1379 transitions. Word has length 209 [2024-10-11 03:20:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:00,682 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 1379 transitions. [2024-10-11 03:20:00,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1379 transitions. [2024-10-11 03:20:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 03:20:00,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:00,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:20:00,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:00,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:00,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1229210841, now seen corresponding path program 1 times [2024-10-11 03:20:00,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:00,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133087903] [2024-10-11 03:20:00,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:00,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:00,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133087903] [2024-10-11 03:20:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133087903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:00,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:00,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106418850] [2024-10-11 03:20:00,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:00,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:00,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:00,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:00,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:00,930 INFO L87 Difference]: Start difference. First operand 778 states and 1379 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:00,972 INFO L93 Difference]: Finished difference Result 1224 states and 2167 transitions. [2024-10-11 03:20:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:00,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2024-10-11 03:20:00,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:00,977 INFO L225 Difference]: With dead ends: 1224 [2024-10-11 03:20:00,977 INFO L226 Difference]: Without dead ends: 990 [2024-10-11 03:20:00,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:00,979 INFO L432 NwaCegarLoop]: 1182 mSDtfsCounter, 190 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:00,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 2314 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-11 03:20:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 986. [2024-10-11 03:20:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 985 states have (on average 1.7715736040609138) internal successors, (1745), 985 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1745 transitions. [2024-10-11 03:20:01,006 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1745 transitions. Word has length 213 [2024-10-11 03:20:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:01,006 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1745 transitions. [2024-10-11 03:20:01,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1745 transitions. [2024-10-11 03:20:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 03:20:01,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:01,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:01,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:20:01,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:01,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1463081911, now seen corresponding path program 1 times [2024-10-11 03:20:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542972718] [2024-10-11 03:20:01,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:01,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:01,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542972718] [2024-10-11 03:20:01,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542972718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:01,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:01,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491833180] [2024-10-11 03:20:01,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:01,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:01,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:01,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:01,220 INFO L87 Difference]: Start difference. First operand 986 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:01,277 INFO L93 Difference]: Finished difference Result 1826 states and 3223 transitions. [2024-10-11 03:20:01,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:01,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 217 [2024-10-11 03:20:01,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:01,283 INFO L225 Difference]: With dead ends: 1826 [2024-10-11 03:20:01,283 INFO L226 Difference]: Without dead ends: 1384 [2024-10-11 03:20:01,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:01,286 INFO L432 NwaCegarLoop]: 1182 mSDtfsCounter, 182 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:01,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 2315 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-10-11 03:20:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1378. [2024-10-11 03:20:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1377 states have (on average 1.7639796659404503) internal successors, (2429), 1377 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2429 transitions. [2024-10-11 03:20:01,314 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2429 transitions. Word has length 217 [2024-10-11 03:20:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:01,314 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 2429 transitions. [2024-10-11 03:20:01,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2429 transitions. [2024-10-11 03:20:01,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 03:20:01,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:01,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:01,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:20:01,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:01,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1321288251, now seen corresponding path program 1 times [2024-10-11 03:20:01,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:01,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086787350] [2024-10-11 03:20:01,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:01,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:01,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086787350] [2024-10-11 03:20:01,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086787350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:01,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:01,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:01,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575438538] [2024-10-11 03:20:01,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:01,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:01,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:01,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:01,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:01,582 INFO L87 Difference]: Start difference. First operand 1378 states and 2429 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:01,639 INFO L93 Difference]: Finished difference Result 2958 states and 5191 transitions. [2024-10-11 03:20:01,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:01,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2024-10-11 03:20:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:01,647 INFO L225 Difference]: With dead ends: 2958 [2024-10-11 03:20:01,647 INFO L226 Difference]: Without dead ends: 2124 [2024-10-11 03:20:01,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:01,649 INFO L432 NwaCegarLoop]: 1182 mSDtfsCounter, 174 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 2316 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:01,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 2316 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2024-10-11 03:20:01,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 2114. [2024-10-11 03:20:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2113 states have (on average 1.7515380974917178) internal successors, (3701), 2113 states have internal predecessors, (3701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3701 transitions. [2024-10-11 03:20:01,685 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3701 transitions. Word has length 221 [2024-10-11 03:20:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:01,685 INFO L471 AbstractCegarLoop]: Abstraction has 2114 states and 3701 transitions. [2024-10-11 03:20:01,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3701 transitions. [2024-10-11 03:20:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 03:20:01,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:01,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:01,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:20:01,688 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:01,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:01,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2077680365, now seen corresponding path program 1 times [2024-10-11 03:20:01,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:01,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042279132] [2024-10-11 03:20:01,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:01,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:01,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:01,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042279132] [2024-10-11 03:20:01,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042279132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:01,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:01,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:01,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59255040] [2024-10-11 03:20:01,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:01,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:01,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:01,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:01,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:01,915 INFO L87 Difference]: Start difference. First operand 2114 states and 3701 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:01,974 INFO L93 Difference]: Finished difference Result 5078 states and 8839 transitions. [2024-10-11 03:20:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2024-10-11 03:20:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:01,986 INFO L225 Difference]: With dead ends: 5078 [2024-10-11 03:20:01,986 INFO L226 Difference]: Without dead ends: 3508 [2024-10-11 03:20:01,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:01,992 INFO L432 NwaCegarLoop]: 1182 mSDtfsCounter, 166 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:01,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 2317 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2024-10-11 03:20:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3490. [2024-10-11 03:20:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3490 states, 3489 states have (on average 1.7348810547434794) internal successors, (6053), 3489 states have internal predecessors, (6053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 6053 transitions. [2024-10-11 03:20:02,061 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 6053 transitions. Word has length 225 [2024-10-11 03:20:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:02,061 INFO L471 AbstractCegarLoop]: Abstraction has 3490 states and 6053 transitions. [2024-10-11 03:20:02,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 6053 transitions. [2024-10-11 03:20:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 03:20:02,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:02,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:02,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:20:02,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:02,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash 239634015, now seen corresponding path program 1 times [2024-10-11 03:20:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:02,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613613478] [2024-10-11 03:20:02,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:02,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:02,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:02,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613613478] [2024-10-11 03:20:02,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613613478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:02,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:02,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:20:02,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600516871] [2024-10-11 03:20:02,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:02,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:20:02,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:02,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:20:02,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:20:02,503 INFO L87 Difference]: Start difference. First operand 3490 states and 6053 transitions. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:02,994 INFO L93 Difference]: Finished difference Result 20470 states and 35743 transitions. [2024-10-11 03:20:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:20:02,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2024-10-11 03:20:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:03,057 INFO L225 Difference]: With dead ends: 20470 [2024-10-11 03:20:03,058 INFO L226 Difference]: Without dead ends: 17524 [2024-10-11 03:20:03,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:20:03,069 INFO L432 NwaCegarLoop]: 1185 mSDtfsCounter, 2379 mSDsluCounter, 9140 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2379 SdHoareTripleChecker+Valid, 10325 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:03,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2379 Valid, 10325 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:20:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17524 states. [2024-10-11 03:20:03,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17524 to 6313. [2024-10-11 03:20:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6313 states, 6312 states have (on average 1.730513307984791) internal successors, (10923), 6312 states have internal predecessors, (10923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6313 states to 6313 states and 10923 transitions. [2024-10-11 03:20:03,314 INFO L78 Accepts]: Start accepts. Automaton has 6313 states and 10923 transitions. Word has length 229 [2024-10-11 03:20:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:03,314 INFO L471 AbstractCegarLoop]: Abstraction has 6313 states and 10923 transitions. [2024-10-11 03:20:03,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:03,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6313 states and 10923 transitions. [2024-10-11 03:20:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-11 03:20:03,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:03,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:03,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:20:03,319 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:03,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1235022841, now seen corresponding path program 1 times [2024-10-11 03:20:03,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:03,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038450585] [2024-10-11 03:20:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:03,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:03,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038450585] [2024-10-11 03:20:03,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038450585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:03,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:03,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:20:03,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487669506] [2024-10-11 03:20:03,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:03,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:20:03,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:03,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:20:03,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:03,607 INFO L87 Difference]: Start difference. First operand 6313 states and 10923 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:03,786 INFO L93 Difference]: Finished difference Result 18272 states and 31766 transitions. [2024-10-11 03:20:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:20:03,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2024-10-11 03:20:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:03,812 INFO L225 Difference]: With dead ends: 18272 [2024-10-11 03:20:03,812 INFO L226 Difference]: Without dead ends: 12503 [2024-10-11 03:20:03,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-11 03:20:03,826 INFO L432 NwaCegarLoop]: 1187 mSDtfsCounter, 635 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 3551 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:03,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 3551 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2024-10-11 03:20:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 9375. [2024-10-11 03:20:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9375 states, 9374 states have (on average 1.7324514614892255) internal successors, (16240), 9374 states have internal predecessors, (16240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9375 states to 9375 states and 16240 transitions. [2024-10-11 03:20:04,066 INFO L78 Accepts]: Start accepts. Automaton has 9375 states and 16240 transitions. Word has length 230 [2024-10-11 03:20:04,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:04,066 INFO L471 AbstractCegarLoop]: Abstraction has 9375 states and 16240 transitions. [2024-10-11 03:20:04,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 9375 states and 16240 transitions. [2024-10-11 03:20:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 03:20:04,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:04,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:04,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:20:04,072 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:04,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:04,072 INFO L85 PathProgramCache]: Analyzing trace with hash 300706632, now seen corresponding path program 1 times [2024-10-11 03:20:04,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:04,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965046830] [2024-10-11 03:20:04,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:04,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:04,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:04,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965046830] [2024-10-11 03:20:04,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965046830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:04,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:04,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:20:04,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622468238] [2024-10-11 03:20:04,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:04,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:20:04,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:04,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:20:04,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:04,332 INFO L87 Difference]: Start difference. First operand 9375 states and 16240 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:04,536 INFO L93 Difference]: Finished difference Result 27436 states and 47636 transitions. [2024-10-11 03:20:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:20:04,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2024-10-11 03:20:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:04,571 INFO L225 Difference]: With dead ends: 27436 [2024-10-11 03:20:04,571 INFO L226 Difference]: Without dead ends: 18605 [2024-10-11 03:20:04,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-11 03:20:04,590 INFO L432 NwaCegarLoop]: 1174 mSDtfsCounter, 635 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 3702 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:04,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 3702 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:04,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18605 states. [2024-10-11 03:20:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18605 to 13942. [2024-10-11 03:20:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13942 states, 13941 states have (on average 1.7297898285632307) internal successors, (24115), 13941 states have internal predecessors, (24115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13942 states to 13942 states and 24115 transitions. [2024-10-11 03:20:05,013 INFO L78 Accepts]: Start accepts. Automaton has 13942 states and 24115 transitions. Word has length 231 [2024-10-11 03:20:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:05,014 INFO L471 AbstractCegarLoop]: Abstraction has 13942 states and 24115 transitions. [2024-10-11 03:20:05,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 13942 states and 24115 transitions. [2024-10-11 03:20:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 03:20:05,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:05,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:05,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:20:05,023 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:05,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1272311186, now seen corresponding path program 1 times [2024-10-11 03:20:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:05,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653186160] [2024-10-11 03:20:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:05,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:05,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653186160] [2024-10-11 03:20:05,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653186160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:05,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500661588] [2024-10-11 03:20:05,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:05,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:05,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:05,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:05,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:05,201 INFO L87 Difference]: Start difference. First operand 13942 states and 24115 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:05,402 INFO L93 Difference]: Finished difference Result 31123 states and 54019 transitions. [2024-10-11 03:20:05,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:05,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2024-10-11 03:20:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:05,441 INFO L225 Difference]: With dead ends: 31123 [2024-10-11 03:20:05,441 INFO L226 Difference]: Without dead ends: 21663 [2024-10-11 03:20:05,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:05,462 INFO L432 NwaCegarLoop]: 1360 mSDtfsCounter, 197 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:05,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 2524 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21663 states. [2024-10-11 03:20:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21663 to 21661. [2024-10-11 03:20:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21661 states, 21660 states have (on average 1.725438596491228) internal successors, (37373), 21660 states have internal predecessors, (37373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21661 states to 21661 states and 37373 transitions. [2024-10-11 03:20:05,931 INFO L78 Accepts]: Start accepts. Automaton has 21661 states and 37373 transitions. Word has length 232 [2024-10-11 03:20:05,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:05,931 INFO L471 AbstractCegarLoop]: Abstraction has 21661 states and 37373 transitions. [2024-10-11 03:20:05,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 21661 states and 37373 transitions. [2024-10-11 03:20:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 03:20:05,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:05,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:05,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:20:05,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:05,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:05,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2006740629, now seen corresponding path program 1 times [2024-10-11 03:20:05,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:05,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553730948] [2024-10-11 03:20:05,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:06,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:06,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553730948] [2024-10-11 03:20:06,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553730948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:06,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:06,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:06,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848984079] [2024-10-11 03:20:06,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:06,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:06,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:06,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:06,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:06,096 INFO L87 Difference]: Start difference. First operand 21661 states and 37373 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:06,461 INFO L93 Difference]: Finished difference Result 48248 states and 83252 transitions. [2024-10-11 03:20:06,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2024-10-11 03:20:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:06,521 INFO L225 Difference]: With dead ends: 48248 [2024-10-11 03:20:06,521 INFO L226 Difference]: Without dead ends: 33505 [2024-10-11 03:20:06,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:06,544 INFO L432 NwaCegarLoop]: 1356 mSDtfsCounter, 189 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:06,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 2521 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33505 states. [2024-10-11 03:20:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33505 to 33503. [2024-10-11 03:20:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33503 states, 33502 states have (on average 1.715987105247448) internal successors, (57489), 33502 states have internal predecessors, (57489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33503 states to 33503 states and 57489 transitions. [2024-10-11 03:20:07,174 INFO L78 Accepts]: Start accepts. Automaton has 33503 states and 57489 transitions. Word has length 232 [2024-10-11 03:20:07,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:07,174 INFO L471 AbstractCegarLoop]: Abstraction has 33503 states and 57489 transitions. [2024-10-11 03:20:07,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 33503 states and 57489 transitions. [2024-10-11 03:20:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 03:20:07,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:07,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:07,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:20:07,178 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:07,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:07,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1392853093, now seen corresponding path program 1 times [2024-10-11 03:20:07,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:07,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285899335] [2024-10-11 03:20:07,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:07,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:07,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:07,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285899335] [2024-10-11 03:20:07,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285899335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:07,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:07,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:07,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252714452] [2024-10-11 03:20:07,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:07,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:07,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:07,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:07,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:07,329 INFO L87 Difference]: Start difference. First operand 33503 states and 57489 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:07,915 INFO L93 Difference]: Finished difference Result 65664 states and 112790 transitions. [2024-10-11 03:20:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:07,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2024-10-11 03:20:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:08,002 INFO L225 Difference]: With dead ends: 65664 [2024-10-11 03:20:08,003 INFO L226 Difference]: Without dead ends: 47699 [2024-10-11 03:20:08,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:08,046 INFO L432 NwaCegarLoop]: 1309 mSDtfsCounter, 173 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:08,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 2476 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47699 states. [2024-10-11 03:20:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47699 to 47697. [2024-10-11 03:20:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47697 states, 47696 states have (on average 1.7079419657832942) internal successors, (81462), 47696 states have internal predecessors, (81462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:09,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47697 states to 47697 states and 81462 transitions. [2024-10-11 03:20:09,007 INFO L78 Accepts]: Start accepts. Automaton has 47697 states and 81462 transitions. Word has length 232 [2024-10-11 03:20:09,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:09,007 INFO L471 AbstractCegarLoop]: Abstraction has 47697 states and 81462 transitions. [2024-10-11 03:20:09,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 47697 states and 81462 transitions. [2024-10-11 03:20:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 03:20:09,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:09,010 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:09,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:20:09,011 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1509464140, now seen corresponding path program 1 times [2024-10-11 03:20:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757502156] [2024-10-11 03:20:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:09,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:09,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757502156] [2024-10-11 03:20:09,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757502156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:09,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:09,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:09,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565088592] [2024-10-11 03:20:09,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:09,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:09,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:09,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:09,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:09,354 INFO L87 Difference]: Start difference. First operand 47697 states and 81462 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:10,098 INFO L93 Difference]: Finished difference Result 93308 states and 159566 transitions. [2024-10-11 03:20:10,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:10,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2024-10-11 03:20:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:10,345 INFO L225 Difference]: With dead ends: 93308 [2024-10-11 03:20:10,346 INFO L226 Difference]: Without dead ends: 67663 [2024-10-11 03:20:10,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:10,384 INFO L432 NwaCegarLoop]: 1297 mSDtfsCounter, 165 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:10,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 2465 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67663 states. [2024-10-11 03:20:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67663 to 67661. [2024-10-11 03:20:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67661 states, 67660 states have (on average 1.6993496896245937) internal successors, (114978), 67660 states have internal predecessors, (114978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67661 states to 67661 states and 114978 transitions. [2024-10-11 03:20:11,714 INFO L78 Accepts]: Start accepts. Automaton has 67661 states and 114978 transitions. Word has length 232 [2024-10-11 03:20:11,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:11,715 INFO L471 AbstractCegarLoop]: Abstraction has 67661 states and 114978 transitions. [2024-10-11 03:20:11,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 67661 states and 114978 transitions. [2024-10-11 03:20:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 03:20:11,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:11,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:11,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:20:11,718 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:11,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash 669131792, now seen corresponding path program 1 times [2024-10-11 03:20:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:11,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147879125] [2024-10-11 03:20:11,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:11,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147879125] [2024-10-11 03:20:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147879125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:20:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200881085] [2024-10-11 03:20:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:11,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:20:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:20:11,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:11,998 INFO L87 Difference]: Start difference. First operand 67661 states and 114978 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:13,291 INFO L93 Difference]: Finished difference Result 206383 states and 352254 transitions. [2024-10-11 03:20:13,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:20:13,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2024-10-11 03:20:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:13,573 INFO L225 Difference]: With dead ends: 206383 [2024-10-11 03:20:13,573 INFO L226 Difference]: Without dead ends: 139334 [2024-10-11 03:20:13,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-11 03:20:13,635 INFO L432 NwaCegarLoop]: 1295 mSDtfsCounter, 633 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 3825 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:13,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 3825 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139334 states. [2024-10-11 03:20:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139334 to 103060. [2024-10-11 03:20:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103060 states, 103059 states have (on average 1.697115244665677) internal successors, (174903), 103059 states have internal predecessors, (174903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103060 states to 103060 states and 174903 transitions. [2024-10-11 03:20:15,952 INFO L78 Accepts]: Start accepts. Automaton has 103060 states and 174903 transitions. Word has length 232 [2024-10-11 03:20:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:15,952 INFO L471 AbstractCegarLoop]: Abstraction has 103060 states and 174903 transitions. [2024-10-11 03:20:15,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 103060 states and 174903 transitions. [2024-10-11 03:20:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 03:20:15,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:15,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:15,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:20:15,955 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:15,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:15,956 INFO L85 PathProgramCache]: Analyzing trace with hash -476528770, now seen corresponding path program 1 times [2024-10-11 03:20:15,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:15,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602562322] [2024-10-11 03:20:15,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:15,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602562322] [2024-10-11 03:20:16,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602562322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:16,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:16,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:16,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390422986] [2024-10-11 03:20:16,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:16,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:16,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:16,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:16,098 INFO L87 Difference]: Start difference. First operand 103060 states and 174903 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:17,938 INFO L93 Difference]: Finished difference Result 230372 states and 390944 transitions. [2024-10-11 03:20:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:17,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2024-10-11 03:20:17,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:18,212 INFO L225 Difference]: With dead ends: 230372 [2024-10-11 03:20:18,212 INFO L226 Difference]: Without dead ends: 158427 [2024-10-11 03:20:18,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:18,294 INFO L432 NwaCegarLoop]: 1344 mSDtfsCounter, 181 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:18,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 2510 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:18,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158427 states. [2024-10-11 03:20:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158427 to 158425. [2024-10-11 03:20:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158425 states, 158424 states have (on average 1.684164015553199) internal successors, (266812), 158424 states have internal predecessors, (266812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158425 states to 158425 states and 266812 transitions. [2024-10-11 03:20:21,445 INFO L78 Accepts]: Start accepts. Automaton has 158425 states and 266812 transitions. Word has length 232 [2024-10-11 03:20:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:21,446 INFO L471 AbstractCegarLoop]: Abstraction has 158425 states and 266812 transitions. [2024-10-11 03:20:21,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 158425 states and 266812 transitions. [2024-10-11 03:20:21,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 03:20:21,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:21,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:21,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:20:21,448 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:21,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:21,449 INFO L85 PathProgramCache]: Analyzing trace with hash -789138383, now seen corresponding path program 1 times [2024-10-11 03:20:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:21,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146082527] [2024-10-11 03:20:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:21,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:21,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:21,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146082527] [2024-10-11 03:20:21,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146082527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:21,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:21,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:20:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956850608] [2024-10-11 03:20:21,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:21,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:20:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:21,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:20:21,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:21,710 INFO L87 Difference]: Start difference. First operand 158425 states and 266812 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:25,047 INFO L93 Difference]: Finished difference Result 524286 states and 884752 transitions. [2024-10-11 03:20:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:20:25,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233 [2024-10-11 03:20:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:26,025 INFO L225 Difference]: With dead ends: 524286 [2024-10-11 03:20:26,025 INFO L226 Difference]: Without dead ends: 366439 [2024-10-11 03:20:26,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-11 03:20:26,136 INFO L432 NwaCegarLoop]: 1174 mSDtfsCounter, 631 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 3706 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:26,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 3706 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366439 states. [2024-10-11 03:20:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366439 to 261707. [2024-10-11 03:20:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261707 states, 261706 states have (on average 1.678475082726418) internal successors, (439267), 261706 states have internal predecessors, (439267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261707 states to 261707 states and 439267 transitions. [2024-10-11 03:20:32,136 INFO L78 Accepts]: Start accepts. Automaton has 261707 states and 439267 transitions. Word has length 233 [2024-10-11 03:20:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:32,137 INFO L471 AbstractCegarLoop]: Abstraction has 261707 states and 439267 transitions. [2024-10-11 03:20:32,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 261707 states and 439267 transitions. [2024-10-11 03:20:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-11 03:20:32,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:32,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:32,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:20:32,142 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:32,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1254578201, now seen corresponding path program 1 times [2024-10-11 03:20:32,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:32,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392492259] [2024-10-11 03:20:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:32,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:32,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:32,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392492259] [2024-10-11 03:20:32,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392492259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:32,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:32,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:20:32,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931477359] [2024-10-11 03:20:32,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:32,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:20:32,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:32,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:20:32,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:32,418 INFO L87 Difference]: Start difference. First operand 261707 states and 439267 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:38,026 INFO L93 Difference]: Finished difference Result 860038 states and 1446586 transitions. [2024-10-11 03:20:38,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:20:38,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2024-10-11 03:20:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:39,306 INFO L225 Difference]: With dead ends: 860038 [2024-10-11 03:20:39,306 INFO L226 Difference]: Without dead ends: 598909 [2024-10-11 03:20:39,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-11 03:20:39,561 INFO L432 NwaCegarLoop]: 1174 mSDtfsCounter, 629 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 3708 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:39,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 3708 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598909 states.