./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.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 291c2115713bbaa0f9f6deebfd096e226de91dfa7091a11105c0815d1cda6526 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:48:39,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:48:39,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:48:39,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:48:39,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:48:39,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:48:39,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:48:39,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:48:39,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:48:39,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:48:39,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:48:39,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:48:39,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:48:39,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:48:39,218 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:48:39,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:48:39,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:48:39,219 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:48:39,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:48:39,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:48:39,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:48:39,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:48:39,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:48:39,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:48:39,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:48:39,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:48:39,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:48:39,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:48:39,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:48:39,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:48:39,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:48:39,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:48:39,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:48:39,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:48:39,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:48:39,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:48:39,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:48:39,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:48:39,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:48:39,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:48:39,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:48:39,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:48:39,238 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 -> 291c2115713bbaa0f9f6deebfd096e226de91dfa7091a11105c0815d1cda6526 [2024-11-08 15:48:39,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:48:39,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:48:39,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:48:39,539 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:48:39,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:48:39,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:48:40,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:48:41,207 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:48:41,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:48:41,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef07c3ea/a1330bd2620f484291763e0953872a54/FLAG9d88f8c9d [2024-11-08 15:48:41,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef07c3ea/a1330bd2620f484291763e0953872a54 [2024-11-08 15:48:41,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:48:41,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:48:41,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:48:41,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:48:41,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:48:41,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f644e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41, skipping insertion in model container [2024-11-08 15:48:41,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:48:41,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7181,7194] [2024-11-08 15:48:41,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:48:41,613 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:48:41,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7181,7194] [2024-11-08 15:48:41,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:48:41,707 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:48:41,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41 WrapperNode [2024-11-08 15:48:41,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:48:41,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:48:41,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:48:41,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:48:41,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,767 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 616 [2024-11-08 15:48:41,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:48:41,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:48:41,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:48:41,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:48:41,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,807 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:48:41,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:48:41,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:48:41,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:48:41,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:48:41,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (1/1) ... [2024-11-08 15:48:41,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:48:41,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:48:41,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:48:41,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:48:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:48:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:48:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:48:41,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:48:42,085 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:48:42,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:48:42,660 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-08 15:48:42,660 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:48:42,678 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:48:42,681 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:48:42,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:48:42 BoogieIcfgContainer [2024-11-08 15:48:42,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:48:42,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:48:42,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:48:42,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:48:42,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:48:41" (1/3) ... [2024-11-08 15:48:42,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f21bd87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:48:42, skipping insertion in model container [2024-11-08 15:48:42,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:48:41" (2/3) ... [2024-11-08 15:48:42,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f21bd87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:48:42, skipping insertion in model container [2024-11-08 15:48:42,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:48:42" (3/3) ... [2024-11-08 15:48:42,692 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:48:42,706 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:48:42,706 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:48:42,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:48:42,775 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;@3dfcdc39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:48:42,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:48:42,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 132 states have (on average 1.75) internal successors, (231), 133 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:42,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 15:48:42,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:42,789 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] [2024-11-08 15:48:42,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:42,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash -278043806, now seen corresponding path program 1 times [2024-11-08 15:48:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:42,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41676822] [2024-11-08 15:48:42,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:42,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:43,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:43,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41676822] [2024-11-08 15:48:43,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41676822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:43,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:43,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:48:43,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12858315] [2024-11-08 15:48:43,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:43,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:48:43,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:43,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:48:43,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:43,337 INFO L87 Difference]: Start difference. First operand has 134 states, 132 states have (on average 1.75) internal successors, (231), 133 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:43,465 INFO L93 Difference]: Finished difference Result 297 states and 500 transitions. [2024-11-08 15:48:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:48:43,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-08 15:48:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:43,493 INFO L225 Difference]: With dead ends: 297 [2024-11-08 15:48:43,496 INFO L226 Difference]: Without dead ends: 205 [2024-11-08 15:48:43,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:43,504 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 132 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:43,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 406 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:48:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-08 15:48:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2024-11-08 15:48:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.5970149253731343) internal successors, (321), 201 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 321 transitions. [2024-11-08 15:48:43,555 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 321 transitions. Word has length 50 [2024-11-08 15:48:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:43,556 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 321 transitions. [2024-11-08 15:48:43,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 321 transitions. [2024-11-08 15:48:43,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:48:43,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:43,559 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] [2024-11-08 15:48:43,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:48:43,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:43,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1333847823, now seen corresponding path program 1 times [2024-11-08 15:48:43,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:43,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747491189] [2024-11-08 15:48:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:43,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:43,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:43,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747491189] [2024-11-08 15:48:43,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747491189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:43,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:43,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:48:43,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147561257] [2024-11-08 15:48:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:43,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:48:43,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:43,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:48:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:43,754 INFO L87 Difference]: Start difference. First operand 202 states and 321 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:43,805 INFO L93 Difference]: Finished difference Result 496 states and 805 transitions. [2024-11-08 15:48:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:48:43,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-08 15:48:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:43,811 INFO L225 Difference]: With dead ends: 496 [2024-11-08 15:48:43,812 INFO L226 Difference]: Without dead ends: 342 [2024-11-08 15:48:43,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:43,815 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 118 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:43,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 385 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:48:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-08 15:48:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2024-11-08 15:48:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 1.6112759643916914) internal successors, (543), 337 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 543 transitions. [2024-11-08 15:48:43,842 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 543 transitions. Word has length 52 [2024-11-08 15:48:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:43,842 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 543 transitions. [2024-11-08 15:48:43,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 543 transitions. [2024-11-08 15:48:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 15:48:43,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:43,848 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] [2024-11-08 15:48:43,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:48:43,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:43,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:43,849 INFO L85 PathProgramCache]: Analyzing trace with hash 329846722, now seen corresponding path program 1 times [2024-11-08 15:48:43,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:43,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029465073] [2024-11-08 15:48:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:43,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:44,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029465073] [2024-11-08 15:48:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029465073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:44,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:44,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:48:44,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001150968] [2024-11-08 15:48:44,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:44,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:48:44,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:44,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:48:44,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:44,111 INFO L87 Difference]: Start difference. First operand 338 states and 543 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:44,150 INFO L93 Difference]: Finished difference Result 890 states and 1445 transitions. [2024-11-08 15:48:44,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:48:44,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-08 15:48:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:44,153 INFO L225 Difference]: With dead ends: 890 [2024-11-08 15:48:44,153 INFO L226 Difference]: Without dead ends: 600 [2024-11-08 15:48:44,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:44,157 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 113 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:44,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 386 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:48:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-08 15:48:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 594. [2024-11-08 15:48:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.6104553119730185) internal successors, (955), 593 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 955 transitions. [2024-11-08 15:48:44,186 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 955 transitions. Word has length 54 [2024-11-08 15:48:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:44,187 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 955 transitions. [2024-11-08 15:48:44,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 955 transitions. [2024-11-08 15:48:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 15:48:44,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:44,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] [2024-11-08 15:48:44,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:48:44,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:44,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1296814383, now seen corresponding path program 1 times [2024-11-08 15:48:44,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:44,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461953952] [2024-11-08 15:48:44,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:44,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:44,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461953952] [2024-11-08 15:48:44,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461953952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:44,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:44,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:48:44,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088391571] [2024-11-08 15:48:44,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:44,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:48:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:44,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:48:44,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:48:44,329 INFO L87 Difference]: Start difference. First operand 594 states and 955 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:44,503 INFO L93 Difference]: Finished difference Result 2582 states and 4241 transitions. [2024-11-08 15:48:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:48:44,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-08 15:48:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:44,513 INFO L225 Difference]: With dead ends: 2582 [2024-11-08 15:48:44,513 INFO L226 Difference]: Without dead ends: 2036 [2024-11-08 15:48:44,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:48:44,516 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 855 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:44,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1288 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:48:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2024-11-08 15:48:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1071. [2024-11-08 15:48:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.6196261682242992) internal successors, (1733), 1070 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1733 transitions. [2024-11-08 15:48:44,555 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1733 transitions. Word has length 56 [2024-11-08 15:48:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:44,556 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1733 transitions. [2024-11-08 15:48:44,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1733 transitions. [2024-11-08 15:48:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 15:48:44,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:44,561 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-11-08 15:48:44,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:48:44,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:44,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1484036003, now seen corresponding path program 1 times [2024-11-08 15:48:44,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:44,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848469400] [2024-11-08 15:48:44,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:44,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:44,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:44,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848469400] [2024-11-08 15:48:44,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848469400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:44,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:44,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:48:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112826315] [2024-11-08 15:48:44,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:44,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:48:44,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:44,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:48:44,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:48:44,687 INFO L87 Difference]: Start difference. First operand 1071 states and 1733 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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-11-08 15:48:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:44,767 INFO L93 Difference]: Finished difference Result 3136 states and 5140 transitions. [2024-11-08 15:48:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:48:44,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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-11-08 15:48:44,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:44,775 INFO L225 Difference]: With dead ends: 3136 [2024-11-08 15:48:44,776 INFO L226 Difference]: Without dead ends: 2113 [2024-11-08 15:48:44,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:48:44,778 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 404 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:44,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 606 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:48:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2024-11-08 15:48:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1583. [2024-11-08 15:48:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1582 states have (on average 1.6270543615676358) internal successors, (2574), 1582 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2574 transitions. [2024-11-08 15:48:44,826 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2574 transitions. Word has length 57 [2024-11-08 15:48:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:44,826 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2574 transitions. [2024-11-08 15:48:44,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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-11-08 15:48:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2574 transitions. [2024-11-08 15:48:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 15:48:44,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:44,828 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] [2024-11-08 15:48:44,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:48:44,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:44,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:44,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1297470346, now seen corresponding path program 1 times [2024-11-08 15:48:44,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:44,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384069278] [2024-11-08 15:48:44,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:44,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:44,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384069278] [2024-11-08 15:48:44,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384069278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:44,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:44,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:48:44,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163200793] [2024-11-08 15:48:44,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:44,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:48:44,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:44,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:48:44,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:48:44,938 INFO L87 Difference]: Start difference. First operand 1583 states and 2574 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:45,016 INFO L93 Difference]: Finished difference Result 4604 states and 7538 transitions. [2024-11-08 15:48:45,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:48:45,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-08 15:48:45,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:45,030 INFO L225 Difference]: With dead ends: 4604 [2024-11-08 15:48:45,031 INFO L226 Difference]: Without dead ends: 3069 [2024-11-08 15:48:45,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:48:45,036 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 402 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:45,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 647 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:48:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2024-11-08 15:48:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2314. [2024-11-08 15:48:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 2313 states have (on average 1.6260268050151319) internal successors, (3761), 2313 states have internal predecessors, (3761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3761 transitions. [2024-11-08 15:48:45,101 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3761 transitions. Word has length 58 [2024-11-08 15:48:45,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:45,103 INFO L471 AbstractCegarLoop]: Abstraction has 2314 states and 3761 transitions. [2024-11-08 15:48:45,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3761 transitions. [2024-11-08 15:48:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 15:48:45,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:45,105 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-11-08 15:48:45,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:48:45,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:45,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:45,106 INFO L85 PathProgramCache]: Analyzing trace with hash -370820470, now seen corresponding path program 1 times [2024-11-08 15:48:45,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:45,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540208796] [2024-11-08 15:48:45,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:45,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:45,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540208796] [2024-11-08 15:48:45,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540208796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:45,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:45,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:48:45,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127777616] [2024-11-08 15:48:45,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:45,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:48:45,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:45,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:48:45,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:45,219 INFO L87 Difference]: Start difference. First operand 2314 states and 3761 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-11-08 15:48:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:45,282 INFO L93 Difference]: Finished difference Result 5104 states and 8336 transitions. [2024-11-08 15:48:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:48:45,283 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-11-08 15:48:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:45,295 INFO L225 Difference]: With dead ends: 5104 [2024-11-08 15:48:45,296 INFO L226 Difference]: Without dead ends: 3495 [2024-11-08 15:48:45,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:45,301 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 117 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:45,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 451 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:48:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2024-11-08 15:48:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3493. [2024-11-08 15:48:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3493 states, 3492 states have (on average 1.622852233676976) internal successors, (5667), 3492 states have internal predecessors, (5667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 3493 states and 5667 transitions. [2024-11-08 15:48:45,406 INFO L78 Accepts]: Start accepts. Automaton has 3493 states and 5667 transitions. Word has length 59 [2024-11-08 15:48:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:45,406 INFO L471 AbstractCegarLoop]: Abstraction has 3493 states and 5667 transitions. [2024-11-08 15:48:45,406 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-11-08 15:48:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3493 states and 5667 transitions. [2024-11-08 15:48:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 15:48:45,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:45,408 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-11-08 15:48:45,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:48:45,408 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:45,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1594203451, now seen corresponding path program 1 times [2024-11-08 15:48:45,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:45,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17749147] [2024-11-08 15:48:45,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:45,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:45,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:45,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17749147] [2024-11-08 15:48:45,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17749147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:45,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:45,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:48:45,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933398275] [2024-11-08 15:48:45,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:45,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:48:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:45,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:48:45,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:45,485 INFO L87 Difference]: Start difference. First operand 3493 states and 5667 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-11-08 15:48:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:45,527 INFO L93 Difference]: Finished difference Result 6911 states and 11267 transitions. [2024-11-08 15:48:45,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:48:45,527 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-11-08 15:48:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:45,545 INFO L225 Difference]: With dead ends: 6911 [2024-11-08 15:48:45,545 INFO L226 Difference]: Without dead ends: 4911 [2024-11-08 15:48:45,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:45,550 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 112 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:45,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 434 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:48:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2024-11-08 15:48:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4909. [2024-11-08 15:48:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4909 states, 4908 states have (on average 1.6187856560717195) internal successors, (7945), 4908 states have internal predecessors, (7945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 7945 transitions. [2024-11-08 15:48:45,643 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 7945 transitions. Word has length 59 [2024-11-08 15:48:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:45,644 INFO L471 AbstractCegarLoop]: Abstraction has 4909 states and 7945 transitions. [2024-11-08 15:48:45,644 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-11-08 15:48:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 7945 transitions. [2024-11-08 15:48:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 15:48:45,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:45,645 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-11-08 15:48:45,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:48:45,645 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:45,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1620263222, now seen corresponding path program 1 times [2024-11-08 15:48:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:45,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179715528] [2024-11-08 15:48:45,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:45,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:45,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:45,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179715528] [2024-11-08 15:48:45,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179715528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:45,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:45,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:48:45,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012300348] [2024-11-08 15:48:45,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:45,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:48:45,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:45,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:48:45,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:48:45,749 INFO L87 Difference]: Start difference. First operand 4909 states and 7945 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-11-08 15:48:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:45,915 INFO L93 Difference]: Finished difference Result 15138 states and 24625 transitions. [2024-11-08 15:48:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:48:45,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-11-08 15:48:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:45,953 INFO L225 Difference]: With dead ends: 15138 [2024-11-08 15:48:45,954 INFO L226 Difference]: Without dead ends: 10357 [2024-11-08 15:48:45,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:48:45,962 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 400 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:45,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 565 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:48:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10357 states. [2024-11-08 15:48:46,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10357 to 7607. [2024-11-08 15:48:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7607 states, 7606 states have (on average 1.6149092821456745) internal successors, (12283), 7606 states have internal predecessors, (12283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7607 states to 7607 states and 12283 transitions. [2024-11-08 15:48:46,160 INFO L78 Accepts]: Start accepts. Automaton has 7607 states and 12283 transitions. Word has length 59 [2024-11-08 15:48:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:46,160 INFO L471 AbstractCegarLoop]: Abstraction has 7607 states and 12283 transitions. [2024-11-08 15:48:46,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-11-08 15:48:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 7607 states and 12283 transitions. [2024-11-08 15:48:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 15:48:46,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:46,162 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-11-08 15:48:46,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:48:46,162 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:46,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash -515214271, now seen corresponding path program 1 times [2024-11-08 15:48:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:46,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538741239] [2024-11-08 15:48:46,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:46,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:46,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538741239] [2024-11-08 15:48:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538741239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:46,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:46,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:48:46,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545114317] [2024-11-08 15:48:46,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:46,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:48:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:46,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:48:46,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:46,223 INFO L87 Difference]: Start difference. First operand 7607 states and 12283 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-11-08 15:48:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:46,296 INFO L93 Difference]: Finished difference Result 16681 states and 27278 transitions. [2024-11-08 15:48:46,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:48:46,297 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-11-08 15:48:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:46,318 INFO L225 Difference]: With dead ends: 16681 [2024-11-08 15:48:46,318 INFO L226 Difference]: Without dead ends: 11156 [2024-11-08 15:48:46,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:46,328 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 122 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:46,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 477 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:48:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11156 states. [2024-11-08 15:48:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11156 to 11154. [2024-11-08 15:48:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11154 states, 11153 states have (on average 1.6192055949072) internal successors, (18059), 11153 states have internal predecessors, (18059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11154 states to 11154 states and 18059 transitions. [2024-11-08 15:48:46,540 INFO L78 Accepts]: Start accepts. Automaton has 11154 states and 18059 transitions. Word has length 59 [2024-11-08 15:48:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:46,541 INFO L471 AbstractCegarLoop]: Abstraction has 11154 states and 18059 transitions. [2024-11-08 15:48:46,541 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-11-08 15:48:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 11154 states and 18059 transitions. [2024-11-08 15:48:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 15:48:46,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:46,542 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-11-08 15:48:46,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:48:46,542 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:46,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash 482860251, now seen corresponding path program 1 times [2024-11-08 15:48:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:46,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618968036] [2024-11-08 15:48:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:46,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:46,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618968036] [2024-11-08 15:48:46,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618968036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:46,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:46,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:48:46,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079108605] [2024-11-08 15:48:46,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:46,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:48:46,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:46,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:48:46,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:48:46,755 INFO L87 Difference]: Start difference. First operand 11154 states and 18059 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-11-08 15:48:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:46,905 INFO L93 Difference]: Finished difference Result 22235 states and 36014 transitions. [2024-11-08 15:48:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:48:46,905 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-11-08 15:48:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:46,930 INFO L225 Difference]: With dead ends: 22235 [2024-11-08 15:48:46,930 INFO L226 Difference]: Without dead ends: 11156 [2024-11-08 15:48:46,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:48:46,948 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 227 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:46,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 559 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:48:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11156 states. [2024-11-08 15:48:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11156 to 11154. [2024-11-08 15:48:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11154 states, 11153 states have (on average 1.6079978481126154) internal successors, (17934), 11153 states have internal predecessors, (17934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11154 states to 11154 states and 17934 transitions. [2024-11-08 15:48:47,204 INFO L78 Accepts]: Start accepts. Automaton has 11154 states and 17934 transitions. Word has length 61 [2024-11-08 15:48:47,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:47,205 INFO L471 AbstractCegarLoop]: Abstraction has 11154 states and 17934 transitions. [2024-11-08 15:48:47,205 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-11-08 15:48:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 11154 states and 17934 transitions. [2024-11-08 15:48:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 15:48:47,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:47,206 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-11-08 15:48:47,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:48:47,206 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:47,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:47,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1004302872, now seen corresponding path program 1 times [2024-11-08 15:48:47,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:47,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918829631] [2024-11-08 15:48:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:47,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:47,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:47,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918829631] [2024-11-08 15:48:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918829631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:47,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:47,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:48:47,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036030519] [2024-11-08 15:48:47,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:47,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:48:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:47,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:48:47,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:48:47,388 INFO L87 Difference]: Start difference. First operand 11154 states and 17934 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-11-08 15:48:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:47,571 INFO L93 Difference]: Finished difference Result 31937 states and 51506 transitions. [2024-11-08 15:48:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:48:47,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-11-08 15:48:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:47,608 INFO L225 Difference]: With dead ends: 31937 [2024-11-08 15:48:47,609 INFO L226 Difference]: Without dead ends: 20858 [2024-11-08 15:48:47,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:48:47,626 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 223 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:47,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 567 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:48:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20858 states. [2024-11-08 15:48:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20858 to 20856. [2024-11-08 15:48:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20856 states, 20855 states have (on average 1.596116039319108) internal successors, (33287), 20855 states have internal predecessors, (33287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20856 states to 20856 states and 33287 transitions. [2024-11-08 15:48:48,026 INFO L78 Accepts]: Start accepts. Automaton has 20856 states and 33287 transitions. Word has length 64 [2024-11-08 15:48:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:48,027 INFO L471 AbstractCegarLoop]: Abstraction has 20856 states and 33287 transitions. [2024-11-08 15:48:48,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-11-08 15:48:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 20856 states and 33287 transitions. [2024-11-08 15:48:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 15:48:48,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:48,029 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] [2024-11-08 15:48:48,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:48:48,029 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:48,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:48,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1070527272, now seen corresponding path program 1 times [2024-11-08 15:48:48,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:48,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037077957] [2024-11-08 15:48:48,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:48,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:48:48,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:48,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037077957] [2024-11-08 15:48:48,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037077957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:48,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:48,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:48:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834316619] [2024-11-08 15:48:48,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:48,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:48:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:48,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:48:48,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:48:48,446 INFO L87 Difference]: Start difference. First operand 20856 states and 33287 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:48,554 INFO L93 Difference]: Finished difference Result 21582 states and 34374 transitions. [2024-11-08 15:48:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:48:48,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-08 15:48:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:48,602 INFO L225 Difference]: With dead ends: 21582 [2024-11-08 15:48:48,602 INFO L226 Difference]: Without dead ends: 21580 [2024-11-08 15:48:48,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:48:48,613 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:48,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 796 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:48:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21580 states. [2024-11-08 15:48:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21580 to 21580. [2024-11-08 15:48:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21580 states, 21579 states have (on average 1.5756985958570833) internal successors, (34002), 21579 states have internal predecessors, (34002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21580 states to 21580 states and 34002 transitions. [2024-11-08 15:48:49,102 INFO L78 Accepts]: Start accepts. Automaton has 21580 states and 34002 transitions. Word has length 65 [2024-11-08 15:48:49,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:49,103 INFO L471 AbstractCegarLoop]: Abstraction has 21580 states and 34002 transitions. [2024-11-08 15:48:49,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 21580 states and 34002 transitions. [2024-11-08 15:48:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 15:48:49,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:49,105 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] [2024-11-08 15:48:49,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:48:49,105 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:49,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1104420716, now seen corresponding path program 1 times [2024-11-08 15:48:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:49,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509574900] [2024-11-08 15:48:49,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:49,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:48:49,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:49,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509574900] [2024-11-08 15:48:49,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509574900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:49,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:49,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:48:49,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037469090] [2024-11-08 15:48:49,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:49,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:48:49,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:49,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:48:49,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:48:49,405 INFO L87 Difference]: Start difference. First operand 21580 states and 34002 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-11-08 15:48:49,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:49,627 INFO L93 Difference]: Finished difference Result 52596 states and 83206 transitions. [2024-11-08 15:48:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:48:49,628 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 87 [2024-11-08 15:48:49,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:49,700 INFO L225 Difference]: With dead ends: 52596 [2024-11-08 15:48:49,701 INFO L226 Difference]: Without dead ends: 42404 [2024-11-08 15:48:49,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:48:49,726 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 508 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:49,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 976 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:48:49,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42404 states. [2024-11-08 15:48:50,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42404 to 33114. [2024-11-08 15:48:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33114 states, 33113 states have (on average 1.5749101561320327) internal successors, (52150), 33113 states have internal predecessors, (52150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33114 states to 33114 states and 52150 transitions. [2024-11-08 15:48:50,460 INFO L78 Accepts]: Start accepts. Automaton has 33114 states and 52150 transitions. Word has length 87 [2024-11-08 15:48:50,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:50,461 INFO L471 AbstractCegarLoop]: Abstraction has 33114 states and 52150 transitions. [2024-11-08 15:48:50,461 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-11-08 15:48:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 33114 states and 52150 transitions. [2024-11-08 15:48:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 15:48:50,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:50,464 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] [2024-11-08 15:48:50,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:48:50,465 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:50,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:50,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1225522659, now seen corresponding path program 1 times [2024-11-08 15:48:50,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765759803] [2024-11-08 15:48:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 15:48:50,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:50,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765759803] [2024-11-08 15:48:50,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765759803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:50,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:50,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:48:50,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10021679] [2024-11-08 15:48:50,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:50,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:48:50,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:50,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:48:50,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:48:50,652 INFO L87 Difference]: Start difference. First operand 33114 states and 52150 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:51,138 INFO L93 Difference]: Finished difference Result 56648 states and 89642 transitions. [2024-11-08 15:48:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:48:51,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-08 15:48:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:51,224 INFO L225 Difference]: With dead ends: 56648 [2024-11-08 15:48:51,225 INFO L226 Difference]: Without dead ends: 46456 [2024-11-08 15:48:51,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:48:51,245 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 516 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:51,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 909 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:48:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46456 states. [2024-11-08 15:48:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46456 to 44802. [2024-11-08 15:48:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44802 states, 44801 states have (on average 1.5761701747728845) internal successors, (70614), 44801 states have internal predecessors, (70614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44802 states to 44802 states and 70614 transitions. [2024-11-08 15:48:52,080 INFO L78 Accepts]: Start accepts. Automaton has 44802 states and 70614 transitions. Word has length 87 [2024-11-08 15:48:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:52,080 INFO L471 AbstractCegarLoop]: Abstraction has 44802 states and 70614 transitions. [2024-11-08 15:48:52,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 44802 states and 70614 transitions. [2024-11-08 15:48:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 15:48:52,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:52,087 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] [2024-11-08 15:48:52,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:48:52,088 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:52,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash 960026915, now seen corresponding path program 1 times [2024-11-08 15:48:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:52,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146615150] [2024-11-08 15:48:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:52,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:48:52,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:52,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146615150] [2024-11-08 15:48:52,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146615150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:52,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:52,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:48:52,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134311658] [2024-11-08 15:48:52,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:52,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:48:52,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:52,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:48:52,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:48:52,262 INFO L87 Difference]: Start difference. First operand 44802 states and 70614 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-11-08 15:48:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:52,752 INFO L93 Difference]: Finished difference Result 63518 states and 100702 transitions. [2024-11-08 15:48:52,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:48:52,756 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 87 [2024-11-08 15:48:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:52,880 INFO L225 Difference]: With dead ends: 63518 [2024-11-08 15:48:52,880 INFO L226 Difference]: Without dead ends: 53096 [2024-11-08 15:48:52,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:48:52,905 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 507 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:52,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 947 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:48:52,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53096 states. [2024-11-08 15:48:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53096 to 51442. [2024-11-08 15:48:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51442 states, 51441 states have (on average 1.5791683676444859) internal successors, (81234), 51441 states have internal predecessors, (81234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51442 states to 51442 states and 81234 transitions. [2024-11-08 15:48:53,545 INFO L78 Accepts]: Start accepts. Automaton has 51442 states and 81234 transitions. Word has length 87 [2024-11-08 15:48:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:53,546 INFO L471 AbstractCegarLoop]: Abstraction has 51442 states and 81234 transitions. [2024-11-08 15:48:53,546 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-11-08 15:48:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 51442 states and 81234 transitions. [2024-11-08 15:48:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 15:48:53,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:53,548 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] [2024-11-08 15:48:53,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:48:53,549 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1600537049, now seen corresponding path program 1 times [2024-11-08 15:48:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:53,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988692641] [2024-11-08 15:48:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:48:53,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:53,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988692641] [2024-11-08 15:48:53,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988692641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:53,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:53,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:48:53,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787331285] [2024-11-08 15:48:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:53,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:48:53,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:53,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:48:53,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:53,626 INFO L87 Difference]: Start difference. First operand 51442 states and 81234 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:54,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:54,248 INFO L93 Difference]: Finished difference Result 113249 states and 179766 transitions. [2024-11-08 15:48:54,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:48:54,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-08 15:48:54,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:54,434 INFO L225 Difference]: With dead ends: 113249 [2024-11-08 15:48:54,435 INFO L226 Difference]: Without dead ends: 82689 [2024-11-08 15:48:54,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:54,491 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 103 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:54,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 372 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:48:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82689 states. [2024-11-08 15:48:55,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82689 to 82484. [2024-11-08 15:48:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82484 states, 82483 states have (on average 1.581804735521259) internal successors, (130472), 82483 states have internal predecessors, (130472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82484 states to 82484 states and 130472 transitions. [2024-11-08 15:48:55,860 INFO L78 Accepts]: Start accepts. Automaton has 82484 states and 130472 transitions. Word has length 88 [2024-11-08 15:48:55,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:55,861 INFO L471 AbstractCegarLoop]: Abstraction has 82484 states and 130472 transitions. [2024-11-08 15:48:55,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 82484 states and 130472 transitions. [2024-11-08 15:48:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 15:48:55,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:55,863 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] [2024-11-08 15:48:55,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:48:55,864 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:55,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash -366440913, now seen corresponding path program 1 times [2024-11-08 15:48:55,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:55,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892757328] [2024-11-08 15:48:55,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:55,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:48:55,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:55,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892757328] [2024-11-08 15:48:55,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892757328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:55,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:55,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:48:55,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356039702] [2024-11-08 15:48:55,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:55,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:48:55,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:55,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:48:55,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:48:55,981 INFO L87 Difference]: Start difference. First operand 82484 states and 130472 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:56,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:56,759 INFO L93 Difference]: Finished difference Result 147005 states and 233501 transitions. [2024-11-08 15:48:56,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:48:56,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-08 15:48:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:48:56,933 INFO L225 Difference]: With dead ends: 147005 [2024-11-08 15:48:56,933 INFO L226 Difference]: Without dead ends: 112965 [2024-11-08 15:48:56,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:48:56,964 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 230 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:48:56,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 650 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:48:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112965 states. [2024-11-08 15:48:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112965 to 109608. [2024-11-08 15:48:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109608 states, 109607 states have (on average 1.5803278987655898) internal successors, (173215), 109607 states have internal predecessors, (173215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109608 states to 109608 states and 173215 transitions. [2024-11-08 15:48:58,950 INFO L78 Accepts]: Start accepts. Automaton has 109608 states and 173215 transitions. Word has length 88 [2024-11-08 15:48:58,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:48:58,950 INFO L471 AbstractCegarLoop]: Abstraction has 109608 states and 173215 transitions. [2024-11-08 15:48:58,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 109608 states and 173215 transitions. [2024-11-08 15:48:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 15:48:58,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:48:58,953 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] [2024-11-08 15:48:58,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:48:58,953 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:48:58,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:48:58,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2055369560, now seen corresponding path program 1 times [2024-11-08 15:48:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:48:58,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685860590] [2024-11-08 15:48:58,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:48:58,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:48:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:48:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:48:59,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:48:59,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685860590] [2024-11-08 15:48:59,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685860590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:48:59,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:48:59,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:48:59,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037674380] [2024-11-08 15:48:59,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:48:59,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:48:59,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:48:59,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:48:59,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:48:59,028 INFO L87 Difference]: Start difference. First operand 109608 states and 173215 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:48:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:48:59,730 INFO L93 Difference]: Finished difference Result 234263 states and 371403 transitions. [2024-11-08 15:48:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:48:59,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-08 15:48:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:00,546 INFO L225 Difference]: With dead ends: 234263 [2024-11-08 15:49:00,546 INFO L226 Difference]: Without dead ends: 173171 [2024-11-08 15:49:00,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:00,597 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 103 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:00,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 372 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173171 states. [2024-11-08 15:49:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173171 to 172768. [2024-11-08 15:49:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172768 states, 172767 states have (on average 1.5809558538378279) internal successors, (273137), 172767 states have internal predecessors, (273137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:49:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172768 states to 172768 states and 273137 transitions. [2024-11-08 15:49:02,956 INFO L78 Accepts]: Start accepts. Automaton has 172768 states and 273137 transitions. Word has length 89 [2024-11-08 15:49:02,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:02,956 INFO L471 AbstractCegarLoop]: Abstraction has 172768 states and 273137 transitions. [2024-11-08 15:49:02,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:49:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 172768 states and 273137 transitions. [2024-11-08 15:49:02,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 15:49:02,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:02,960 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] [2024-11-08 15:49:02,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 15:49:02,961 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:02,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1504190605, now seen corresponding path program 1 times [2024-11-08 15:49:02,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:02,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521425568] [2024-11-08 15:49:02,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:02,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:49:03,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:03,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521425568] [2024-11-08 15:49:03,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521425568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:03,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:03,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239515593] [2024-11-08 15:49:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:03,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:49:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:03,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:49:03,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:03,101 INFO L87 Difference]: Start difference. First operand 172768 states and 273137 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:49:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:04,856 INFO L93 Difference]: Finished difference Result 288375 states and 457258 transitions. [2024-11-08 15:49:04,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:04,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-08 15:49:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:05,266 INFO L225 Difference]: With dead ends: 288375 [2024-11-08 15:49:05,266 INFO L226 Difference]: Without dead ends: 225243 [2024-11-08 15:49:05,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:05,333 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 238 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:05,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 644 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225243 states. [2024-11-08 15:49:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225243 to 212024. [2024-11-08 15:49:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212024 states, 212023 states have (on average 1.5781589733189323) internal successors, (334606), 212023 states have internal predecessors, (334606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:49:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212024 states to 212024 states and 334606 transitions. [2024-11-08 15:49:09,205 INFO L78 Accepts]: Start accepts. Automaton has 212024 states and 334606 transitions. Word has length 89 [2024-11-08 15:49:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:09,206 INFO L471 AbstractCegarLoop]: Abstraction has 212024 states and 334606 transitions. [2024-11-08 15:49:09,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:49:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 212024 states and 334606 transitions. [2024-11-08 15:49:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 15:49:09,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:09,208 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] [2024-11-08 15:49:09,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 15:49:09,209 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:09,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:09,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1817672559, now seen corresponding path program 1 times [2024-11-08 15:49:09,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:09,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253920196] [2024-11-08 15:49:09,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:09,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:09,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253920196] [2024-11-08 15:49:09,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253920196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:09,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:09,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:09,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228900407] [2024-11-08 15:49:09,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:09,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:09,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:09,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:09,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:09,305 INFO L87 Difference]: Start difference. First operand 212024 states and 334606 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-11-08 15:49:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:12,127 INFO L93 Difference]: Finished difference Result 624512 states and 985531 transitions. [2024-11-08 15:49:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:12,128 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 89 [2024-11-08 15:49:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:13,066 INFO L225 Difference]: With dead ends: 624512 [2024-11-08 15:49:13,067 INFO L226 Difference]: Without dead ends: 412563 [2024-11-08 15:49:13,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:13,246 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 154 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:13,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 487 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412563 states. [2024-11-08 15:49:18,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412563 to 412561. [2024-11-08 15:49:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412561 states, 412560 states have (on average 1.5676095598216018) internal successors, (646733), 412560 states have internal predecessors, (646733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:49:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412561 states to 412561 states and 646733 transitions. [2024-11-08 15:49:21,037 INFO L78 Accepts]: Start accepts. Automaton has 412561 states and 646733 transitions. Word has length 89 [2024-11-08 15:49:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:21,037 INFO L471 AbstractCegarLoop]: Abstraction has 412561 states and 646733 transitions. [2024-11-08 15:49:21,037 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-11-08 15:49:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 412561 states and 646733 transitions. [2024-11-08 15:49:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 15:49:21,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:21,041 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] [2024-11-08 15:49:21,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 15:49:21,041 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:21,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:21,041 INFO L85 PathProgramCache]: Analyzing trace with hash -233998471, now seen corresponding path program 1 times [2024-11-08 15:49:21,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:21,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675431861] [2024-11-08 15:49:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:21,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:21,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675431861] [2024-11-08 15:49:21,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675431861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:21,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:21,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:21,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735150877] [2024-11-08 15:49:21,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:21,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:21,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:21,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:21,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:21,121 INFO L87 Difference]: Start difference. First operand 412561 states and 646733 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-11-08 15:49:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:26,508 INFO L93 Difference]: Finished difference Result 1216003 states and 1905785 transitions. [2024-11-08 15:49:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:26,509 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 89 [2024-11-08 15:49:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted.