./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9a6c0b24d5d607558501714a91a15c3c9ad61c83cb06d37fa1f6444538df81a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:15:12,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:15:12,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:15:12,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:15:12,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:15:12,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:15:12,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:15:12,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:15:12,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:15:12,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:15:12,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:15:12,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:15:12,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:15:12,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:15:12,973 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:15:12,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:15:12,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:15:12,976 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:15:12,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:15:12,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:15:12,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:15:12,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:15:12,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:15:12,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:15:12,980 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:15:12,980 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:15:12,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:15:12,980 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:15:12,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:15:12,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:15:12,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:15:12,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:15:12,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:15:12,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:15:12,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:15:12,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:15:12,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:15:12,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:15:12,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:15:12,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:15:12,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:15:12,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:15:12,984 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 -> b9a6c0b24d5d607558501714a91a15c3c9ad61c83cb06d37fa1f6444538df81a [2024-10-12 20:15:13,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:15:13,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:15:13,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:15:13,246 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:15:13,246 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:15:13,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:15:14,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:15:14,742 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:15:14,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:15:14,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efd8fa77/f652bd3b5f15494dafe82f5fa428b897/FLAG5c83a4386 [2024-10-12 20:15:15,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efd8fa77/f652bd3b5f15494dafe82f5fa428b897 [2024-10-12 20:15:15,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:15:15,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:15:15,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:15:15,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:15:15,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:15:15,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b23b122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15, skipping insertion in model container [2024-10-12 20:15:15,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:15:15,414 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7349,7362] [2024-10-12 20:15:15,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:15:15,466 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:15:15,506 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7349,7362] [2024-10-12 20:15:15,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:15:15,537 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:15:15,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15 WrapperNode [2024-10-12 20:15:15,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:15:15,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:15:15,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:15:15,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:15:15,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,586 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 634 [2024-10-12 20:15:15,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:15:15,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:15:15,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:15:15,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:15:15,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,628 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:15:15,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:15:15,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:15:15,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:15:15,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:15:15,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (1/1) ... [2024-10-12 20:15:15,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:15:15,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:15:15,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:15:15,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:15:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:15:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:15:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:15:15,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:15:15,854 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:15:15,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:15:16,290 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-12 20:15:16,291 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:15:16,328 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:15:16,328 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:15:16,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:15:16 BoogieIcfgContainer [2024-10-12 20:15:16,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:15:16,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:15:16,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:15:16,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:15:16,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:15:15" (1/3) ... [2024-10-12 20:15:16,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43db1799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:15:16, skipping insertion in model container [2024-10-12 20:15:16,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:15" (2/3) ... [2024-10-12 20:15:16,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43db1799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:15:16, skipping insertion in model container [2024-10-12 20:15:16,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:15:16" (3/3) ... [2024-10-12 20:15:16,338 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:15:16,353 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:15:16,353 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:15:16,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:15:16,413 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;@76ea6d8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:15:16,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:15:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7720588235294117) internal successors, (241), 137 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:16,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:15:16,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:16,436 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] [2024-10-12 20:15:16,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:16,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:16,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1083985671, now seen corresponding path program 1 times [2024-10-12 20:15:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:16,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469294466] [2024-10-12 20:15:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:16,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:16,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:16,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469294466] [2024-10-12 20:15:16,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469294466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:16,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:16,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:16,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965367745] [2024-10-12 20:15:16,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:16,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:16,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:16,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:16,874 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7720588235294117) internal successors, (241), 137 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:16,953 INFO L93 Difference]: Finished difference Result 299 states and 508 transitions. [2024-10-12 20:15:16,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:16,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-12 20:15:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:16,972 INFO L225 Difference]: With dead ends: 299 [2024-10-12 20:15:16,973 INFO L226 Difference]: Without dead ends: 210 [2024-10-12 20:15:16,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:16,981 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 137 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:16,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 410 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-12 20:15:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2024-10-12 20:15:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.5825242718446602) internal successors, (326), 206 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 326 transitions. [2024-10-12 20:15:17,091 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 326 transitions. Word has length 55 [2024-10-12 20:15:17,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:17,091 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 326 transitions. [2024-10-12 20:15:17,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2024-10-12 20:15:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 20:15:17,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:17,093 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] [2024-10-12 20:15:17,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:15:17,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:17,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:17,097 INFO L85 PathProgramCache]: Analyzing trace with hash 279150516, now seen corresponding path program 1 times [2024-10-12 20:15:17,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:17,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382927280] [2024-10-12 20:15:17,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:17,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:17,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:17,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382927280] [2024-10-12 20:15:17,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382927280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:17,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:17,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308585919] [2024-10-12 20:15:17,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:17,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:17,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:17,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:17,275 INFO L87 Difference]: Start difference. First operand 207 states and 326 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:17,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:17,328 INFO L93 Difference]: Finished difference Result 501 states and 810 transitions. [2024-10-12 20:15:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:17,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-12 20:15:17,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:17,331 INFO L225 Difference]: With dead ends: 501 [2024-10-12 20:15:17,331 INFO L226 Difference]: Without dead ends: 347 [2024-10-12 20:15:17,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:17,336 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 118 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:17,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 389 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-12 20:15:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2024-10-12 20:15:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.6023391812865497) internal successors, (548), 342 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 548 transitions. [2024-10-12 20:15:17,352 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 548 transitions. Word has length 57 [2024-10-12 20:15:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:17,352 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 548 transitions. [2024-10-12 20:15:17,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 548 transitions. [2024-10-12 20:15:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 20:15:17,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:17,355 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] [2024-10-12 20:15:17,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:15:17,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:17,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash 378017127, now seen corresponding path program 1 times [2024-10-12 20:15:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:17,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340019484] [2024-10-12 20:15:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:17,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:17,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:17,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340019484] [2024-10-12 20:15:17,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340019484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:17,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:17,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:17,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282810010] [2024-10-12 20:15:17,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:17,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:17,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:17,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:17,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:17,473 INFO L87 Difference]: Start difference. First operand 343 states and 548 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:17,504 INFO L93 Difference]: Finished difference Result 895 states and 1450 transitions. [2024-10-12 20:15:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:17,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-10-12 20:15:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:17,508 INFO L225 Difference]: With dead ends: 895 [2024-10-12 20:15:17,508 INFO L226 Difference]: Without dead ends: 605 [2024-10-12 20:15:17,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:17,512 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 113 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:17,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 390 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-10-12 20:15:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 599. [2024-10-12 20:15:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.605351170568562) internal successors, (960), 598 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 960 transitions. [2024-10-12 20:15:17,531 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 960 transitions. Word has length 59 [2024-10-12 20:15:17,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:17,531 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 960 transitions. [2024-10-12 20:15:17,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 960 transitions. [2024-10-12 20:15:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:15:17,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:17,534 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] [2024-10-12 20:15:17,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:15:17,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:17,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash 343933908, now seen corresponding path program 1 times [2024-10-12 20:15:17,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:17,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617867481] [2024-10-12 20:15:17,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:17,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:17,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:17,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617867481] [2024-10-12 20:15:17,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617867481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:17,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:17,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:17,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292769192] [2024-10-12 20:15:17,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:17,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:17,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:17,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:17,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:17,724 INFO L87 Difference]: Start difference. First operand 599 states and 960 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:17,882 INFO L93 Difference]: Finished difference Result 2587 states and 4246 transitions. [2024-10-12 20:15:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:15:17,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-12 20:15:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:17,888 INFO L225 Difference]: With dead ends: 2587 [2024-10-12 20:15:17,889 INFO L226 Difference]: Without dead ends: 2041 [2024-10-12 20:15:17,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:15:17,892 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 855 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:17,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1310 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:15:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2024-10-12 20:15:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 1076. [2024-10-12 20:15:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1075 states have (on average 1.6167441860465117) internal successors, (1738), 1075 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1738 transitions. [2024-10-12 20:15:17,921 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1738 transitions. Word has length 61 [2024-10-12 20:15:17,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:17,923 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1738 transitions. [2024-10-12 20:15:17,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1738 transitions. [2024-10-12 20:15:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 20:15:17,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:17,927 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] [2024-10-12 20:15:17,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:15:17,928 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:17,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:17,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2009512368, now seen corresponding path program 1 times [2024-10-12 20:15:17,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:17,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971006628] [2024-10-12 20:15:17,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:17,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:18,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:18,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971006628] [2024-10-12 20:15:18,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971006628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:18,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:18,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:18,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514094309] [2024-10-12 20:15:18,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:18,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:18,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:18,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:18,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:18,036 INFO L87 Difference]: Start difference. First operand 1076 states and 1738 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:18,143 INFO L93 Difference]: Finished difference Result 3141 states and 5145 transitions. [2024-10-12 20:15:18,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:18,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-12 20:15:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:18,149 INFO L225 Difference]: With dead ends: 3141 [2024-10-12 20:15:18,149 INFO L226 Difference]: Without dead ends: 2118 [2024-10-12 20:15:18,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:18,158 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 404 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:18,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 707 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:15:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2024-10-12 20:15:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1588. [2024-10-12 20:15:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1587 states have (on average 1.6250787649653433) internal successors, (2579), 1587 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2579 transitions. [2024-10-12 20:15:18,186 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2579 transitions. Word has length 62 [2024-10-12 20:15:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:18,186 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 2579 transitions. [2024-10-12 20:15:18,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2579 transitions. [2024-10-12 20:15:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 20:15:18,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:18,190 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] [2024-10-12 20:15:18,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:15:18,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:18,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2107395099, now seen corresponding path program 1 times [2024-10-12 20:15:18,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:18,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247414617] [2024-10-12 20:15:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:18,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:18,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:18,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247414617] [2024-10-12 20:15:18,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247414617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:18,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:18,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:18,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816623306] [2024-10-12 20:15:18,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:18,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:18,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:18,326 INFO L87 Difference]: Start difference. First operand 1588 states and 2579 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:18,393 INFO L93 Difference]: Finished difference Result 4609 states and 7543 transitions. [2024-10-12 20:15:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:18,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-12 20:15:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:18,400 INFO L225 Difference]: With dead ends: 4609 [2024-10-12 20:15:18,400 INFO L226 Difference]: Without dead ends: 3074 [2024-10-12 20:15:18,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:18,403 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 402 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:18,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 713 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2024-10-12 20:15:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 2319. [2024-10-12 20:15:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2319 states, 2318 states have (on average 1.624676445211389) internal successors, (3766), 2318 states have internal predecessors, (3766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3766 transitions. [2024-10-12 20:15:18,463 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3766 transitions. Word has length 63 [2024-10-12 20:15:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:18,464 INFO L471 AbstractCegarLoop]: Abstraction has 2319 states and 3766 transitions. [2024-10-12 20:15:18,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3766 transitions. [2024-10-12 20:15:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 20:15:18,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:18,465 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] [2024-10-12 20:15:18,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:15:18,465 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:18,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2100793239, now seen corresponding path program 1 times [2024-10-12 20:15:18,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:18,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473634883] [2024-10-12 20:15:18,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:18,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:18,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473634883] [2024-10-12 20:15:18,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473634883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:18,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:18,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:18,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585773653] [2024-10-12 20:15:18,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:18,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:18,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:18,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:18,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:18,526 INFO L87 Difference]: Start difference. First operand 2319 states and 3766 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:18,556 INFO L93 Difference]: Finished difference Result 5109 states and 8341 transitions. [2024-10-12 20:15:18,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:18,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 20:15:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:18,565 INFO L225 Difference]: With dead ends: 5109 [2024-10-12 20:15:18,566 INFO L226 Difference]: Without dead ends: 3500 [2024-10-12 20:15:18,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:18,570 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 117 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:18,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 461 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2024-10-12 20:15:18,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 3498. [2024-10-12 20:15:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3497 states have (on average 1.6219616814412354) internal successors, (5672), 3497 states have internal predecessors, (5672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 5672 transitions. [2024-10-12 20:15:18,663 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 5672 transitions. Word has length 64 [2024-10-12 20:15:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:18,664 INFO L471 AbstractCegarLoop]: Abstraction has 3498 states and 5672 transitions. [2024-10-12 20:15:18,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 5672 transitions. [2024-10-12 20:15:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 20:15:18,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:18,666 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] [2024-10-12 20:15:18,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:15:18,666 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:18,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:18,666 INFO L85 PathProgramCache]: Analyzing trace with hash -229150136, now seen corresponding path program 1 times [2024-10-12 20:15:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:18,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933130452] [2024-10-12 20:15:18,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:18,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933130452] [2024-10-12 20:15:18,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933130452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:18,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:18,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843143321] [2024-10-12 20:15:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:18,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:18,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:18,744 INFO L87 Difference]: Start difference. First operand 3498 states and 5672 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:18,780 INFO L93 Difference]: Finished difference Result 6916 states and 11272 transitions. [2024-10-12 20:15:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:18,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 20:15:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:18,794 INFO L225 Difference]: With dead ends: 6916 [2024-10-12 20:15:18,794 INFO L226 Difference]: Without dead ends: 4916 [2024-10-12 20:15:18,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:18,798 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 112 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:18,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 444 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4916 states. [2024-10-12 20:15:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4916 to 4914. [2024-10-12 20:15:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4914 states, 4913 states have (on average 1.618155912884185) internal successors, (7950), 4913 states have internal predecessors, (7950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4914 states to 4914 states and 7950 transitions. [2024-10-12 20:15:18,864 INFO L78 Accepts]: Start accepts. Automaton has 4914 states and 7950 transitions. Word has length 64 [2024-10-12 20:15:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:18,865 INFO L471 AbstractCegarLoop]: Abstraction has 4914 states and 7950 transitions. [2024-10-12 20:15:18,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4914 states and 7950 transitions. [2024-10-12 20:15:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 20:15:18,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:18,866 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] [2024-10-12 20:15:18,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:15:18,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:18,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash 851350487, now seen corresponding path program 1 times [2024-10-12 20:15:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042113357] [2024-10-12 20:15:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:18,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:18,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042113357] [2024-10-12 20:15:18,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042113357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:18,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:18,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:18,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344751392] [2024-10-12 20:15:18,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:18,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:18,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:18,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:18,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:18,945 INFO L87 Difference]: Start difference. First operand 4914 states and 7950 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:19,075 INFO L93 Difference]: Finished difference Result 15143 states and 24630 transitions. [2024-10-12 20:15:19,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:19,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 20:15:19,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:19,104 INFO L225 Difference]: With dead ends: 15143 [2024-10-12 20:15:19,108 INFO L226 Difference]: Without dead ends: 10362 [2024-10-12 20:15:19,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:19,113 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 400 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:19,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 581 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10362 states. [2024-10-12 20:15:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10362 to 7612. [2024-10-12 20:15:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7612 states, 7611 states have (on average 1.6145053212455656) internal successors, (12288), 7611 states have internal predecessors, (12288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7612 states to 7612 states and 12288 transitions. [2024-10-12 20:15:19,232 INFO L78 Accepts]: Start accepts. Automaton has 7612 states and 12288 transitions. Word has length 64 [2024-10-12 20:15:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:19,232 INFO L471 AbstractCegarLoop]: Abstraction has 7612 states and 12288 transitions. [2024-10-12 20:15:19,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 7612 states and 12288 transitions. [2024-10-12 20:15:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 20:15:19,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:19,233 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] [2024-10-12 20:15:19,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:15:19,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:19,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1956399438, now seen corresponding path program 1 times [2024-10-12 20:15:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:19,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983541229] [2024-10-12 20:15:19,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:19,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:19,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:19,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983541229] [2024-10-12 20:15:19,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983541229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:19,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:19,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:19,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553174852] [2024-10-12 20:15:19,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:19,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:19,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:19,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:19,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:19,312 INFO L87 Difference]: Start difference. First operand 7612 states and 12288 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:19,356 INFO L93 Difference]: Finished difference Result 16686 states and 27283 transitions. [2024-10-12 20:15:19,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:19,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 20:15:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:19,373 INFO L225 Difference]: With dead ends: 16686 [2024-10-12 20:15:19,373 INFO L226 Difference]: Without dead ends: 11161 [2024-10-12 20:15:19,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:19,382 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 122 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:19,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 487 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11161 states. [2024-10-12 20:15:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11161 to 11159. [2024-10-12 20:15:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11159 states, 11158 states have (on average 1.6189281233195914) internal successors, (18064), 11158 states have internal predecessors, (18064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11159 states to 11159 states and 18064 transitions. [2024-10-12 20:15:19,688 INFO L78 Accepts]: Start accepts. Automaton has 11159 states and 18064 transitions. Word has length 64 [2024-10-12 20:15:19,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:19,688 INFO L471 AbstractCegarLoop]: Abstraction has 11159 states and 18064 transitions. [2024-10-12 20:15:19,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 11159 states and 18064 transitions. [2024-10-12 20:15:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 20:15:19,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:19,689 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] [2024-10-12 20:15:19,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:15:19,690 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:19,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash 586720488, now seen corresponding path program 1 times [2024-10-12 20:15:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:19,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734610558] [2024-10-12 20:15:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:19,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:19,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734610558] [2024-10-12 20:15:19,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734610558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:19,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:19,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:19,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270684752] [2024-10-12 20:15:19,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:19,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:19,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:19,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:19,869 INFO L87 Difference]: Start difference. First operand 11159 states and 18064 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:20,018 INFO L93 Difference]: Finished difference Result 22240 states and 36019 transitions. [2024-10-12 20:15:20,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:20,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-12 20:15:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:20,033 INFO L225 Difference]: With dead ends: 22240 [2024-10-12 20:15:20,033 INFO L226 Difference]: Without dead ends: 11161 [2024-10-12 20:15:20,044 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-10-12 20:15:20,045 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 227 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:20,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 577 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:15:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11161 states. [2024-10-12 20:15:20,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11161 to 11159. [2024-10-12 20:15:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11159 states, 11158 states have (on average 1.6077253988169924) internal successors, (17939), 11158 states have internal predecessors, (17939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11159 states to 11159 states and 17939 transitions. [2024-10-12 20:15:20,149 INFO L78 Accepts]: Start accepts. Automaton has 11159 states and 17939 transitions. Word has length 66 [2024-10-12 20:15:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:20,150 INFO L471 AbstractCegarLoop]: Abstraction has 11159 states and 17939 transitions. [2024-10-12 20:15:20,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 11159 states and 17939 transitions. [2024-10-12 20:15:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:15:20,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:20,151 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] [2024-10-12 20:15:20,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:15:20,151 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:20,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash 719582349, now seen corresponding path program 1 times [2024-10-12 20:15:20,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:20,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516803750] [2024-10-12 20:15:20,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:20,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:20,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:20,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516803750] [2024-10-12 20:15:20,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516803750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:20,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:20,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:20,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884886110] [2024-10-12 20:15:20,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:20,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:20,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:20,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:20,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:20,370 INFO L87 Difference]: Start difference. First operand 11159 states and 17939 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:20,511 INFO L93 Difference]: Finished difference Result 31942 states and 51511 transitions. [2024-10-12 20:15:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:20,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-12 20:15:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:20,544 INFO L225 Difference]: With dead ends: 31942 [2024-10-12 20:15:20,545 INFO L226 Difference]: Without dead ends: 20863 [2024-10-12 20:15:20,560 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-10-12 20:15:20,561 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 223 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:20,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 581 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20863 states. [2024-10-12 20:15:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20863 to 20861. [2024-10-12 20:15:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20861 states, 20860 states have (on average 1.595973154362416) internal successors, (33292), 20860 states have internal predecessors, (33292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20861 states to 20861 states and 33292 transitions. [2024-10-12 20:15:20,859 INFO L78 Accepts]: Start accepts. Automaton has 20861 states and 33292 transitions. Word has length 69 [2024-10-12 20:15:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:20,860 INFO L471 AbstractCegarLoop]: Abstraction has 20861 states and 33292 transitions. [2024-10-12 20:15:20,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 20861 states and 33292 transitions. [2024-10-12 20:15:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 20:15:20,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:20,861 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-10-12 20:15:20,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:15:20,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:20,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash 830307045, now seen corresponding path program 1 times [2024-10-12 20:15:20,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:20,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579865205] [2024-10-12 20:15:20,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:21,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:21,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579865205] [2024-10-12 20:15:21,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579865205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:21,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:21,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:21,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539436709] [2024-10-12 20:15:21,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:21,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:21,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:21,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:21,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:21,160 INFO L87 Difference]: Start difference. First operand 20861 states and 33292 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-10-12 20:15:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:21,229 INFO L93 Difference]: Finished difference Result 21587 states and 34379 transitions. [2024-10-12 20:15:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:21,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-10-12 20:15:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:21,270 INFO L225 Difference]: With dead ends: 21587 [2024-10-12 20:15:21,270 INFO L226 Difference]: Without dead ends: 21585 [2024-10-12 20:15:21,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:21,280 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:21,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 815 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21585 states. [2024-10-12 20:15:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21585 to 21585. [2024-10-12 20:15:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21585 states, 21584 states have (on average 1.575565233506301) internal successors, (34007), 21584 states have internal predecessors, (34007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21585 states to 21585 states and 34007 transitions. [2024-10-12 20:15:21,684 INFO L78 Accepts]: Start accepts. Automaton has 21585 states and 34007 transitions. Word has length 70 [2024-10-12 20:15:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:21,684 INFO L471 AbstractCegarLoop]: Abstraction has 21585 states and 34007 transitions. [2024-10-12 20:15:21,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-10-12 20:15:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 21585 states and 34007 transitions. [2024-10-12 20:15:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:15:21,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:21,686 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] [2024-10-12 20:15:21,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:15:21,686 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:21,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:21,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1291649415, now seen corresponding path program 1 times [2024-10-12 20:15:21,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:21,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865639198] [2024-10-12 20:15:21,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:21,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:15:21,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:21,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865639198] [2024-10-12 20:15:21,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865639198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:21,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:21,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:21,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807306812] [2024-10-12 20:15:21,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:21,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:21,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:21,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:21,891 INFO L87 Difference]: Start difference. First operand 21585 states and 34007 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:22,077 INFO L93 Difference]: Finished difference Result 52601 states and 83211 transitions. [2024-10-12 20:15:22,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:22,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-12 20:15:22,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:22,140 INFO L225 Difference]: With dead ends: 52601 [2024-10-12 20:15:22,140 INFO L226 Difference]: Without dead ends: 42409 [2024-10-12 20:15:22,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-12 20:15:22,163 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 509 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:22,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1000 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:15:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42409 states. [2024-10-12 20:15:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42409 to 33119. [2024-10-12 20:15:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33119 states, 33118 states have (on average 1.5748233588984841) internal successors, (52155), 33118 states have internal predecessors, (52155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33119 states to 33119 states and 52155 transitions. [2024-10-12 20:15:22,732 INFO L78 Accepts]: Start accepts. Automaton has 33119 states and 52155 transitions. Word has length 92 [2024-10-12 20:15:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:22,732 INFO L471 AbstractCegarLoop]: Abstraction has 33119 states and 52155 transitions. [2024-10-12 20:15:22,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 33119 states and 52155 transitions. [2024-10-12 20:15:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:15:22,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:22,737 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] [2024-10-12 20:15:22,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:15:22,737 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:22,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash 673374506, now seen corresponding path program 1 times [2024-10-12 20:15:22,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:22,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888417039] [2024-10-12 20:15:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 20:15:22,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:22,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888417039] [2024-10-12 20:15:22,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888417039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:22,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:22,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946649733] [2024-10-12 20:15:22,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:22,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:22,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:22,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:22,896 INFO L87 Difference]: Start difference. First operand 33119 states and 52155 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:23,350 INFO L93 Difference]: Finished difference Result 56653 states and 89647 transitions. [2024-10-12 20:15:23,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:23,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-12 20:15:23,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:23,446 INFO L225 Difference]: With dead ends: 56653 [2024-10-12 20:15:23,446 INFO L226 Difference]: Without dead ends: 46461 [2024-10-12 20:15:23,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-12 20:15:23,465 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 513 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:23,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1001 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:15:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46461 states. [2024-10-12 20:15:24,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46461 to 44807. [2024-10-12 20:15:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44807 states, 44806 states have (on average 1.5761058786769628) internal successors, (70619), 44806 states have internal predecessors, (70619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44807 states to 44807 states and 70619 transitions. [2024-10-12 20:15:24,152 INFO L78 Accepts]: Start accepts. Automaton has 44807 states and 70619 transitions. Word has length 92 [2024-10-12 20:15:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:24,153 INFO L471 AbstractCegarLoop]: Abstraction has 44807 states and 70619 transitions. [2024-10-12 20:15:24,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 44807 states and 70619 transitions. [2024-10-12 20:15:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:15:24,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:24,155 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] [2024-10-12 20:15:24,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:15:24,155 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:24,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:24,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1436043216, now seen corresponding path program 1 times [2024-10-12 20:15:24,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:24,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110536973] [2024-10-12 20:15:24,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:24,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 20:15:24,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:24,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110536973] [2024-10-12 20:15:24,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110536973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:24,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:24,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:24,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758288890] [2024-10-12 20:15:24,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:24,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:24,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:24,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:24,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:24,278 INFO L87 Difference]: Start difference. First operand 44807 states and 70619 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:24,584 INFO L93 Difference]: Finished difference Result 63523 states and 100707 transitions. [2024-10-12 20:15:24,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:24,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-12 20:15:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:24,657 INFO L225 Difference]: With dead ends: 63523 [2024-10-12 20:15:24,658 INFO L226 Difference]: Without dead ends: 53101 [2024-10-12 20:15:24,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-12 20:15:24,684 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 520 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:24,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 956 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:15:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53101 states. [2024-10-12 20:15:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53101 to 51447. [2024-10-12 20:15:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51447 states, 51446 states have (on average 1.579112078684446) internal successors, (81239), 51446 states have internal predecessors, (81239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51447 states to 51447 states and 81239 transitions. [2024-10-12 20:15:25,605 INFO L78 Accepts]: Start accepts. Automaton has 51447 states and 81239 transitions. Word has length 92 [2024-10-12 20:15:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:25,606 INFO L471 AbstractCegarLoop]: Abstraction has 51447 states and 81239 transitions. [2024-10-12 20:15:25,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 51447 states and 81239 transitions. [2024-10-12 20:15:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:15:25,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:25,608 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:15:25,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:15:25,609 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:25,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1630170924, now seen corresponding path program 1 times [2024-10-12 20:15:25,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:25,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519445061] [2024-10-12 20:15:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:25,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 20:15:25,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:25,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519445061] [2024-10-12 20:15:25,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519445061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:25,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:25,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:25,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081579061] [2024-10-12 20:15:25,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:25,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:25,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:25,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:25,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:25,749 INFO L87 Difference]: Start difference. First operand 51447 states and 81239 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:26,061 INFO L93 Difference]: Finished difference Result 83820 states and 133088 transitions. [2024-10-12 20:15:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:26,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-12 20:15:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:26,179 INFO L225 Difference]: With dead ends: 83820 [2024-10-12 20:15:26,180 INFO L226 Difference]: Without dead ends: 66758 [2024-10-12 20:15:26,217 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-10-12 20:15:26,218 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 230 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:26,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 663 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66758 states. [2024-10-12 20:15:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66758 to 65106. [2024-10-12 20:15:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65106 states, 65105 states have (on average 1.5796175408954765) internal successors, (102841), 65105 states have internal predecessors, (102841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65106 states to 65106 states and 102841 transitions. [2024-10-12 20:15:27,248 INFO L78 Accepts]: Start accepts. Automaton has 65106 states and 102841 transitions. Word has length 93 [2024-10-12 20:15:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:27,248 INFO L471 AbstractCegarLoop]: Abstraction has 65106 states and 102841 transitions. [2024-10-12 20:15:27,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 65106 states and 102841 transitions. [2024-10-12 20:15:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:15:27,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:27,253 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:15:27,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:15:27,257 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:27,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1430700236, now seen corresponding path program 1 times [2024-10-12 20:15:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:27,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304501445] [2024-10-12 20:15:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 20:15:27,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:27,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304501445] [2024-10-12 20:15:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304501445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:27,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:27,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:27,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516152066] [2024-10-12 20:15:27,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:27,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:27,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:27,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:27,353 INFO L87 Difference]: Start difference. First operand 65106 states and 102841 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:28,561 INFO L93 Difference]: Finished difference Result 140451 states and 222733 transitions. [2024-10-12 20:15:28,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:28,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-12 20:15:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:28,920 INFO L225 Difference]: With dead ends: 140451 [2024-10-12 20:15:28,921 INFO L226 Difference]: Without dead ends: 109891 [2024-10-12 20:15:28,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:28,987 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 103 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:28,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 384 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109891 states. [2024-10-12 20:15:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109891 to 109613. [2024-10-12 20:15:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109613 states, 109612 states have (on average 1.5803014268510747) internal successors, (173220), 109612 states have internal predecessors, (173220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109613 states to 109613 states and 173220 transitions. [2024-10-12 20:15:31,148 INFO L78 Accepts]: Start accepts. Automaton has 109613 states and 173220 transitions. Word has length 93 [2024-10-12 20:15:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:31,148 INFO L471 AbstractCegarLoop]: Abstraction has 109613 states and 173220 transitions. [2024-10-12 20:15:31,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 109613 states and 173220 transitions. [2024-10-12 20:15:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:15:31,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:31,150 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:15:31,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:15:31,151 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:31,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2025115264, now seen corresponding path program 1 times [2024-10-12 20:15:31,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:31,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987659095] [2024-10-12 20:15:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:15:31,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:31,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987659095] [2024-10-12 20:15:31,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987659095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:31,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:31,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:31,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773357139] [2024-10-12 20:15:31,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:31,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:31,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:31,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:31,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:31,230 INFO L87 Difference]: Start difference. First operand 109613 states and 173220 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:32,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:32,149 INFO L93 Difference]: Finished difference Result 167652 states and 265951 transitions. [2024-10-12 20:15:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:32,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-12 20:15:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:32,419 INFO L225 Difference]: With dead ends: 167652 [2024-10-12 20:15:32,419 INFO L226 Difference]: Without dead ends: 136008 [2024-10-12 20:15:32,449 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-10-12 20:15:32,453 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 231 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:32,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 723 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136008 states. [2024-10-12 20:15:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136008 to 129428. [2024-10-12 20:15:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129428 states, 129427 states have (on average 1.5792068115617297) internal successors, (204392), 129427 states have internal predecessors, (204392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129428 states to 129428 states and 204392 transitions. [2024-10-12 20:15:34,453 INFO L78 Accepts]: Start accepts. Automaton has 129428 states and 204392 transitions. Word has length 94 [2024-10-12 20:15:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:34,453 INFO L471 AbstractCegarLoop]: Abstraction has 129428 states and 204392 transitions. [2024-10-12 20:15:34,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 129428 states and 204392 transitions. [2024-10-12 20:15:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:15:34,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:34,456 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:15:34,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:15:34,456 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:34,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:34,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1718673077, now seen corresponding path program 1 times [2024-10-12 20:15:34,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:34,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294198313] [2024-10-12 20:15:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:34,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:15:34,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:34,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294198313] [2024-10-12 20:15:34,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294198313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:34,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:34,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:34,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561156720] [2024-10-12 20:15:34,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:34,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:34,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:34,529 INFO L87 Difference]: Start difference. First operand 129428 states and 204392 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:35,373 INFO L93 Difference]: Finished difference Result 273651 states and 433258 transitions. [2024-10-12 20:15:35,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:35,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-12 20:15:35,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:35,792 INFO L225 Difference]: With dead ends: 273651 [2024-10-12 20:15:35,792 INFO L226 Difference]: Without dead ends: 212559 [2024-10-12 20:15:35,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:35,903 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 103 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:35,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 383 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212559 states. [2024-10-12 20:15:38,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212559 to 212029. [2024-10-12 20:15:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212029 states, 212028 states have (on average 1.5781453392948102) internal successors, (334611), 212028 states have internal predecessors, (334611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212029 states to 212029 states and 334611 transitions. [2024-10-12 20:15:39,249 INFO L78 Accepts]: Start accepts. Automaton has 212029 states and 334611 transitions. Word has length 94 [2024-10-12 20:15:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:39,249 INFO L471 AbstractCegarLoop]: Abstraction has 212029 states and 334611 transitions. [2024-10-12 20:15:39,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 212029 states and 334611 transitions. [2024-10-12 20:15:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:15:39,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:39,252 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:15:39,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:15:39,252 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:39,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:39,252 INFO L85 PathProgramCache]: Analyzing trace with hash -754923130, now seen corresponding path program 1 times [2024-10-12 20:15:39,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:39,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628977600] [2024-10-12 20:15:39,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:39,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:39,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:39,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628977600] [2024-10-12 20:15:39,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628977600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:39,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:39,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542368656] [2024-10-12 20:15:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:39,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:39,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:39,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:39,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:39,299 INFO L87 Difference]: Start difference. First operand 212029 states and 334611 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:42,352 INFO L93 Difference]: Finished difference Result 625230 states and 986600 transitions. [2024-10-12 20:15:42,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:42,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:15:42,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:43,963 INFO L225 Difference]: With dead ends: 625230 [2024-10-12 20:15:43,964 INFO L226 Difference]: Without dead ends: 413270 [2024-10-12 20:15:44,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:44,069 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 142 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:44,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 470 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413270 states. [2024-10-12 20:15:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413270 to 413268. [2024-10-12 20:15:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413268 states, 413267 states have (on average 1.567901622921743) internal successors, (647962), 413267 states have internal predecessors, (647962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413268 states to 413268 states and 647962 transitions. [2024-10-12 20:15:50,280 INFO L78 Accepts]: Start accepts. Automaton has 413268 states and 647962 transitions. Word has length 94 [2024-10-12 20:15:50,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:50,280 INFO L471 AbstractCegarLoop]: Abstraction has 413268 states and 647962 transitions. [2024-10-12 20:15:50,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 413268 states and 647962 transitions. [2024-10-12 20:15:50,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:15:50,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:50,285 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:15:50,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:15:50,285 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:50,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:50,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1296747900, now seen corresponding path program 1 times [2024-10-12 20:15:50,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:50,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009467015] [2024-10-12 20:15:50,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:50,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:15:50,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:50,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009467015] [2024-10-12 20:15:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009467015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:50,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:50,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:50,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322556633] [2024-10-12 20:15:50,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:50,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:50,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:50,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:50,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:50,332 INFO L87 Difference]: Start difference. First operand 413268 states and 647962 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:56,373 INFO L93 Difference]: Finished difference Result 1216712 states and 1907367 transitions. [2024-10-12 20:15:56,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:56,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:15:56,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:58,148 INFO L225 Difference]: With dead ends: 1216712 [2024-10-12 20:15:58,148 INFO L226 Difference]: Without dead ends: 803580 [2024-10-12 20:15:58,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:58,409 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 160 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:58,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 504 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803580 states.