./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:38:21,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:38:21,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:38:21,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:38:21,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:38:21,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:38:21,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:38:21,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:38:21,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:38:21,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:38:21,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:38:21,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:38:21,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:38:21,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:38:21,186 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:38:21,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:38:21,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:38:21,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:38:21,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:38:21,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:38:21,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:38:21,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:38:21,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:38:21,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:38:21,199 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:38:21,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:38:21,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:38:21,200 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:38:21,200 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:38:21,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:38:21,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:38:21,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:38:21,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:38:21,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:38:21,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:38:21,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:38:21,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:38:21,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:38:21,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:38:21,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:38:21,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:38:21,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:38:21,204 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 [2024-11-09 23:38:21,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:38:21,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:38:21,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:38:21,541 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:38:21,541 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:38:21,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-11-09 23:38:23,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:38:23,271 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:38:23,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-11-09 23:38:23,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090463127/4b32f8cbfb5b4ab5b99c05f4688862b7/FLAGaaafb179b [2024-11-09 23:38:23,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090463127/4b32f8cbfb5b4ab5b99c05f4688862b7 [2024-11-09 23:38:23,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:38:23,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:38:23,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:38:23,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:38:23,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:38:23,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b40094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23, skipping insertion in model container [2024-11-09 23:38:23,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:38:23,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2024-11-09 23:38:23,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:38:23,626 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:38:23,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2024-11-09 23:38:23,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:38:23,718 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:38:23,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23 WrapperNode [2024-11-09 23:38:23,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:38:23,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:38:23,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:38:23,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:38:23,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,779 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-11-09 23:38:23,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:38:23,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:38:23,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:38:23,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:38:23,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 23:38:23,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:38:23,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:38:23,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:38:23,839 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:38:23,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (1/1) ... [2024-11-09 23:38:23,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:38:23,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:38:23,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:38:23,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:38:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:38:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:38:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:38:23,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:38:24,091 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:38:24,093 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:38:24,604 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-09 23:38:24,606 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:38:24,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:38:24,625 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:38:24,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:38:24 BoogieIcfgContainer [2024-11-09 23:38:24,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:38:24,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:38:24,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:38:24,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:38:24,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:38:23" (1/3) ... [2024-11-09 23:38:24,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f303e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:38:24, skipping insertion in model container [2024-11-09 23:38:24,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:23" (2/3) ... [2024-11-09 23:38:24,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f303e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:38:24, skipping insertion in model container [2024-11-09 23:38:24,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:38:24" (3/3) ... [2024-11-09 23:38:24,637 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-11-09 23:38:24,655 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:38:24,655 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:38:24,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:38:24,730 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;@4f5c4bf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:38:24,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:38:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.7481481481481482) internal successors, (236), 136 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 23:38:24,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:24,749 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] [2024-11-09 23:38:24,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:24,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:24,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1218059604, now seen corresponding path program 1 times [2024-11-09 23:38:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:24,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473013586] [2024-11-09 23:38:24,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:24,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:25,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:25,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473013586] [2024-11-09 23:38:25,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473013586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:25,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:25,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:38:25,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864427596] [2024-11-09 23:38:25,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:25,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:38:25,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:25,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:38:25,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:38:25,208 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.7481481481481482) internal successors, (236), 136 states have internal predecessors, (236), 0 states have call successors, (0), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:25,236 INFO L93 Difference]: Finished difference Result 214 states and 363 transitions. [2024-11-09 23:38:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:38:25,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-09 23:38:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:25,247 INFO L225 Difference]: With dead ends: 214 [2024-11-09 23:38:25,247 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 23:38:25,250 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-11-09 23:38:25,253 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:25,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 23:38:25,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-09 23:38:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.7404580152671756) internal successors, (228), 131 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 228 transitions. [2024-11-09 23:38:25,293 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 228 transitions. Word has length 39 [2024-11-09 23:38:25,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:25,294 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 228 transitions. [2024-11-09 23:38:25,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 228 transitions. [2024-11-09 23:38:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 23:38:25,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:25,297 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] [2024-11-09 23:38:25,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:38:25,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:25,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:25,298 INFO L85 PathProgramCache]: Analyzing trace with hash -819996685, now seen corresponding path program 1 times [2024-11-09 23:38:25,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:25,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008262082] [2024-11-09 23:38:25,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:25,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:25,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:25,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008262082] [2024-11-09 23:38:25,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008262082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:25,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:25,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:38:25,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841643656] [2024-11-09 23:38:25,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:25,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:38:25,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:38:25,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:25,609 INFO L87 Difference]: Start difference. First operand 132 states and 228 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:25,711 INFO L93 Difference]: Finished difference Result 208 states and 352 transitions. [2024-11-09 23:38:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:38:25,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-09 23:38:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:25,713 INFO L225 Difference]: With dead ends: 208 [2024-11-09 23:38:25,713 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 23:38:25,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:25,722 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:25,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 869 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 23:38:25,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-09 23:38:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.5114503816793894) internal successors, (198), 131 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 198 transitions. [2024-11-09 23:38:25,734 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 198 transitions. Word has length 39 [2024-11-09 23:38:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:25,734 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 198 transitions. [2024-11-09 23:38:25,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 198 transitions. [2024-11-09 23:38:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:38:25,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:25,737 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] [2024-11-09 23:38:25,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:38:25,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:25,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1086003424, now seen corresponding path program 1 times [2024-11-09 23:38:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:25,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841203325] [2024-11-09 23:38:25,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:25,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:25,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:25,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841203325] [2024-11-09 23:38:25,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841203325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:25,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:25,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:25,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507151981] [2024-11-09 23:38:25,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:25,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:25,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:25,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:25,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:25,954 INFO L87 Difference]: Start difference. First operand 132 states and 198 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:26,034 INFO L93 Difference]: Finished difference Result 262 states and 412 transitions. [2024-11-09 23:38:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:26,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-11-09 23:38:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:26,037 INFO L225 Difference]: With dead ends: 262 [2024-11-09 23:38:26,037 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 23:38:26,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:26,039 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 93 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:26,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 341 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 23:38:26,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-11-09 23:38:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.532258064516129) internal successors, (285), 186 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 285 transitions. [2024-11-09 23:38:26,053 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 285 transitions. Word has length 68 [2024-11-09 23:38:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:26,053 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 285 transitions. [2024-11-09 23:38:26,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:26,054 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 285 transitions. [2024-11-09 23:38:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 23:38:26,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:26,056 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] [2024-11-09 23:38:26,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:38:26,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:26,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:26,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1943313445, now seen corresponding path program 1 times [2024-11-09 23:38:26,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:26,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822034031] [2024-11-09 23:38:26,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:26,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:26,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:26,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822034031] [2024-11-09 23:38:26,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822034031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:26,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:26,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:26,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670273088] [2024-11-09 23:38:26,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:26,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:26,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:26,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:26,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:26,187 INFO L87 Difference]: Start difference. First operand 187 states and 285 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:26,228 INFO L93 Difference]: Finished difference Result 425 states and 671 transitions. [2024-11-09 23:38:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:26,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-09 23:38:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:26,231 INFO L225 Difference]: With dead ends: 425 [2024-11-09 23:38:26,231 INFO L226 Difference]: Without dead ends: 298 [2024-11-09 23:38:26,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:26,236 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 95 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:26,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 360 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:26,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-09 23:38:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 295. [2024-11-09 23:38:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.564625850340136) internal successors, (460), 294 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 460 transitions. [2024-11-09 23:38:26,257 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 460 transitions. Word has length 70 [2024-11-09 23:38:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:26,258 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 460 transitions. [2024-11-09 23:38:26,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 460 transitions. [2024-11-09 23:38:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 23:38:26,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:26,261 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] [2024-11-09 23:38:26,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:38:26,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:26,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:26,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1642963914, now seen corresponding path program 1 times [2024-11-09 23:38:26,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:26,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761998534] [2024-11-09 23:38:26,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:26,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:26,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:26,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761998534] [2024-11-09 23:38:26,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761998534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:26,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:26,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:26,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261330998] [2024-11-09 23:38:26,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:26,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:26,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:26,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:26,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:26,406 INFO L87 Difference]: Start difference. First operand 295 states and 460 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:26,449 INFO L93 Difference]: Finished difference Result 733 states and 1168 transitions. [2024-11-09 23:38:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:26,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-11-09 23:38:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:26,452 INFO L225 Difference]: With dead ends: 733 [2024-11-09 23:38:26,453 INFO L226 Difference]: Without dead ends: 498 [2024-11-09 23:38:26,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:26,457 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 89 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:26,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 361 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-09 23:38:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 495. [2024-11-09 23:38:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 1.5789473684210527) internal successors, (780), 494 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 780 transitions. [2024-11-09 23:38:26,489 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 780 transitions. Word has length 72 [2024-11-09 23:38:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:26,490 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 780 transitions. [2024-11-09 23:38:26,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 780 transitions. [2024-11-09 23:38:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 23:38:26,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:26,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:26,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:38:26,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:26,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:26,499 INFO L85 PathProgramCache]: Analyzing trace with hash -324560847, now seen corresponding path program 1 times [2024-11-09 23:38:26,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:26,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218472154] [2024-11-09 23:38:26,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:26,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:26,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:26,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218472154] [2024-11-09 23:38:26,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218472154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:26,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:26,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:38:26,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931366822] [2024-11-09 23:38:26,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:26,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:38:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:26,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:38:26,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:26,698 INFO L87 Difference]: Start difference. First operand 495 states and 780 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:26,882 INFO L93 Difference]: Finished difference Result 2449 states and 3968 transitions. [2024-11-09 23:38:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:38:26,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-09 23:38:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:26,893 INFO L225 Difference]: With dead ends: 2449 [2024-11-09 23:38:26,893 INFO L226 Difference]: Without dead ends: 2014 [2024-11-09 23:38:26,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:38:26,898 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 786 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:26,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1121 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2024-11-09 23:38:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 899. [2024-11-09 23:38:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 1.599109131403118) internal successors, (1436), 898 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1436 transitions. [2024-11-09 23:38:26,941 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1436 transitions. Word has length 74 [2024-11-09 23:38:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:26,943 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1436 transitions. [2024-11-09 23:38:26,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1436 transitions. [2024-11-09 23:38:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 23:38:26,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:26,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:26,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:38:26,949 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:26,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:26,949 INFO L85 PathProgramCache]: Analyzing trace with hash 190946715, now seen corresponding path program 1 times [2024-11-09 23:38:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:26,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161114246] [2024-11-09 23:38:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:26,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:27,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:27,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161114246] [2024-11-09 23:38:27,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161114246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:27,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:27,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:38:27,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816670486] [2024-11-09 23:38:27,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:27,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:38:27,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:27,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:38:27,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:38:27,114 INFO L87 Difference]: Start difference. First operand 899 states and 1436 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:27,240 INFO L93 Difference]: Finished difference Result 3246 states and 5236 transitions. [2024-11-09 23:38:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:38:27,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-09 23:38:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:27,250 INFO L225 Difference]: With dead ends: 3246 [2024-11-09 23:38:27,250 INFO L226 Difference]: Without dead ends: 2407 [2024-11-09 23:38:27,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:27,253 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 345 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:27,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 637 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2024-11-09 23:38:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 1643. [2024-11-09 23:38:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1642 states have (on average 1.599878197320341) internal successors, (2627), 1642 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2627 transitions. [2024-11-09 23:38:27,302 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2627 transitions. Word has length 75 [2024-11-09 23:38:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:27,302 INFO L471 AbstractCegarLoop]: Abstraction has 1643 states and 2627 transitions. [2024-11-09 23:38:27,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2627 transitions. [2024-11-09 23:38:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 23:38:27,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:27,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:27,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:38:27,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:27,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1065446349, now seen corresponding path program 1 times [2024-11-09 23:38:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:27,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217964738] [2024-11-09 23:38:27,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:27,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:27,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:27,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217964738] [2024-11-09 23:38:27,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217964738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:27,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:27,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:38:27,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683289581] [2024-11-09 23:38:27,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:27,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:38:27,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:27,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:38:27,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:38:27,445 INFO L87 Difference]: Start difference. First operand 1643 states and 2627 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:27,562 INFO L93 Difference]: Finished difference Result 4824 states and 7774 transitions. [2024-11-09 23:38:27,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:38:27,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-09 23:38:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:27,576 INFO L225 Difference]: With dead ends: 4824 [2024-11-09 23:38:27,576 INFO L226 Difference]: Without dead ends: 3241 [2024-11-09 23:38:27,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:27,581 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 344 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:27,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 634 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2024-11-09 23:38:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 2425. [2024-11-09 23:38:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2425 states, 2424 states have (on average 1.5957095709570956) internal successors, (3868), 2424 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2425 states to 2425 states and 3868 transitions. [2024-11-09 23:38:27,675 INFO L78 Accepts]: Start accepts. Automaton has 2425 states and 3868 transitions. Word has length 76 [2024-11-09 23:38:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:27,675 INFO L471 AbstractCegarLoop]: Abstraction has 2425 states and 3868 transitions. [2024-11-09 23:38:27,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 3868 transitions. [2024-11-09 23:38:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 23:38:27,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:27,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:27,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:38:27,680 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:27,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2134597153, now seen corresponding path program 1 times [2024-11-09 23:38:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:27,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152198054] [2024-11-09 23:38:27,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:27,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:27,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:27,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152198054] [2024-11-09 23:38:27,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152198054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:27,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:27,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914957525] [2024-11-09 23:38:27,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:27,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:27,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:27,805 INFO L87 Difference]: Start difference. First operand 2425 states and 3868 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:27,881 INFO L93 Difference]: Finished difference Result 4948 states and 7894 transitions. [2024-11-09 23:38:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:27,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-09 23:38:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:27,895 INFO L225 Difference]: With dead ends: 4948 [2024-11-09 23:38:27,896 INFO L226 Difference]: Without dead ends: 3577 [2024-11-09 23:38:27,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:27,901 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 90 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:27,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 408 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2024-11-09 23:38:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3574. [2024-11-09 23:38:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3574 states, 3573 states have (on average 1.5768261964735517) internal successors, (5634), 3573 states have internal predecessors, (5634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 5634 transitions. [2024-11-09 23:38:27,994 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 5634 transitions. Word has length 76 [2024-11-09 23:38:27,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:27,994 INFO L471 AbstractCegarLoop]: Abstraction has 3574 states and 5634 transitions. [2024-11-09 23:38:27,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 5634 transitions. [2024-11-09 23:38:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 23:38:27,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:27,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:27,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:38:27,996 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:27,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:27,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1879021249, now seen corresponding path program 1 times [2024-11-09 23:38:27,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:27,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765378310] [2024-11-09 23:38:27,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:28,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:28,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765378310] [2024-11-09 23:38:28,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765378310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:28,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:28,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:28,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116684566] [2024-11-09 23:38:28,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:28,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:28,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:28,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:28,075 INFO L87 Difference]: Start difference. First operand 3574 states and 5634 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:28,183 INFO L93 Difference]: Finished difference Result 7770 states and 12242 transitions. [2024-11-09 23:38:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:28,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-09 23:38:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:28,203 INFO L225 Difference]: With dead ends: 7770 [2024-11-09 23:38:28,203 INFO L226 Difference]: Without dead ends: 5303 [2024-11-09 23:38:28,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:28,209 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 96 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:28,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 433 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2024-11-09 23:38:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 5300. [2024-11-09 23:38:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5300 states, 5299 states have (on average 1.5570862426872996) internal successors, (8251), 5299 states have internal predecessors, (8251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5300 states to 5300 states and 8251 transitions. [2024-11-09 23:38:28,348 INFO L78 Accepts]: Start accepts. Automaton has 5300 states and 8251 transitions. Word has length 76 [2024-11-09 23:38:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:28,349 INFO L471 AbstractCegarLoop]: Abstraction has 5300 states and 8251 transitions. [2024-11-09 23:38:28,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 5300 states and 8251 transitions. [2024-11-09 23:38:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 23:38:28,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:28,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:28,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:38:28,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:28,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:28,353 INFO L85 PathProgramCache]: Analyzing trace with hash -715052897, now seen corresponding path program 1 times [2024-11-09 23:38:28,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:28,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824584024] [2024-11-09 23:38:28,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:28,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:28,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:28,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824584024] [2024-11-09 23:38:28,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824584024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:28,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:28,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:28,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938583683] [2024-11-09 23:38:28,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:28,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:28,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:28,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:28,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:28,427 INFO L87 Difference]: Start difference. First operand 5300 states and 8251 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:28,581 INFO L93 Difference]: Finished difference Result 12782 states and 19961 transitions. [2024-11-09 23:38:28,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:28,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-09 23:38:28,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:28,619 INFO L225 Difference]: With dead ends: 12782 [2024-11-09 23:38:28,619 INFO L226 Difference]: Without dead ends: 7561 [2024-11-09 23:38:28,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:28,627 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 102 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:28,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 451 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7561 states. [2024-11-09 23:38:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7561 to 7558. [2024-11-09 23:38:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7558 states, 7557 states have (on average 1.5556437739843854) internal successors, (11756), 7557 states have internal predecessors, (11756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7558 states to 7558 states and 11756 transitions. [2024-11-09 23:38:28,835 INFO L78 Accepts]: Start accepts. Automaton has 7558 states and 11756 transitions. Word has length 76 [2024-11-09 23:38:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:28,835 INFO L471 AbstractCegarLoop]: Abstraction has 7558 states and 11756 transitions. [2024-11-09 23:38:28,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 7558 states and 11756 transitions. [2024-11-09 23:38:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 23:38:28,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:28,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:28,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:38:28,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:28,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1416183971, now seen corresponding path program 1 times [2024-11-09 23:38:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:28,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927303512] [2024-11-09 23:38:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:28,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:28,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927303512] [2024-11-09 23:38:28,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927303512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:28,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:28,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:38:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140270376] [2024-11-09 23:38:28,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:28,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:38:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:28,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:38:28,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:38:28,974 INFO L87 Difference]: Start difference. First operand 7558 states and 11756 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:29,217 INFO L93 Difference]: Finished difference Result 24063 states and 37487 transitions. [2024-11-09 23:38:29,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:38:29,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-09 23:38:29,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:29,269 INFO L225 Difference]: With dead ends: 24063 [2024-11-09 23:38:29,269 INFO L226 Difference]: Without dead ends: 16584 [2024-11-09 23:38:29,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:29,284 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 342 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:29,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 637 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16584 states. [2024-11-09 23:38:29,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16584 to 12017. [2024-11-09 23:38:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12017 states, 12016 states have (on average 1.5428595206391478) internal successors, (18539), 12016 states have internal predecessors, (18539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12017 states to 12017 states and 18539 transitions. [2024-11-09 23:38:29,749 INFO L78 Accepts]: Start accepts. Automaton has 12017 states and 18539 transitions. Word has length 77 [2024-11-09 23:38:29,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:29,749 INFO L471 AbstractCegarLoop]: Abstraction has 12017 states and 18539 transitions. [2024-11-09 23:38:29,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 12017 states and 18539 transitions. [2024-11-09 23:38:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:38:29,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:29,751 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] [2024-11-09 23:38:29,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:38:29,751 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:29,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:29,752 INFO L85 PathProgramCache]: Analyzing trace with hash 949889311, now seen corresponding path program 1 times [2024-11-09 23:38:29,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:29,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873037063] [2024-11-09 23:38:29,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:29,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:30,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:30,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873037063] [2024-11-09 23:38:30,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873037063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:30,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:30,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:38:30,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821718713] [2024-11-09 23:38:30,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:30,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:38:30,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:30,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:38:30,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:30,017 INFO L87 Difference]: Start difference. First operand 12017 states and 18539 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:30,238 INFO L93 Difference]: Finished difference Result 23958 states and 36975 transitions. [2024-11-09 23:38:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:38:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-09 23:38:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:30,267 INFO L225 Difference]: With dead ends: 23958 [2024-11-09 23:38:30,267 INFO L226 Difference]: Without dead ends: 12020 [2024-11-09 23:38:30,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:38:30,287 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 90 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:30,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 688 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12020 states. [2024-11-09 23:38:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12020 to 12017. [2024-11-09 23:38:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12017 states, 12016 states have (on average 1.5303761651131824) internal successors, (18389), 12016 states have internal predecessors, (18389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12017 states to 12017 states and 18389 transitions. [2024-11-09 23:38:30,633 INFO L78 Accepts]: Start accepts. Automaton has 12017 states and 18389 transitions. Word has length 79 [2024-11-09 23:38:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:30,633 INFO L471 AbstractCegarLoop]: Abstraction has 12017 states and 18389 transitions. [2024-11-09 23:38:30,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 12017 states and 18389 transitions. [2024-11-09 23:38:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 23:38:30,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:30,634 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] [2024-11-09 23:38:30,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:38:30,635 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:30,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1478264668, now seen corresponding path program 1 times [2024-11-09 23:38:30,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:30,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240022342] [2024-11-09 23:38:30,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:30,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:30,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:30,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240022342] [2024-11-09 23:38:30,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240022342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:30,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:30,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:38:30,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917462093] [2024-11-09 23:38:30,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:30,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:38:30,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:30,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:38:30,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:30,828 INFO L87 Difference]: Start difference. First operand 12017 states and 18389 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:31,200 INFO L93 Difference]: Finished difference Result 34623 states and 53147 transitions. [2024-11-09 23:38:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:38:31,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-09 23:38:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:31,248 INFO L225 Difference]: With dead ends: 34623 [2024-11-09 23:38:31,248 INFO L226 Difference]: Without dead ends: 22685 [2024-11-09 23:38:31,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:38:31,273 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 171 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:31,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 528 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:31,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22685 states. [2024-11-09 23:38:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22685 to 22682. [2024-11-09 23:38:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22682 states, 22681 states have (on average 1.5187601957585644) internal successors, (34447), 22681 states have internal predecessors, (34447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22682 states to 22682 states and 34447 transitions. [2024-11-09 23:38:31,972 INFO L78 Accepts]: Start accepts. Automaton has 22682 states and 34447 transitions. Word has length 84 [2024-11-09 23:38:31,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:31,972 INFO L471 AbstractCegarLoop]: Abstraction has 22682 states and 34447 transitions. [2024-11-09 23:38:31,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 22682 states and 34447 transitions. [2024-11-09 23:38:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 23:38:31,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:31,973 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] [2024-11-09 23:38:31,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:38:31,974 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:31,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:31,974 INFO L85 PathProgramCache]: Analyzing trace with hash -593363329, now seen corresponding path program 1 times [2024-11-09 23:38:31,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:31,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500129844] [2024-11-09 23:38:31,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:31,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:32,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:32,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500129844] [2024-11-09 23:38:32,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500129844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:32,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:32,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:38:32,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256271126] [2024-11-09 23:38:32,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:32,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:38:32,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:32,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:38:32,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:32,349 INFO L87 Difference]: Start difference. First operand 22682 states and 34447 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:32,538 INFO L93 Difference]: Finished difference Result 23846 states and 35997 transitions. [2024-11-09 23:38:32,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:38:32,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-09 23:38:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:32,589 INFO L225 Difference]: With dead ends: 23846 [2024-11-09 23:38:32,589 INFO L226 Difference]: Without dead ends: 23843 [2024-11-09 23:38:32,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:32,601 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:32,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 766 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23843 states. [2024-11-09 23:38:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23843 to 23843. [2024-11-09 23:38:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23843 states, 23842 states have (on average 1.4931213824343594) internal successors, (35599), 23842 states have internal predecessors, (35599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23843 states to 23843 states and 35599 transitions. [2024-11-09 23:38:33,108 INFO L78 Accepts]: Start accepts. Automaton has 23843 states and 35599 transitions. Word has length 86 [2024-11-09 23:38:33,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:33,108 INFO L471 AbstractCegarLoop]: Abstraction has 23843 states and 35599 transitions. [2024-11-09 23:38:33,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 23843 states and 35599 transitions. [2024-11-09 23:38:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 23:38:33,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:33,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:33,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:38:33,113 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:33,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash -361861814, now seen corresponding path program 1 times [2024-11-09 23:38:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:33,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467584082] [2024-11-09 23:38:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:33,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 23:38:33,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467584082] [2024-11-09 23:38:33,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467584082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:33,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:33,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:38:33,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269986591] [2024-11-09 23:38:33,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:33,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:38:33,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:33,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:38:33,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:33,269 INFO L87 Difference]: Start difference. First operand 23843 states and 35599 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:33,900 INFO L93 Difference]: Finished difference Result 59770 states and 89377 transitions. [2024-11-09 23:38:33,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:38:33,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-09 23:38:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:34,014 INFO L225 Difference]: With dead ends: 59770 [2024-11-09 23:38:34,015 INFO L226 Difference]: Without dead ends: 48723 [2024-11-09 23:38:34,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:38:34,046 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 433 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:34,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 875 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48723 states. [2024-11-09 23:38:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48723 to 37500. [2024-11-09 23:38:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37500 states, 37499 states have (on average 1.488599695991893) internal successors, (55821), 37499 states have internal predecessors, (55821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37500 states to 37500 states and 55821 transitions. [2024-11-09 23:38:35,152 INFO L78 Accepts]: Start accepts. Automaton has 37500 states and 55821 transitions. Word has length 113 [2024-11-09 23:38:35,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:35,153 INFO L471 AbstractCegarLoop]: Abstraction has 37500 states and 55821 transitions. [2024-11-09 23:38:35,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 37500 states and 55821 transitions. [2024-11-09 23:38:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 23:38:35,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:35,158 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:35,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:38:35,159 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:35,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:35,160 INFO L85 PathProgramCache]: Analyzing trace with hash -106285910, now seen corresponding path program 1 times [2024-11-09 23:38:35,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:35,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725889384] [2024-11-09 23:38:35,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:38:35,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:35,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725889384] [2024-11-09 23:38:35,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725889384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:35,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:35,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:38:35,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255740415] [2024-11-09 23:38:35,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:35,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:38:35,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:38:35,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:35,355 INFO L87 Difference]: Start difference. First operand 37500 states and 55821 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:36,096 INFO L93 Difference]: Finished difference Result 64226 states and 96057 transitions. [2024-11-09 23:38:36,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:38:36,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-09 23:38:36,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:36,212 INFO L225 Difference]: With dead ends: 64226 [2024-11-09 23:38:36,213 INFO L226 Difference]: Without dead ends: 53179 [2024-11-09 23:38:36,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:38:36,243 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 432 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:36,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 853 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53179 states. [2024-11-09 23:38:37,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53179 to 50934. [2024-11-09 23:38:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50934 states, 50933 states have (on average 1.488720475919345) internal successors, (75825), 50933 states have internal predecessors, (75825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50934 states to 50934 states and 75825 transitions. [2024-11-09 23:38:37,529 INFO L78 Accepts]: Start accepts. Automaton has 50934 states and 75825 transitions. Word has length 113 [2024-11-09 23:38:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:37,530 INFO L471 AbstractCegarLoop]: Abstraction has 50934 states and 75825 transitions. [2024-11-09 23:38:37,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 50934 states and 75825 transitions. [2024-11-09 23:38:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 23:38:37,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:37,541 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:37,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:38:37,541 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:37,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1057682442, now seen corresponding path program 1 times [2024-11-09 23:38:37,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:37,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416561947] [2024-11-09 23:38:37,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:37,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:38:37,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:37,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416561947] [2024-11-09 23:38:37,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416561947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:37,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:38:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45459816] [2024-11-09 23:38:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:37,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:38:37,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:37,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:38:37,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:37,695 INFO L87 Difference]: Start difference. First operand 50934 states and 75825 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:38,559 INFO L93 Difference]: Finished difference Result 75765 states and 113357 transitions. [2024-11-09 23:38:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:38:38,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-09 23:38:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:38,677 INFO L225 Difference]: With dead ends: 75765 [2024-11-09 23:38:38,677 INFO L226 Difference]: Without dead ends: 62027 [2024-11-09 23:38:38,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:38:38,713 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 428 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:38,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 880 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62027 states. [2024-11-09 23:38:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62027 to 59782. [2024-11-09 23:38:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59782 states, 59781 states have (on average 1.4904233786654624) internal successors, (89099), 59781 states have internal predecessors, (89099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59782 states to 59782 states and 89099 transitions. [2024-11-09 23:38:39,860 INFO L78 Accepts]: Start accepts. Automaton has 59782 states and 89099 transitions. Word has length 113 [2024-11-09 23:38:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:39,860 INFO L471 AbstractCegarLoop]: Abstraction has 59782 states and 89099 transitions. [2024-11-09 23:38:39,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 59782 states and 89099 transitions. [2024-11-09 23:38:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 23:38:39,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:39,863 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:39,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:38:39,864 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:39,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:39,864 INFO L85 PathProgramCache]: Analyzing trace with hash 90815714, now seen corresponding path program 1 times [2024-11-09 23:38:39,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:39,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122646819] [2024-11-09 23:38:39,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:39,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:38:39,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:39,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122646819] [2024-11-09 23:38:39,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122646819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:39,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:39,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:38:39,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388697236] [2024-11-09 23:38:39,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:39,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:38:39,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:39,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:38:39,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:38:39,996 INFO L87 Difference]: Start difference. First operand 59782 states and 89099 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:41,075 INFO L93 Difference]: Finished difference Result 102646 states and 153602 transitions. [2024-11-09 23:38:41,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:38:41,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-09 23:38:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:41,240 INFO L225 Difference]: With dead ends: 102646 [2024-11-09 23:38:41,241 INFO L226 Difference]: Without dead ends: 80060 [2024-11-09 23:38:41,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:38:41,273 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 181 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:41,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 597 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80060 states. [2024-11-09 23:38:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80060 to 77818. [2024-11-09 23:38:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77818 states, 77817 states have (on average 1.4885179330994514) internal successors, (115832), 77817 states have internal predecessors, (115832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77818 states to 77818 states and 115832 transitions. [2024-11-09 23:38:42,929 INFO L78 Accepts]: Start accepts. Automaton has 77818 states and 115832 transitions. Word has length 114 [2024-11-09 23:38:42,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:42,929 INFO L471 AbstractCegarLoop]: Abstraction has 77818 states and 115832 transitions. [2024-11-09 23:38:42,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:42,929 INFO L276 IsEmpty]: Start isEmpty. Operand 77818 states and 115832 transitions. [2024-11-09 23:38:42,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 23:38:42,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:42,932 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:42,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:38:42,932 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:42,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1947240575, now seen corresponding path program 1 times [2024-11-09 23:38:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:42,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764531342] [2024-11-09 23:38:42,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:38:43,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:43,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764531342] [2024-11-09 23:38:43,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764531342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:43,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:43,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382943835] [2024-11-09 23:38:43,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:43,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:43,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:43,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:43,004 INFO L87 Difference]: Start difference. First operand 77818 states and 115832 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:44,678 INFO L93 Difference]: Finished difference Result 178143 states and 265495 transitions. [2024-11-09 23:38:44,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:44,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-09 23:38:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:44,902 INFO L225 Difference]: With dead ends: 178143 [2024-11-09 23:38:44,902 INFO L226 Difference]: Without dead ends: 137418 [2024-11-09 23:38:44,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:44,949 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 75 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:44,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 360 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137418 states. [2024-11-09 23:38:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137418 to 137139. [2024-11-09 23:38:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137139 states, 137138 states have (on average 1.4859192929749596) internal successors, (203776), 137138 states have internal predecessors, (203776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137139 states to 137139 states and 203776 transitions. [2024-11-09 23:38:47,900 INFO L78 Accepts]: Start accepts. Automaton has 137139 states and 203776 transitions. Word has length 114 [2024-11-09 23:38:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:47,900 INFO L471 AbstractCegarLoop]: Abstraction has 137139 states and 203776 transitions. [2024-11-09 23:38:47,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 137139 states and 203776 transitions. [2024-11-09 23:38:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 23:38:47,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:47,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:47,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:38:47,905 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:47,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:47,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1756629396, now seen corresponding path program 1 times [2024-11-09 23:38:47,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:47,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566442698] [2024-11-09 23:38:47,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:47,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:38:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566442698] [2024-11-09 23:38:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566442698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:48,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:48,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:38:48,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495048686] [2024-11-09 23:38:48,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:48,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:38:48,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:48,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:38:48,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:38:48,011 INFO L87 Difference]: Start difference. First operand 137139 states and 203776 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:49,823 INFO L93 Difference]: Finished difference Result 208414 states and 311092 transitions. [2024-11-09 23:38:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:38:49,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 115 [2024-11-09 23:38:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:50,127 INFO L225 Difference]: With dead ends: 208414 [2024-11-09 23:38:50,127 INFO L226 Difference]: Without dead ends: 169697 [2024-11-09 23:38:50,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:38:50,513 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 182 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:50,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 655 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169697 states. [2024-11-09 23:38:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169697 to 160763. [2024-11-09 23:38:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160763 states, 160762 states have (on average 1.485438101043779) internal successors, (238802), 160762 states have internal predecessors, (238802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160763 states to 160763 states and 238802 transitions. [2024-11-09 23:38:53,808 INFO L78 Accepts]: Start accepts. Automaton has 160763 states and 238802 transitions. Word has length 115 [2024-11-09 23:38:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:53,808 INFO L471 AbstractCegarLoop]: Abstraction has 160763 states and 238802 transitions. [2024-11-09 23:38:53,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 160763 states and 238802 transitions. [2024-11-09 23:38:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 23:38:53,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:53,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:53,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 23:38:53,813 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:53,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1469187096, now seen corresponding path program 1 times [2024-11-09 23:38:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:53,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399358678] [2024-11-09 23:38:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:53,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:53,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399358678] [2024-11-09 23:38:53,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399358678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:53,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:53,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242345409] [2024-11-09 23:38:53,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:53,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:53,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:53,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:53,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:53,964 INFO L87 Difference]: Start difference. First operand 160763 states and 238802 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:56,143 INFO L93 Difference]: Finished difference Result 320290 states and 476341 transitions. [2024-11-09 23:38:56,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:56,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-11-09 23:38:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:56,408 INFO L225 Difference]: With dead ends: 320290 [2024-11-09 23:38:56,408 INFO L226 Difference]: Without dead ends: 159606 [2024-11-09 23:38:56,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:56,935 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 75 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:56,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 424 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159606 states. [2024-11-09 23:38:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159606 to 150604. [2024-11-09 23:38:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150604 states, 150603 states have (on average 1.4954748577385577) internal successors, (225223), 150603 states have internal predecessors, (225223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150604 states to 150604 states and 225223 transitions. [2024-11-09 23:38:59,903 INFO L78 Accepts]: Start accepts. Automaton has 150604 states and 225223 transitions. Word has length 115 [2024-11-09 23:38:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:59,903 INFO L471 AbstractCegarLoop]: Abstraction has 150604 states and 225223 transitions. [2024-11-09 23:38:59,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 150604 states and 225223 transitions. [2024-11-09 23:38:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 23:38:59,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:59,907 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:59,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 23:38:59,907 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:59,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:59,908 INFO L85 PathProgramCache]: Analyzing trace with hash 878820783, now seen corresponding path program 1 times [2024-11-09 23:38:59,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:59,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178467176] [2024-11-09 23:38:59,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:59,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:38:59,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:39:00,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178467176] [2024-11-09 23:39:00,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178467176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:39:00,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:39:00,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:39:00,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806298554] [2024-11-09 23:39:00,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:39:00,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:39:00,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:39:00,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:39:00,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:39:00,002 INFO L87 Difference]: Start difference. First operand 150604 states and 225223 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:39:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:39:03,383 INFO L93 Difference]: Finished difference Result 448595 states and 669291 transitions. [2024-11-09 23:39:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:39:03,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-11-09 23:39:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:39:03,991 INFO L225 Difference]: With dead ends: 448595 [2024-11-09 23:39:03,992 INFO L226 Difference]: Without dead ends: 298064 [2024-11-09 23:39:04,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:39:04,128 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 126 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:39:04,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 445 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:39:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298064 states. [2024-11-09 23:39:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298064 to 298061. [2024-11-09 23:39:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298061 states, 298060 states have (on average 1.47969871837885) internal successors, (441039), 298060 states have internal predecessors, (441039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:39:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298061 states to 298061 states and 441039 transitions. [2024-11-09 23:39:09,845 INFO L78 Accepts]: Start accepts. Automaton has 298061 states and 441039 transitions. Word has length 115 [2024-11-09 23:39:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:39:09,846 INFO L471 AbstractCegarLoop]: Abstraction has 298061 states and 441039 transitions. [2024-11-09 23:39:09,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:39:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 298061 states and 441039 transitions. [2024-11-09 23:39:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 23:39:09,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:39:09,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:39:09,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 23:39:09,850 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:39:09,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:39:09,851 INFO L85 PathProgramCache]: Analyzing trace with hash -943690888, now seen corresponding path program 1 times [2024-11-09 23:39:09,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:39:09,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416701146] [2024-11-09 23:39:09,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:39:09,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:39:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:39:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:39:10,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:39:10,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416701146] [2024-11-09 23:39:10,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416701146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:39:10,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:39:10,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:39:10,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116818832] [2024-11-09 23:39:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:39:10,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:39:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:39:10,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:39:10,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:39:10,726 INFO L87 Difference]: Start difference. First operand 298061 states and 441039 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)