./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.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/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:40:42,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:40:42,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:40:42,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:40:42,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:40:42,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:40:42,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:40:42,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:40:42,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:40:42,181 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:40:42,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:40:42,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:40:42,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:40:42,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:40:42,182 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:40:42,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:40:42,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:40:42,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:40:42,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:40:42,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:40:42,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:40:42,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:40:42,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:40:42,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:40:42,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:40:42,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:40:42,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:40:42,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:40:42,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:40:42,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:40:42,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:40:42,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:40:42,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:40:42,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:40:42,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:40:42,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:40:42,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:40:42,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:40:42,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:40:42,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:40:42,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:40:42,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:40:42,191 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 -> 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 [2024-11-08 15:40:42,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:40:42,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:40:42,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:40:42,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:40:42,403 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:40:42,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-11-08 15:40:43,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:40:44,015 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:40:44,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-11-08 15:40:44,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4813a41/95f37e3da47545e793facfcdf30feff7/FLAG20f9412fc [2024-11-08 15:40:44,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4813a41/95f37e3da47545e793facfcdf30feff7 [2024-11-08 15:40:44,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:40:44,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:40:44,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:40:44,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:40:44,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:40:44,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:40:44" (1/1) ... [2024-11-08 15:40:44,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566c7dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44, skipping insertion in model container [2024-11-08 15:40:44,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:40:44" (1/1) ... [2024-11-08 15:40:44,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:40:44,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2024-11-08 15:40:44,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:40:44,354 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:40:44,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2024-11-08 15:40:44,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:40:44,422 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:40:44,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44 WrapperNode [2024-11-08 15:40:44,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:40:44,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:40:44,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:40:44,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:40:44,438 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:40:44" (1/1) ... [2024-11-08 15:40:44,447 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:40:44" (1/1) ... [2024-11-08 15:40:44,479 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 496 [2024-11-08 15:40:44,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:40:44,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:40:44,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:40:44,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:40:44,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44" (1/1) ... [2024-11-08 15:40:44,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44" (1/1) ... [2024-11-08 15:40:44,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44" (1/1) ... [2024-11-08 15:40:44,517 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:40:44,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44" (1/1) ... [2024-11-08 15:40:44,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44" (1/1) ... [2024-11-08 15:40:44,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44" (1/1) ... [2024-11-08 15:40:44,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44" (1/1) ... [2024-11-08 15:40:44,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44" (1/1) ... [2024-11-08 15:40:44,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44" (1/1) ... [2024-11-08 15:40:44,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:40:44,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:40:44,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:40:44,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:40:44,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44" (1/1) ... [2024-11-08 15:40:44,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:40:44,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:40:44,583 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:40:44,617 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:40:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:40:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:40:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:40:44,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:40:44,782 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:40:44,783 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:40:45,190 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-08 15:40:45,190 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:40:45,209 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:40:45,210 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 15:40:45,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:40:45 BoogieIcfgContainer [2024-11-08 15:40:45,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:40:45,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:40:45,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:40:45,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:40:45,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:40:44" (1/3) ... [2024-11-08 15:40:45,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6895878f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:40:45, skipping insertion in model container [2024-11-08 15:40:45,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:40:44" (2/3) ... [2024-11-08 15:40:45,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6895878f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:40:45, skipping insertion in model container [2024-11-08 15:40:45,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:40:45" (3/3) ... [2024-11-08 15:40:45,220 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-11-08 15:40:45,233 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:40:45,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:40:45,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:40:45,297 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;@4ae89767, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:40:45,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:40:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.7703703703703704) internal successors, (239), 136 states have internal predecessors, (239), 0 states have call successors, (0), 0 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:40:45,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 15:40:45,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:45,310 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] [2024-11-08 15:40:45,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:45,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:45,315 INFO L85 PathProgramCache]: Analyzing trace with hash 395135632, now seen corresponding path program 1 times [2024-11-08 15:40:45,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:45,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921635546] [2024-11-08 15:40:45,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:45,593 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:40:45,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:45,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921635546] [2024-11-08 15:40:45,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921635546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:45,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:45,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:40:45,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143496420] [2024-11-08 15:40:45,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:45,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:40:45,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:45,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:40:45,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:40:45,628 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.7703703703703704) internal successors, (239), 136 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:40:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:45,650 INFO L93 Difference]: Finished difference Result 211 states and 367 transitions. [2024-11-08 15:40:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:40:45,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-08 15:40:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:45,659 INFO L225 Difference]: With dead ends: 211 [2024-11-08 15:40:45,659 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 15:40:45,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:40:45,665 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:45,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:40:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 15:40:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-08 15:40:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.7575757575757576) internal successors, (232), 132 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 232 transitions. [2024-11-08 15:40:45,696 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 232 transitions. Word has length 37 [2024-11-08 15:40:45,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:45,696 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 232 transitions. [2024-11-08 15:40:45,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:40:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 232 transitions. [2024-11-08 15:40:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 15:40:45,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:45,698 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] [2024-11-08 15:40:45,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:40:45,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:45,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash -422512818, now seen corresponding path program 1 times [2024-11-08 15:40:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:45,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997950153] [2024-11-08 15:40:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:45,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:45,932 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:40:45,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:45,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997950153] [2024-11-08 15:40:45,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997950153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:45,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:45,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:40:45,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166735530] [2024-11-08 15:40:45,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:45,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:40:45,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:45,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:40:45,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:40:45,937 INFO L87 Difference]: Start difference. First operand 133 states and 232 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:40:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:46,005 INFO L93 Difference]: Finished difference Result 210 states and 360 transitions. [2024-11-08 15:40:46,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:40:46,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-08 15:40:46,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:46,007 INFO L225 Difference]: With dead ends: 210 [2024-11-08 15:40:46,007 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 15:40:46,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:40:46,008 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:46,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:40:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 15:40:46,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-08 15:40:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 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:40:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions. [2024-11-08 15:40:46,015 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 37 [2024-11-08 15:40:46,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:46,015 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 202 transitions. [2024-11-08 15:40:46,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:40:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2024-11-08 15:40:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 15:40:46,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:46,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:46,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:40:46,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:46,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1398422292, now seen corresponding path program 1 times [2024-11-08 15:40:46,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:46,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573556986] [2024-11-08 15:40:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:46,142 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:40:46,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:46,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573556986] [2024-11-08 15:40:46,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573556986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:46,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:40:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851413155] [2024-11-08 15:40:46,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:46,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:40:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:46,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:40:46,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:40:46,147 INFO L87 Difference]: Start difference. First operand 133 states and 202 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:46,213 INFO L93 Difference]: Finished difference Result 269 states and 432 transitions. [2024-11-08 15:40:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:40:46,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-08 15:40:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:46,215 INFO L225 Difference]: With dead ends: 269 [2024-11-08 15:40:46,216 INFO L226 Difference]: Without dead ends: 196 [2024-11-08 15:40:46,217 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:40:46,218 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 97 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:46,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 352 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:40:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-08 15:40:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2024-11-08 15:40:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.5625) internal successors, (300), 192 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:40:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2024-11-08 15:40:46,236 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 66 [2024-11-08 15:40:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:46,237 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2024-11-08 15:40:46,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2024-11-08 15:40:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-08 15:40:46,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:46,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:46,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:40:46,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:46,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:46,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1852534978, now seen corresponding path program 1 times [2024-11-08 15:40:46,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:46,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359386358] [2024-11-08 15:40:46,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:46,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:46,370 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:40:46,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:46,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359386358] [2024-11-08 15:40:46,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359386358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:46,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:46,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:40:46,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294871075] [2024-11-08 15:40:46,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:46,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:40:46,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:46,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:40:46,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:40:46,373 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:46,403 INFO L93 Difference]: Finished difference Result 443 states and 716 transitions. [2024-11-08 15:40:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:40:46,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-08 15:40:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:46,408 INFO L225 Difference]: With dead ends: 443 [2024-11-08 15:40:46,409 INFO L226 Difference]: Without dead ends: 310 [2024-11-08 15:40:46,410 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:40:46,411 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 99 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 365 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:40:46,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 365 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:40:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-08 15:40:46,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 306. [2024-11-08 15:40:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.5967213114754097) internal successors, (487), 305 states have internal predecessors, (487), 0 states have call successors, (0), 0 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:40:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 487 transitions. [2024-11-08 15:40:46,438 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 487 transitions. Word has length 68 [2024-11-08 15:40:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:46,438 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 487 transitions. [2024-11-08 15:40:46,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 487 transitions. [2024-11-08 15:40:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 15:40:46,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:46,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:46,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:40:46,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:46,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1172652176, now seen corresponding path program 1 times [2024-11-08 15:40:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:46,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669134469] [2024-11-08 15:40:46,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:46,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:46,554 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:40:46,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:46,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669134469] [2024-11-08 15:40:46,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669134469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:46,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:46,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:40:46,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569986803] [2024-11-08 15:40:46,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:46,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:40:46,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:46,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:40:46,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:40:46,556 INFO L87 Difference]: Start difference. First operand 306 states and 487 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:46,593 INFO L93 Difference]: Finished difference Result 766 states and 1249 transitions. [2024-11-08 15:40:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:40:46,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-08 15:40:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:46,596 INFO L225 Difference]: With dead ends: 766 [2024-11-08 15:40:46,596 INFO L226 Difference]: Without dead ends: 520 [2024-11-08 15:40:46,598 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:40:46,599 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 93 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 366 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:40:46,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 366 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:40:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-08 15:40:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 514. [2024-11-08 15:40:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 1.612085769980507) internal successors, (827), 513 states have internal predecessors, (827), 0 states have call successors, (0), 0 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:40:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 827 transitions. [2024-11-08 15:40:46,623 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 827 transitions. Word has length 70 [2024-11-08 15:40:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:46,624 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 827 transitions. [2024-11-08 15:40:46,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 827 transitions. [2024-11-08 15:40:46,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 15:40:46,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:46,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:46,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:40:46,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:46,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash 648029982, now seen corresponding path program 1 times [2024-11-08 15:40:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:46,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147697383] [2024-11-08 15:40:46,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:46,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:46,790 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:40:46,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:46,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147697383] [2024-11-08 15:40:46,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147697383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:46,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:46,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:40:46,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194102258] [2024-11-08 15:40:46,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:46,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:40:46,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:46,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:40:46,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:40:46,793 INFO L87 Difference]: Start difference. First operand 514 states and 827 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:46,963 INFO L93 Difference]: Finished difference Result 2190 states and 3633 transitions. [2024-11-08 15:40:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:40:46,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-08 15:40:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:46,969 INFO L225 Difference]: With dead ends: 2190 [2024-11-08 15:40:46,970 INFO L226 Difference]: Without dead ends: 1736 [2024-11-08 15:40:46,971 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:40:46,972 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 812 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:46,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1144 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:40:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2024-11-08 15:40:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 912. [2024-11-08 15:40:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 1.628979143798024) internal successors, (1484), 911 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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:40:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1484 transitions. [2024-11-08 15:40:47,012 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1484 transitions. Word has length 72 [2024-11-08 15:40:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:47,013 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1484 transitions. [2024-11-08 15:40:47,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1484 transitions. [2024-11-08 15:40:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 15:40:47,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:47,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:47,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:40:47,015 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:47,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 986227649, now seen corresponding path program 1 times [2024-11-08 15:40:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882970321] [2024-11-08 15:40:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:47,131 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:40:47,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:47,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882970321] [2024-11-08 15:40:47,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882970321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:47,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:47,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:40:47,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878955116] [2024-11-08 15:40:47,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:47,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:40:47,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:47,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:40:47,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:40:47,137 INFO L87 Difference]: Start difference. First operand 912 states and 1484 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:40:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:47,249 INFO L93 Difference]: Finished difference Result 2654 states and 4394 transitions. [2024-11-08 15:40:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:40:47,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-11-08 15:40:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:47,255 INFO L225 Difference]: With dead ends: 2654 [2024-11-08 15:40:47,255 INFO L226 Difference]: Without dead ends: 1802 [2024-11-08 15:40:47,257 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:40:47,257 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 359 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:47,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 651 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:40:47,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-08 15:40:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1348. [2024-11-08 15:40:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1347 states have (on average 1.6384558277654047) internal successors, (2207), 1347 states have internal predecessors, (2207), 0 states have call successors, (0), 0 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:40:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2207 transitions. [2024-11-08 15:40:47,287 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2207 transitions. Word has length 73 [2024-11-08 15:40:47,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:47,288 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 2207 transitions. [2024-11-08 15:40:47,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:40:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2207 transitions. [2024-11-08 15:40:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 15:40:47,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:47,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:47,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:40:47,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:47,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:47,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1245542219, now seen corresponding path program 1 times [2024-11-08 15:40:47,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:47,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333748290] [2024-11-08 15:40:47,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:47,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:47,365 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:40:47,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:47,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333748290] [2024-11-08 15:40:47,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333748290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:47,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:47,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:40:47,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281819644] [2024-11-08 15:40:47,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:47,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:40:47,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:47,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:40:47,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:40:47,367 INFO L87 Difference]: Start difference. First operand 1348 states and 2207 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:47,450 INFO L93 Difference]: Finished difference Result 3908 states and 6458 transitions. [2024-11-08 15:40:47,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:40:47,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-08 15:40:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:47,458 INFO L225 Difference]: With dead ends: 3908 [2024-11-08 15:40:47,458 INFO L226 Difference]: Without dead ends: 2620 [2024-11-08 15:40:47,460 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:40:47,461 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 357 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:47,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 652 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:40:47,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2024-11-08 15:40:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 1972. [2024-11-08 15:40:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1971 states have (on average 1.637239979705733) internal successors, (3227), 1971 states have internal predecessors, (3227), 0 states have call successors, (0), 0 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:40:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 3227 transitions. [2024-11-08 15:40:47,528 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 3227 transitions. Word has length 74 [2024-11-08 15:40:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:47,528 INFO L471 AbstractCegarLoop]: Abstraction has 1972 states and 3227 transitions. [2024-11-08 15:40:47,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 3227 transitions. [2024-11-08 15:40:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 15:40:47,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:47,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:47,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:40:47,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:47,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:47,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1541927048, now seen corresponding path program 1 times [2024-11-08 15:40:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:47,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334857638] [2024-11-08 15:40:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:47,606 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:40:47,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:47,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334857638] [2024-11-08 15:40:47,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334857638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:47,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:47,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:40:47,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523944410] [2024-11-08 15:40:47,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:47,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:40:47,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:47,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:40:47,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:40:47,609 INFO L87 Difference]: Start difference. First operand 1972 states and 3227 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:47,710 INFO L93 Difference]: Finished difference Result 5692 states and 9382 transitions. [2024-11-08 15:40:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:40:47,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-08 15:40:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:47,724 INFO L225 Difference]: With dead ends: 5692 [2024-11-08 15:40:47,724 INFO L226 Difference]: Without dead ends: 3780 [2024-11-08 15:40:47,727 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:40:47,728 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 355 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:47,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 661 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:40:47,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2024-11-08 15:40:47,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2860. [2024-11-08 15:40:47,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2859 states have (on average 1.634487583071004) internal successors, (4673), 2859 states have internal predecessors, (4673), 0 states have call successors, (0), 0 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:40:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 4673 transitions. [2024-11-08 15:40:47,794 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 4673 transitions. Word has length 75 [2024-11-08 15:40:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:47,794 INFO L471 AbstractCegarLoop]: Abstraction has 2860 states and 4673 transitions. [2024-11-08 15:40:47,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 4673 transitions. [2024-11-08 15:40:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 15:40:47,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:47,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:47,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:40:47,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:47,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash 268884983, now seen corresponding path program 1 times [2024-11-08 15:40:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:47,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629497061] [2024-11-08 15:40:47,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:47,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:47,851 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:40:47,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:47,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629497061] [2024-11-08 15:40:47,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629497061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:47,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:47,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:40:47,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359654411] [2024-11-08 15:40:47,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:47,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:40:47,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:47,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:40:47,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:40:47,853 INFO L87 Difference]: Start difference. First operand 2860 states and 4673 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:47,905 INFO L93 Difference]: Finished difference Result 6550 states and 10704 transitions. [2024-11-08 15:40:47,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:40:47,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-08 15:40:47,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:47,917 INFO L225 Difference]: With dead ends: 6550 [2024-11-08 15:40:47,917 INFO L226 Difference]: Without dead ends: 4512 [2024-11-08 15:40:47,951 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:40:47,952 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 92 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 413 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:40:47,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 413 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:40:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2024-11-08 15:40:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4510. [2024-11-08 15:40:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.6185406963850077) internal successors, (7298), 4509 states have internal predecessors, (7298), 0 states have call successors, (0), 0 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:40:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 7298 transitions. [2024-11-08 15:40:48,023 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 7298 transitions. Word has length 76 [2024-11-08 15:40:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:48,023 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 7298 transitions. [2024-11-08 15:40:48,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 7298 transitions. [2024-11-08 15:40:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 15:40:48,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:48,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:48,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:40:48,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:48,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:48,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1813417673, now seen corresponding path program 1 times [2024-11-08 15:40:48,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:48,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653455505] [2024-11-08 15:40:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:48,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:48,069 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:40:48,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:48,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653455505] [2024-11-08 15:40:48,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653455505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:48,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:48,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:40:48,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389444972] [2024-11-08 15:40:48,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:48,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:40:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:48,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:40:48,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:40:48,071 INFO L87 Difference]: Start difference. First operand 4510 states and 7298 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:48,136 INFO L93 Difference]: Finished difference Result 9926 states and 16104 transitions. [2024-11-08 15:40:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:40:48,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-08 15:40:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:48,154 INFO L225 Difference]: With dead ends: 9926 [2024-11-08 15:40:48,154 INFO L226 Difference]: Without dead ends: 6732 [2024-11-08 15:40:48,160 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:40:48,160 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 98 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 441 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:40:48,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 441 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:40:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6732 states. [2024-11-08 15:40:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6732 to 6730. [2024-11-08 15:40:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6730 states, 6729 states have (on average 1.607965522365879) internal successors, (10820), 6729 states have internal predecessors, (10820), 0 states have call successors, (0), 0 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:40:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 10820 transitions. [2024-11-08 15:40:48,321 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 10820 transitions. Word has length 76 [2024-11-08 15:40:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:48,321 INFO L471 AbstractCegarLoop]: Abstraction has 6730 states and 10820 transitions. [2024-11-08 15:40:48,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 10820 transitions. [2024-11-08 15:40:48,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 15:40:48,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:48,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:48,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:40:48,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:48,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash 798671669, now seen corresponding path program 1 times [2024-11-08 15:40:48,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:48,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341631463] [2024-11-08 15:40:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:48,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:48,369 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:40:48,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341631463] [2024-11-08 15:40:48,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341631463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:48,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:48,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:40:48,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992620962] [2024-11-08 15:40:48,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:48,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:40:48,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:48,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:40:48,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:40:48,371 INFO L87 Difference]: Start difference. First operand 6730 states and 10820 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:48,467 INFO L93 Difference]: Finished difference Result 15111 states and 24508 transitions. [2024-11-08 15:40:48,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:40:48,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-08 15:40:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:48,492 INFO L225 Difference]: With dead ends: 15111 [2024-11-08 15:40:48,492 INFO L226 Difference]: Without dead ends: 10171 [2024-11-08 15:40:48,500 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:40:48,501 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 104 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 461 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:40:48,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 461 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:40:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10171 states. [2024-11-08 15:40:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10171 to 10169. [2024-11-08 15:40:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10169 states, 10168 states have (on average 1.6009047993705743) internal successors, (16278), 10168 states have internal predecessors, (16278), 0 states have call successors, (0), 0 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:40:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 16278 transitions. [2024-11-08 15:40:48,809 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 16278 transitions. Word has length 76 [2024-11-08 15:40:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:48,809 INFO L471 AbstractCegarLoop]: Abstraction has 10169 states and 16278 transitions. [2024-11-08 15:40:48,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 16278 transitions. [2024-11-08 15:40:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 15:40:48,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:48,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:48,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:40:48,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:48,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:48,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2139270896, now seen corresponding path program 1 times [2024-11-08 15:40:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:48,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950397736] [2024-11-08 15:40:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:48,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:48,974 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:40:48,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:48,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950397736] [2024-11-08 15:40:48,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950397736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:48,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:48,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:40:48,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607680545] [2024-11-08 15:40:48,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:48,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:40:48,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:48,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:40:48,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:40:48,977 INFO L87 Difference]: Start difference. First operand 10169 states and 16278 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:40:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:49,256 INFO L93 Difference]: Finished difference Result 20262 states and 32453 transitions. [2024-11-08 15:40:49,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:40:49,257 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 77 [2024-11-08 15:40:49,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:49,273 INFO L225 Difference]: With dead ends: 20262 [2024-11-08 15:40:49,273 INFO L226 Difference]: Without dead ends: 10171 [2024-11-08 15:40:49,281 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:40:49,283 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 283 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:49,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 538 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:40:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10171 states. [2024-11-08 15:40:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10171 to 10169. [2024-11-08 15:40:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10169 states, 10168 states have (on average 1.5886113296616837) internal successors, (16153), 10168 states have internal predecessors, (16153), 0 states have call successors, (0), 0 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:40:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 16153 transitions. [2024-11-08 15:40:49,462 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 16153 transitions. Word has length 77 [2024-11-08 15:40:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:49,463 INFO L471 AbstractCegarLoop]: Abstraction has 10169 states and 16153 transitions. [2024-11-08 15:40:49,463 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:40:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 16153 transitions. [2024-11-08 15:40:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 15:40:49,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:49,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:49,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:40:49,464 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:49,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:49,464 INFO L85 PathProgramCache]: Analyzing trace with hash -297465128, now seen corresponding path program 1 times [2024-11-08 15:40:49,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:49,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995008900] [2024-11-08 15:40:49,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:49,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:49,733 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:40:49,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:49,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995008900] [2024-11-08 15:40:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995008900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:49,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:40:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330836928] [2024-11-08 15:40:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:49,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:40:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:49,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:40:49,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:40:49,736 INFO L87 Difference]: Start difference. First operand 10169 states and 16153 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:40:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:49,957 INFO L93 Difference]: Finished difference Result 29138 states and 46435 transitions. [2024-11-08 15:40:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:40:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-08 15:40:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:49,989 INFO L225 Difference]: With dead ends: 29138 [2024-11-08 15:40:49,989 INFO L226 Difference]: Without dead ends: 19047 [2024-11-08 15:40:50,005 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:40:50,006 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 185 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:50,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 540 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:40:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19047 states. [2024-11-08 15:40:50,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19047 to 19045. [2024-11-08 15:40:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19045 states, 19044 states have (on average 1.5750892669607226) internal successors, (29996), 19044 states have internal predecessors, (29996), 0 states have call successors, (0), 0 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:40:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19045 states to 19045 states and 29996 transitions. [2024-11-08 15:40:50,461 INFO L78 Accepts]: Start accepts. Automaton has 19045 states and 29996 transitions. Word has length 80 [2024-11-08 15:40:50,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:50,461 INFO L471 AbstractCegarLoop]: Abstraction has 19045 states and 29996 transitions. [2024-11-08 15:40:50,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:40:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 19045 states and 29996 transitions. [2024-11-08 15:40:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 15:40:50,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:50,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:50,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:40:50,462 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:50,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1060060007, now seen corresponding path program 1 times [2024-11-08 15:40:50,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:50,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953066743] [2024-11-08 15:40:50,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:50,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:50,751 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:40:50,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:50,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953066743] [2024-11-08 15:40:50,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953066743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:50,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:50,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:40:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941136527] [2024-11-08 15:40:50,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:50,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:40:50,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:50,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:40:50,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:40:50,754 INFO L87 Difference]: Start difference. First operand 19045 states and 29996 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:40:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:51,004 INFO L93 Difference]: Finished difference Result 20133 states and 31445 transitions. [2024-11-08 15:40:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:40:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-08 15:40:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:51,037 INFO L225 Difference]: With dead ends: 20133 [2024-11-08 15:40:51,037 INFO L226 Difference]: Without dead ends: 20131 [2024-11-08 15:40:51,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:40:51,045 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:51,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1354 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:40:51,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20131 states. [2024-11-08 15:40:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 20131. [2024-11-08 15:40:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20131 states, 20130 states have (on average 1.5436164927968206) internal successors, (31073), 20130 states have internal predecessors, (31073), 0 states have call successors, (0), 0 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:40:51,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20131 states to 20131 states and 31073 transitions. [2024-11-08 15:40:51,548 INFO L78 Accepts]: Start accepts. Automaton has 20131 states and 31073 transitions. Word has length 81 [2024-11-08 15:40:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:51,549 INFO L471 AbstractCegarLoop]: Abstraction has 20131 states and 31073 transitions. [2024-11-08 15:40:51,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:40:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 20131 states and 31073 transitions. [2024-11-08 15:40:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 15:40:51,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:51,552 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:51,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:40:51,553 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:51,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1195435618, now seen corresponding path program 1 times [2024-11-08 15:40:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:51,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236082770] [2024-11-08 15:40:51,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:51,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 15:40:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236082770] [2024-11-08 15:40:51,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236082770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:51,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:51,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:40:51,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552094481] [2024-11-08 15:40:51,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:51,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:40:51,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:51,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:40:51,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:40:51,749 INFO L87 Difference]: Start difference. First operand 20131 states and 31073 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:40:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:52,213 INFO L93 Difference]: Finished difference Result 49399 states and 76493 transitions. [2024-11-08 15:40:52,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:40:52,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 109 [2024-11-08 15:40:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:52,301 INFO L225 Difference]: With dead ends: 49399 [2024-11-08 15:40:52,302 INFO L226 Difference]: Without dead ends: 39817 [2024-11-08 15:40:52,317 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:40:52,318 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 452 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:52,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 826 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:40:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39817 states. [2024-11-08 15:40:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39817 to 31003. [2024-11-08 15:40:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31003 states, 31002 states have (on average 1.5418037545964776) internal successors, (47799), 31002 states have internal predecessors, (47799), 0 states have call successors, (0), 0 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:40:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31003 states to 31003 states and 47799 transitions. [2024-11-08 15:40:53,061 INFO L78 Accepts]: Start accepts. Automaton has 31003 states and 47799 transitions. Word has length 109 [2024-11-08 15:40:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:53,061 INFO L471 AbstractCegarLoop]: Abstraction has 31003 states and 47799 transitions. [2024-11-08 15:40:53,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:40:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 31003 states and 47799 transitions. [2024-11-08 15:40:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 15:40:53,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:53,063 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:53,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:40:53,063 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:53,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash -886867038, now seen corresponding path program 1 times [2024-11-08 15:40:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:53,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938669552] [2024-11-08 15:40:53,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:53,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 15:40:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938669552] [2024-11-08 15:40:53,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938669552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:53,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:53,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:40:53,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920228933] [2024-11-08 15:40:53,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:53,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:40:53,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:53,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:40:53,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:40:53,163 INFO L87 Difference]: Start difference. First operand 31003 states and 47799 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 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:40:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:53,626 INFO L93 Difference]: Finished difference Result 53263 states and 82485 transitions. [2024-11-08 15:40:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:40:53,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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 109 [2024-11-08 15:40:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:53,697 INFO L225 Difference]: With dead ends: 53263 [2024-11-08 15:40:53,697 INFO L226 Difference]: Without dead ends: 43681 [2024-11-08 15:40:53,717 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:40:53,717 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 445 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:53,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 950 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:40:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43681 states. [2024-11-08 15:40:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43681 to 42075. [2024-11-08 15:40:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42075 states, 42074 states have (on average 1.5423064125112895) internal successors, (64891), 42074 states have internal predecessors, (64891), 0 states have call successors, (0), 0 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:40:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42075 states to 42075 states and 64891 transitions. [2024-11-08 15:40:54,806 INFO L78 Accepts]: Start accepts. Automaton has 42075 states and 64891 transitions. Word has length 109 [2024-11-08 15:40:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:54,806 INFO L471 AbstractCegarLoop]: Abstraction has 42075 states and 64891 transitions. [2024-11-08 15:40:54,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 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:40:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 42075 states and 64891 transitions. [2024-11-08 15:40:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 15:40:54,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:54,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:54,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:40:54,812 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:54,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1725222304, now seen corresponding path program 1 times [2024-11-08 15:40:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:54,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950955951] [2024-11-08 15:40:54,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:54,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:40:54,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:54,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950955951] [2024-11-08 15:40:54,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950955951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:54,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:54,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:40:54,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745453089] [2024-11-08 15:40:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:54,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:40:54,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:54,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:40:54,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:40:54,880 INFO L87 Difference]: Start difference. First operand 42075 states and 64891 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:40:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:55,619 INFO L93 Difference]: Finished difference Result 88058 states and 136424 transitions. [2024-11-08 15:40:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:40:55,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 109 [2024-11-08 15:40:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:55,805 INFO L225 Difference]: With dead ends: 88058 [2024-11-08 15:40:55,805 INFO L226 Difference]: Without dead ends: 78216 [2024-11-08 15:40:55,843 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:40:55,843 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 81 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:40:55,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 373 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:40:55,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78216 states. [2024-11-08 15:40:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78216 to 78099. [2024-11-08 15:40:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78099 states, 78098 states have (on average 1.5451996209890138) internal successors, (120677), 78098 states have internal predecessors, (120677), 0 states have call successors, (0), 0 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:40:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78099 states to 78099 states and 120677 transitions. [2024-11-08 15:40:57,327 INFO L78 Accepts]: Start accepts. Automaton has 78099 states and 120677 transitions. Word has length 109 [2024-11-08 15:40:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:40:57,327 INFO L471 AbstractCegarLoop]: Abstraction has 78099 states and 120677 transitions. [2024-11-08 15:40:57,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:40:57,328 INFO L276 IsEmpty]: Start isEmpty. Operand 78099 states and 120677 transitions. [2024-11-08 15:40:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 15:40:57,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:40:57,330 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:40:57,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:40:57,331 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:40:57,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:40:57,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2060072395, now seen corresponding path program 1 times [2024-11-08 15:40:57,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:40:57,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557131149] [2024-11-08 15:40:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:40:57,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:40:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:40:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:40:57,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:40:57,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557131149] [2024-11-08 15:40:57,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557131149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:40:57,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:40:57,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:40:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868376076] [2024-11-08 15:40:57,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:40:57,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:40:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:40:57,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:40:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:40:57,393 INFO L87 Difference]: Start difference. First operand 78099 states and 120677 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:40:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:40:59,089 INFO L93 Difference]: Finished difference Result 232553 states and 358598 transitions. [2024-11-08 15:40:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:40:59,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-08 15:40:59,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:40:59,392 INFO L225 Difference]: With dead ends: 232553 [2024-11-08 15:40:59,393 INFO L226 Difference]: Without dead ends: 154526 [2024-11-08 15:40:59,476 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:40:59,477 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 132 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 452 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:40:59,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 452 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:40:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154526 states. [2024-11-08 15:41:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154526 to 154524. [2024-11-08 15:41:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154524 states, 154523 states have (on average 1.5296363648130051) internal successors, (236364), 154523 states have internal predecessors, (236364), 0 states have call successors, (0), 0 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:41:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154524 states to 154524 states and 236364 transitions. [2024-11-08 15:41:02,855 INFO L78 Accepts]: Start accepts. Automaton has 154524 states and 236364 transitions. Word has length 110 [2024-11-08 15:41:02,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:41:02,856 INFO L471 AbstractCegarLoop]: Abstraction has 154524 states and 236364 transitions. [2024-11-08 15:41:02,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:41:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 154524 states and 236364 transitions. [2024-11-08 15:41:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 15:41:02,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:41:02,860 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:41:02,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 15:41:02,861 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:41:02,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:41:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash -403250563, now seen corresponding path program 1 times [2024-11-08 15:41:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:41:02,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26188129] [2024-11-08 15:41:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:41:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:41:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:41:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:41:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:41:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26188129] [2024-11-08 15:41:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26188129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:41:03,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:41:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:41:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269149014] [2024-11-08 15:41:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:41:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:41:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:41:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:41:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:41:03,011 INFO L87 Difference]: Start difference. First operand 154524 states and 236364 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:41:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:41:05,102 INFO L93 Difference]: Finished difference Result 250828 states and 385103 transitions. [2024-11-08 15:41:05,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:41:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-08 15:41:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:41:05,543 INFO L225 Difference]: With dead ends: 250828 [2024-11-08 15:41:05,543 INFO L226 Difference]: Without dead ends: 161268 [2024-11-08 15:41:05,623 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:41:05,626 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 189 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:41:05,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 611 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:41:05,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161268 states. [2024-11-08 15:41:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161268 to 107650. [2024-11-08 15:41:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107650 states, 107649 states have (on average 1.5246402660498473) internal successors, (164126), 107649 states have internal predecessors, (164126), 0 states have call successors, (0), 0 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:41:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107650 states to 107650 states and 164126 transitions. [2024-11-08 15:41:08,387 INFO L78 Accepts]: Start accepts. Automaton has 107650 states and 164126 transitions. Word has length 110 [2024-11-08 15:41:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:41:08,388 INFO L471 AbstractCegarLoop]: Abstraction has 107650 states and 164126 transitions. [2024-11-08 15:41:08,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:41:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 107650 states and 164126 transitions. [2024-11-08 15:41:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 15:41:08,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:41:08,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:41:08,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 15:41:08,395 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:41:08,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:41:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash 90350949, now seen corresponding path program 1 times [2024-11-08 15:41:08,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:41:08,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948692360] [2024-11-08 15:41:08,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:41:08,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:41:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:41:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:41:08,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:41:08,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948692360] [2024-11-08 15:41:08,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948692360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:41:08,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:41:08,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:41:08,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123686166] [2024-11-08 15:41:08,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:41:08,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:41:08,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:41:08,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:41:08,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:41:08,501 INFO L87 Difference]: Start difference. First operand 107650 states and 164126 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:41:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:41:10,798 INFO L93 Difference]: Finished difference Result 320531 states and 487643 transitions. [2024-11-08 15:41:10,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:41:10,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-08 15:41:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:41:11,170 INFO L225 Difference]: With dead ends: 320531 [2024-11-08 15:41:11,170 INFO L226 Difference]: Without dead ends: 213015 [2024-11-08 15:41:11,226 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:41:11,229 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 151 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 478 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:41:11,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 478 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:41:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213015 states. [2024-11-08 15:41:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213015 to 213013. [2024-11-08 15:41:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213013 states, 213012 states have (on average 1.5088962124199576) internal successors, (321413), 213012 states have internal predecessors, (321413), 0 states have call successors, (0), 0 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:41:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213013 states to 213013 states and 321413 transitions. [2024-11-08 15:41:16,605 INFO L78 Accepts]: Start accepts. Automaton has 213013 states and 321413 transitions. Word has length 110 [2024-11-08 15:41:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:41:16,606 INFO L471 AbstractCegarLoop]: Abstraction has 213013 states and 321413 transitions. [2024-11-08 15:41:16,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:41:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 213013 states and 321413 transitions. [2024-11-08 15:41:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 15:41:16,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:41:16,610 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:41:16,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 15:41:16,610 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:41:16,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:41:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1957820067, now seen corresponding path program 1 times [2024-11-08 15:41:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:41:16,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072857386] [2024-11-08 15:41:16,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:41:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:41:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:41:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:41:16,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:41:16,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072857386] [2024-11-08 15:41:16,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072857386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:41:16,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:41:16,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:41:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507700339] [2024-11-08 15:41:16,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:41:16,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:41:16,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:41:16,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:41:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:41:16,744 INFO L87 Difference]: Start difference. First operand 213013 states and 321413 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:41:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:41:19,387 INFO L93 Difference]: Finished difference Result 318371 states and 478687 transitions. [2024-11-08 15:41:19,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:41:19,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-11-08 15:41:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:41:19,879 INFO L225 Difference]: With dead ends: 318371 [2024-11-08 15:41:19,880 INFO L226 Difference]: Without dead ends: 213117 [2024-11-08 15:41:19,987 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:41:19,988 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 125 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:41:19,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 547 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:41:20,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213117 states. [2024-11-08 15:41:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213117 to 213115. [2024-11-08 15:41:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213115 states, 213114 states have (on average 1.4980573777414905) internal successors, (319257), 213114 states have internal predecessors, (319257), 0 states have call successors, (0), 0 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:41:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213115 states to 213115 states and 319257 transitions. [2024-11-08 15:41:24,482 INFO L78 Accepts]: Start accepts. Automaton has 213115 states and 319257 transitions. Word has length 111 [2024-11-08 15:41:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:41:24,487 INFO L471 AbstractCegarLoop]: Abstraction has 213115 states and 319257 transitions. [2024-11-08 15:41:24,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:41:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 213115 states and 319257 transitions. [2024-11-08 15:41:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 15:41:24,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:41:24,498 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:41:24,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 15:41:24,499 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:41:24,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:41:24,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1958675705, now seen corresponding path program 1 times [2024-11-08 15:41:24,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:41:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625796468] [2024-11-08 15:41:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:41:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:41:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:41:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:41:24,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:41:24,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625796468] [2024-11-08 15:41:24,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625796468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:41:24,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:41:24,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:41:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702122656] [2024-11-08 15:41:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:41:24,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:41:24,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:41:24,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:41:24,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:41:24,556 INFO L87 Difference]: Start difference. First operand 213115 states and 319257 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:41:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:41:27,156 INFO L93 Difference]: Finished difference Result 285951 states and 427026 transitions. [2024-11-08 15:41:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:41:27,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-11-08 15:41:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:41:27,400 INFO L225 Difference]: With dead ends: 285951 [2024-11-08 15:41:27,400 INFO L226 Difference]: Without dead ends: 180707 [2024-11-08 15:41:27,466 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:41:27,467 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 139 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:41:27,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 563 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:41:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180707 states. [2024-11-08 15:41:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180707 to 180705. [2024-11-08 15:41:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180705 states, 180704 states have (on average 1.4872277315388702) internal successors, (268748), 180704 states have internal predecessors, (268748), 0 states have call successors, (0), 0 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:41:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180705 states to 180705 states and 268748 transitions. [2024-11-08 15:41:31,311 INFO L78 Accepts]: Start accepts. Automaton has 180705 states and 268748 transitions. Word has length 111 [2024-11-08 15:41:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:41:31,312 INFO L471 AbstractCegarLoop]: Abstraction has 180705 states and 268748 transitions. [2024-11-08 15:41:31,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:41:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 180705 states and 268748 transitions. [2024-11-08 15:41:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 15:41:31,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:41:31,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:41:31,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 15:41:31,317 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:41:31,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:41:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1187171385, now seen corresponding path program 1 times [2024-11-08 15:41:31,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:41:31,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38353346] [2024-11-08 15:41:31,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:41:31,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:41:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:41:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 15:41:31,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:41:31,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38353346] [2024-11-08 15:41:31,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38353346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:41:31,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:41:31,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:41:31,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203005479] [2024-11-08 15:41:31,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:41:31,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:41:31,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:41:31,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:41:31,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:41:31,394 INFO L87 Difference]: Start difference. First operand 180705 states and 268748 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)