./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8aa577dc4c04bf53d7d29751ed362e9afcf94d1db611db106e7ed08797634e47 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:18:05,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:18:05,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:18:05,086 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:18:05,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:18:05,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:18:05,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:18:05,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:18:05,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:18:05,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:18:05,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:18:05,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:18:05,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:18:05,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:18:05,141 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:18:05,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:18:05,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:18:05,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:18:05,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:18:05,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:18:05,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:18:05,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:18:05,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:18:05,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:18:05,145 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:18:05,145 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:18:05,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:18:05,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:18:05,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:18:05,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:18:05,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:18:05,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:18:05,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:18:05,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:18:05,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:18:05,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:18:05,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:18:05,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:18:05,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:18:05,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:18:05,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:18:05,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:18:05,151 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8aa577dc4c04bf53d7d29751ed362e9afcf94d1db611db106e7ed08797634e47 [2024-10-10 23:18:05,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:18:05,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:18:05,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:18:05,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:18:05,437 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:18:05,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c [2024-10-10 23:18:06,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:18:07,175 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:18:07,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c [2024-10-10 23:18:07,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f39d264df/6716d037e1db4b3da8ae1dd6034a0005/FLAGefa2f251c [2024-10-10 23:18:07,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f39d264df/6716d037e1db4b3da8ae1dd6034a0005 [2024-10-10 23:18:07,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:18:07,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:18:07,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:18:07,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:18:07,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:18:07,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:07,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3150155b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07, skipping insertion in model container [2024-10-10 23:18:07,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:07,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:18:07,541 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c[8142,8155] [2024-10-10 23:18:07,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:18:07,801 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:18:07,837 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c[8142,8155] [2024-10-10 23:18:07,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:18:07,968 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:18:07,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07 WrapperNode [2024-10-10 23:18:07,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:18:07,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:18:07,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:18:07,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:18:07,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:08,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:08,107 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-10 23:18:08,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:18:08,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:18:08,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:18:08,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:18:08,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:08,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:08,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:08,278 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:18:08,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:08,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:08,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:08,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:08,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:08,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:08,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:18:08,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:18:08,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:18:08,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:18:08,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (1/1) ... [2024-10-10 23:18:08,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:18:08,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:08,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:18:08,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:18:08,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:18:08,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:18:08,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:18:08,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:18:08,563 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:18:08,565 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:18:10,150 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-10 23:18:10,150 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:18:10,207 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:18:10,208 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:18:10,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:18:10 BoogieIcfgContainer [2024-10-10 23:18:10,208 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:18:10,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:18:10,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:18:10,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:18:10,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:18:07" (1/3) ... [2024-10-10 23:18:10,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbea49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:18:10, skipping insertion in model container [2024-10-10 23:18:10,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:07" (2/3) ... [2024-10-10 23:18:10,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbea49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:18:10, skipping insertion in model container [2024-10-10 23:18:10,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:18:10" (3/3) ... [2024-10-10 23:18:10,217 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label19.c [2024-10-10 23:18:10,232 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:18:10,232 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:18:10,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:18:10,310 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;@5506f745, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:18:10,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:18:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-10 23:18:10,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:10,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:10,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:10,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1041092486, now seen corresponding path program 1 times [2024-10-10 23:18:10,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:10,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456383896] [2024-10-10 23:18:10,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:10,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:10,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:10,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456383896] [2024-10-10 23:18:10,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456383896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:10,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:10,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264218364] [2024-10-10 23:18:10,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:10,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:18:10,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:10,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:18:10,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:18:10,557 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 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 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:10,617 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-10 23:18:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:18:10,620 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-10 23:18:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:10,632 INFO L225 Difference]: With dead ends: 441 [2024-10-10 23:18:10,632 INFO L226 Difference]: Without dead ends: 219 [2024-10-10 23:18:10,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:18:10,640 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:10,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:18:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-10 23:18:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-10 23:18:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-10 23:18:10,702 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 55 [2024-10-10 23:18:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:10,703 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-10 23:18:10,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-10 23:18:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-10 23:18:10,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:10,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:10,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:18:10,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:10,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash -68007116, now seen corresponding path program 1 times [2024-10-10 23:18:10,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:10,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828444622] [2024-10-10 23:18:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:10,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:10,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828444622] [2024-10-10 23:18:10,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828444622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:10,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:10,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:10,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198493088] [2024-10-10 23:18:10,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:10,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:10,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:10,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:10,955 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:11,955 INFO L93 Difference]: Finished difference Result 630 states and 1026 transitions. [2024-10-10 23:18:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:11,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-10 23:18:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:11,959 INFO L225 Difference]: With dead ends: 630 [2024-10-10 23:18:11,959 INFO L226 Difference]: Without dead ends: 412 [2024-10-10 23:18:11,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:11,966 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 168 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:11,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 155 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:18:11,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-10 23:18:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-10 23:18:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4549878345498783) internal successors, (598), 411 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 598 transitions. [2024-10-10 23:18:11,988 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 598 transitions. Word has length 55 [2024-10-10 23:18:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:11,989 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 598 transitions. [2024-10-10 23:18:11,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 598 transitions. [2024-10-10 23:18:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-10 23:18:11,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:11,993 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:11,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:18:11,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:11,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1462231532, now seen corresponding path program 1 times [2024-10-10 23:18:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:11,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741358520] [2024-10-10 23:18:11,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:12,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:12,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741358520] [2024-10-10 23:18:12,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741358520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:12,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:12,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:12,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922444248] [2024-10-10 23:18:12,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:12,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:12,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:12,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:12,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:12,228 INFO L87 Difference]: Start difference. First operand 412 states and 598 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:13,017 INFO L93 Difference]: Finished difference Result 1210 states and 1762 transitions. [2024-10-10 23:18:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:13,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-10-10 23:18:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:13,021 INFO L225 Difference]: With dead ends: 1210 [2024-10-10 23:18:13,021 INFO L226 Difference]: Without dead ends: 799 [2024-10-10 23:18:13,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:13,023 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:13,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 116 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:18:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-10 23:18:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 788. [2024-10-10 23:18:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3761118170266835) internal successors, (1083), 787 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1083 transitions. [2024-10-10 23:18:13,049 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1083 transitions. Word has length 123 [2024-10-10 23:18:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:13,050 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1083 transitions. [2024-10-10 23:18:13,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1083 transitions. [2024-10-10 23:18:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-10 23:18:13,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:13,054 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:13,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:18:13,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:13,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:13,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2061888554, now seen corresponding path program 1 times [2024-10-10 23:18:13,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:13,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415744843] [2024-10-10 23:18:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:13,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:13,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415744843] [2024-10-10 23:18:13,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415744843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:13,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:13,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:13,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862837822] [2024-10-10 23:18:13,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:13,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:13,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:13,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:13,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:13,423 INFO L87 Difference]: Start difference. First operand 788 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:14,112 INFO L93 Difference]: Finished difference Result 1944 states and 2613 transitions. [2024-10-10 23:18:14,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:14,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-10-10 23:18:14,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:14,120 INFO L225 Difference]: With dead ends: 1944 [2024-10-10 23:18:14,120 INFO L226 Difference]: Without dead ends: 1157 [2024-10-10 23:18:14,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:14,125 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:14,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-10-10 23:18:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-10-10 23:18:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.2718614718614718) internal successors, (1469), 1155 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1469 transitions. [2024-10-10 23:18:14,166 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1469 transitions. Word has length 124 [2024-10-10 23:18:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:14,167 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1469 transitions. [2024-10-10 23:18:14,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1469 transitions. [2024-10-10 23:18:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-10 23:18:14,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:14,175 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:14,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:18:14,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:14,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:14,177 INFO L85 PathProgramCache]: Analyzing trace with hash -479133243, now seen corresponding path program 1 times [2024-10-10 23:18:14,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:14,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210321311] [2024-10-10 23:18:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:14,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:14,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:14,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210321311] [2024-10-10 23:18:14,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210321311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:14,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:14,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:14,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693009889] [2024-10-10 23:18:14,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:14,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:14,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:14,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:14,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:14,515 INFO L87 Difference]: Start difference. First operand 1156 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:15,244 INFO L93 Difference]: Finished difference Result 2518 states and 3351 transitions. [2024-10-10 23:18:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:15,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2024-10-10 23:18:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:15,251 INFO L225 Difference]: With dead ends: 2518 [2024-10-10 23:18:15,251 INFO L226 Difference]: Without dead ends: 1547 [2024-10-10 23:18:15,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:15,256 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 179 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:15,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 319 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-10 23:18:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1544. [2024-10-10 23:18:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 1.2942320155541154) internal successors, (1997), 1543 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1997 transitions. [2024-10-10 23:18:15,292 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1997 transitions. Word has length 182 [2024-10-10 23:18:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:15,292 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 1997 transitions. [2024-10-10 23:18:15,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1997 transitions. [2024-10-10 23:18:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-10 23:18:15,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:15,297 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:18:15,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:18:15,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:15,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash 424628840, now seen corresponding path program 1 times [2024-10-10 23:18:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:15,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195152022] [2024-10-10 23:18:15,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:15,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195152022] [2024-10-10 23:18:15,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195152022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:15,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:15,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:15,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527073724] [2024-10-10 23:18:15,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:15,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:15,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:15,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:15,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:15,585 INFO L87 Difference]: Start difference. First operand 1544 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:16,367 INFO L93 Difference]: Finished difference Result 3655 states and 4825 transitions. [2024-10-10 23:18:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:16,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 235 [2024-10-10 23:18:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:16,377 INFO L225 Difference]: With dead ends: 3655 [2024-10-10 23:18:16,378 INFO L226 Difference]: Without dead ends: 2296 [2024-10-10 23:18:16,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:16,381 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:16,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 337 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:16,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2024-10-10 23:18:16,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2099. [2024-10-10 23:18:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 1.2707340324118208) internal successors, (2666), 2098 states have internal predecessors, (2666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2666 transitions. [2024-10-10 23:18:16,420 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2666 transitions. Word has length 235 [2024-10-10 23:18:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:16,424 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2666 transitions. [2024-10-10 23:18:16,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2666 transitions. [2024-10-10 23:18:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-10 23:18:16,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:16,428 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:18:16,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:18:16,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:16,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:16,429 INFO L85 PathProgramCache]: Analyzing trace with hash -39023826, now seen corresponding path program 1 times [2024-10-10 23:18:16,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:16,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021896316] [2024-10-10 23:18:16,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:16,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:16,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:16,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021896316] [2024-10-10 23:18:16,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021896316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:16,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:16,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:18:16,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129449530] [2024-10-10 23:18:16,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:16,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:18:16,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:16,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:18:16,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:16,980 INFO L87 Difference]: Start difference. First operand 2099 states and 2666 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:18,464 INFO L93 Difference]: Finished difference Result 6987 states and 9013 transitions. [2024-10-10 23:18:18,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:18:18,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-10 23:18:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:18,482 INFO L225 Difference]: With dead ends: 6987 [2024-10-10 23:18:18,483 INFO L226 Difference]: Without dead ends: 4889 [2024-10-10 23:18:18,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:18,488 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 322 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:18,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 68 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:18:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2024-10-10 23:18:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 4689. [2024-10-10 23:18:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4688 states have (on average 1.251919795221843) internal successors, (5869), 4688 states have internal predecessors, (5869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 5869 transitions. [2024-10-10 23:18:18,606 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 5869 transitions. Word has length 236 [2024-10-10 23:18:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:18,607 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 5869 transitions. [2024-10-10 23:18:18,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 5869 transitions. [2024-10-10 23:18:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-10 23:18:18,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:18,611 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:18:18,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:18:18,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:18,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:18,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1425667709, now seen corresponding path program 1 times [2024-10-10 23:18:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:18,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697584220] [2024-10-10 23:18:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:18,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-10 23:18:18,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:18,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697584220] [2024-10-10 23:18:18,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697584220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:18,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:18,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:18,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916372282] [2024-10-10 23:18:18,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:18,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:18,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:18,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:18,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:18,862 INFO L87 Difference]: Start difference. First operand 4689 states and 5869 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:19,692 INFO L93 Difference]: Finished difference Result 10495 states and 13348 transitions. [2024-10-10 23:18:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:19,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 237 [2024-10-10 23:18:19,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:19,715 INFO L225 Difference]: With dead ends: 10495 [2024-10-10 23:18:19,715 INFO L226 Difference]: Without dead ends: 6175 [2024-10-10 23:18:19,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:19,724 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 141 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:19,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 368 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:18:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6175 states. [2024-10-10 23:18:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6175 to 5977. [2024-10-10 23:18:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5977 states, 5976 states have (on average 1.22975234270415) internal successors, (7349), 5976 states have internal predecessors, (7349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5977 states to 5977 states and 7349 transitions. [2024-10-10 23:18:19,882 INFO L78 Accepts]: Start accepts. Automaton has 5977 states and 7349 transitions. Word has length 237 [2024-10-10 23:18:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:19,883 INFO L471 AbstractCegarLoop]: Abstraction has 5977 states and 7349 transitions. [2024-10-10 23:18:19,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 5977 states and 7349 transitions. [2024-10-10 23:18:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-10 23:18:19,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:19,889 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:19,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:18:19,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:19,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:19,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1419962307, now seen corresponding path program 1 times [2024-10-10 23:18:19,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:19,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703088748] [2024-10-10 23:18:19,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:19,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-10 23:18:20,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:20,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703088748] [2024-10-10 23:18:20,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703088748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:20,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:20,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263358588] [2024-10-10 23:18:20,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:20,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:20,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:20,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:20,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:20,174 INFO L87 Difference]: Start difference. First operand 5977 states and 7349 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:21,025 INFO L93 Difference]: Finished difference Result 14180 states and 17518 transitions. [2024-10-10 23:18:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:21,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 247 [2024-10-10 23:18:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:21,058 INFO L225 Difference]: With dead ends: 14180 [2024-10-10 23:18:21,059 INFO L226 Difference]: Without dead ends: 8572 [2024-10-10 23:18:21,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:21,069 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 163 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:21,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 327 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:18:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8572 states. [2024-10-10 23:18:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8572 to 8016. [2024-10-10 23:18:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8016 states, 8015 states have (on average 1.216968184653774) internal successors, (9754), 8015 states have internal predecessors, (9754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8016 states to 8016 states and 9754 transitions. [2024-10-10 23:18:21,250 INFO L78 Accepts]: Start accepts. Automaton has 8016 states and 9754 transitions. Word has length 247 [2024-10-10 23:18:21,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:21,251 INFO L471 AbstractCegarLoop]: Abstraction has 8016 states and 9754 transitions. [2024-10-10 23:18:21,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8016 states and 9754 transitions. [2024-10-10 23:18:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-10 23:18:21,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:21,257 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:21,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:18:21,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:21,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:21,261 INFO L85 PathProgramCache]: Analyzing trace with hash -353037167, now seen corresponding path program 1 times [2024-10-10 23:18:21,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:21,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269098679] [2024-10-10 23:18:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:21,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-10 23:18:21,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:21,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269098679] [2024-10-10 23:18:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269098679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:21,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:21,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527645584] [2024-10-10 23:18:21,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:21,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:21,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:21,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:21,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:21,491 INFO L87 Difference]: Start difference. First operand 8016 states and 9754 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:22,304 INFO L93 Difference]: Finished difference Result 17344 states and 21232 transitions. [2024-10-10 23:18:22,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:22,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 257 [2024-10-10 23:18:22,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:22,340 INFO L225 Difference]: With dead ends: 17344 [2024-10-10 23:18:22,340 INFO L226 Difference]: Without dead ends: 9697 [2024-10-10 23:18:22,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:22,353 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 145 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:22,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 197 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9697 states. [2024-10-10 23:18:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9697 to 9303. [2024-10-10 23:18:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9303 states, 9302 states have (on average 1.2159750591270695) internal successors, (11311), 9302 states have internal predecessors, (11311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9303 states to 9303 states and 11311 transitions. [2024-10-10 23:18:22,546 INFO L78 Accepts]: Start accepts. Automaton has 9303 states and 11311 transitions. Word has length 257 [2024-10-10 23:18:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:22,546 INFO L471 AbstractCegarLoop]: Abstraction has 9303 states and 11311 transitions. [2024-10-10 23:18:22,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 9303 states and 11311 transitions. [2024-10-10 23:18:22,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-10 23:18:22,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:22,553 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:22,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:18:22,554 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:22,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:22,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1776038293, now seen corresponding path program 1 times [2024-10-10 23:18:22,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:22,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589005590] [2024-10-10 23:18:22,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:22,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 23:18:22,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:22,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589005590] [2024-10-10 23:18:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589005590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:22,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:22,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:22,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572842118] [2024-10-10 23:18:22,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:22,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:22,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:22,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:22,702 INFO L87 Difference]: Start difference. First operand 9303 states and 11311 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:23,447 INFO L93 Difference]: Finished difference Result 18204 states and 22187 transitions. [2024-10-10 23:18:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:23,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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 258 [2024-10-10 23:18:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:23,466 INFO L225 Difference]: With dead ends: 18204 [2024-10-10 23:18:23,466 INFO L226 Difference]: Without dead ends: 9270 [2024-10-10 23:18:23,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:23,477 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 114 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:23,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 148 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9270 states. [2024-10-10 23:18:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9270 to 9085. [2024-10-10 23:18:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9085 states, 9084 states have (on average 1.1512549537648613) internal successors, (10458), 9084 states have internal predecessors, (10458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9085 states to 9085 states and 10458 transitions. [2024-10-10 23:18:23,623 INFO L78 Accepts]: Start accepts. Automaton has 9085 states and 10458 transitions. Word has length 258 [2024-10-10 23:18:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:23,623 INFO L471 AbstractCegarLoop]: Abstraction has 9085 states and 10458 transitions. [2024-10-10 23:18:23,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9085 states and 10458 transitions. [2024-10-10 23:18:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-10-10 23:18:23,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:23,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:23,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:18:23,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:23,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 651111351, now seen corresponding path program 1 times [2024-10-10 23:18:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:23,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810092021] [2024-10-10 23:18:23,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:23,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-10 23:18:23,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810092021] [2024-10-10 23:18:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810092021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:23,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:23,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:23,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17360541] [2024-10-10 23:18:23,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:23,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:23,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:23,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:23,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:23,927 INFO L87 Difference]: Start difference. First operand 9085 states and 10458 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:24,711 INFO L93 Difference]: Finished difference Result 18357 states and 21125 transitions. [2024-10-10 23:18:24,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:24,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 288 [2024-10-10 23:18:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:24,729 INFO L225 Difference]: With dead ends: 18357 [2024-10-10 23:18:24,729 INFO L226 Difference]: Without dead ends: 9457 [2024-10-10 23:18:24,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:24,740 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 145 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:24,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 371 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9457 states. [2024-10-10 23:18:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9457 to 9452. [2024-10-10 23:18:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9452 states, 9451 states have (on average 1.1241138503862025) internal successors, (10624), 9451 states have internal predecessors, (10624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 10624 transitions. [2024-10-10 23:18:24,861 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 10624 transitions. Word has length 288 [2024-10-10 23:18:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:24,862 INFO L471 AbstractCegarLoop]: Abstraction has 9452 states and 10624 transitions. [2024-10-10 23:18:24,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 10624 transitions. [2024-10-10 23:18:24,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-10-10 23:18:24,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:24,872 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:18:24,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:18:24,873 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:24,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:24,873 INFO L85 PathProgramCache]: Analyzing trace with hash -14193191, now seen corresponding path program 1 times [2024-10-10 23:18:24,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:24,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693451426] [2024-10-10 23:18:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:24,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 23:18:25,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:25,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693451426] [2024-10-10 23:18:25,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693451426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:25,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:25,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:25,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492436151] [2024-10-10 23:18:25,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:25,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:25,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:25,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:25,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:25,371 INFO L87 Difference]: Start difference. First operand 9452 states and 10624 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:26,126 INFO L93 Difference]: Finished difference Result 21306 states and 24060 transitions. [2024-10-10 23:18:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:26,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 318 [2024-10-10 23:18:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:26,149 INFO L225 Difference]: With dead ends: 21306 [2024-10-10 23:18:26,149 INFO L226 Difference]: Without dead ends: 12223 [2024-10-10 23:18:26,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:26,161 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 140 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:26,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 122 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:26,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12223 states. [2024-10-10 23:18:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12223 to 12221. [2024-10-10 23:18:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12221 states, 12220 states have (on average 1.1161211129296236) internal successors, (13639), 12220 states have internal predecessors, (13639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12221 states to 12221 states and 13639 transitions. [2024-10-10 23:18:26,309 INFO L78 Accepts]: Start accepts. Automaton has 12221 states and 13639 transitions. Word has length 318 [2024-10-10 23:18:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:26,310 INFO L471 AbstractCegarLoop]: Abstraction has 12221 states and 13639 transitions. [2024-10-10 23:18:26,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 12221 states and 13639 transitions. [2024-10-10 23:18:26,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-10 23:18:26,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:26,322 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:18:26,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:18:26,323 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:26,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:26,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1374191474, now seen corresponding path program 1 times [2024-10-10 23:18:26,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:26,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836944425] [2024-10-10 23:18:26,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:26,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 242 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:27,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:27,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836944425] [2024-10-10 23:18:27,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836944425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:18:27,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466378623] [2024-10-10 23:18:27,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:27,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:27,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:27,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:18:27,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:18:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:27,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:18:27,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:18:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:18:27,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:18:27,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466378623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:27,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:18:27,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:18:27,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21431488] [2024-10-10 23:18:27,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:27,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:27,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:27,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:18:27,756 INFO L87 Difference]: Start difference. First operand 12221 states and 13639 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:28,366 INFO L93 Difference]: Finished difference Result 25382 states and 28426 transitions. [2024-10-10 23:18:28,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:28,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 328 [2024-10-10 23:18:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:28,389 INFO L225 Difference]: With dead ends: 25382 [2024-10-10 23:18:28,389 INFO L226 Difference]: Without dead ends: 13530 [2024-10-10 23:18:28,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:18:28,403 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 137 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:28,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 339 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:18:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13530 states. [2024-10-10 23:18:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13530 to 13521. [2024-10-10 23:18:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13521 states, 13520 states have (on average 1.1178254437869823) internal successors, (15113), 13520 states have internal predecessors, (15113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13521 states to 13521 states and 15113 transitions. [2024-10-10 23:18:28,649 INFO L78 Accepts]: Start accepts. Automaton has 13521 states and 15113 transitions. Word has length 328 [2024-10-10 23:18:28,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:28,649 INFO L471 AbstractCegarLoop]: Abstraction has 13521 states and 15113 transitions. [2024-10-10 23:18:28,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 13521 states and 15113 transitions. [2024-10-10 23:18:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-10 23:18:28,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:28,662 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:28,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:18:28,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 23:18:28,863 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:28,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash 755901531, now seen corresponding path program 1 times [2024-10-10 23:18:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:28,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250270429] [2024-10-10 23:18:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:28,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:18:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:29,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250270429] [2024-10-10 23:18:29,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250270429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:29,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:29,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:29,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377666764] [2024-10-10 23:18:29,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:29,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:29,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:29,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:29,078 INFO L87 Difference]: Start difference. First operand 13521 states and 15113 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:29,536 INFO L93 Difference]: Finished difference Result 26662 states and 29834 transitions. [2024-10-10 23:18:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:29,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 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 337 [2024-10-10 23:18:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:29,555 INFO L225 Difference]: With dead ends: 26662 [2024-10-10 23:18:29,556 INFO L226 Difference]: Without dead ends: 13510 [2024-10-10 23:18:29,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:29,568 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:29,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 37 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:18:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13510 states. [2024-10-10 23:18:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13510 to 13505. [2024-10-10 23:18:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13505 states, 13504 states have (on average 1.117076421800948) internal successors, (15085), 13504 states have internal predecessors, (15085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13505 states to 13505 states and 15085 transitions. [2024-10-10 23:18:29,725 INFO L78 Accepts]: Start accepts. Automaton has 13505 states and 15085 transitions. Word has length 337 [2024-10-10 23:18:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:29,726 INFO L471 AbstractCegarLoop]: Abstraction has 13505 states and 15085 transitions. [2024-10-10 23:18:29,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 13505 states and 15085 transitions. [2024-10-10 23:18:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-10 23:18:29,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:29,736 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:29,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:18:29,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:29,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:29,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1998007539, now seen corresponding path program 1 times [2024-10-10 23:18:29,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:29,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987499676] [2024-10-10 23:18:29,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 23:18:30,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:30,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987499676] [2024-10-10 23:18:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987499676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:30,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704380786] [2024-10-10 23:18:30,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:30,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:18:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:30,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:18:30,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:30,281 INFO L87 Difference]: Start difference. First operand 13505 states and 15085 transitions. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:31,469 INFO L93 Difference]: Finished difference Result 28861 states and 32244 transitions. [2024-10-10 23:18:31,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:18:31,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 349 [2024-10-10 23:18:31,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:31,492 INFO L225 Difference]: With dead ends: 28861 [2024-10-10 23:18:31,493 INFO L226 Difference]: Without dead ends: 15725 [2024-10-10 23:18:31,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:31,506 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 215 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:31,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 135 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:18:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15725 states. [2024-10-10 23:18:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15725 to 15717. [2024-10-10 23:18:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15717 states, 15716 states have (on average 1.1105243064392976) internal successors, (17453), 15716 states have internal predecessors, (17453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15717 states to 15717 states and 17453 transitions. [2024-10-10 23:18:31,787 INFO L78 Accepts]: Start accepts. Automaton has 15717 states and 17453 transitions. Word has length 349 [2024-10-10 23:18:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:31,788 INFO L471 AbstractCegarLoop]: Abstraction has 15717 states and 17453 transitions. [2024-10-10 23:18:31,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 15717 states and 17453 transitions. [2024-10-10 23:18:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-10-10 23:18:31,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:31,797 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:31,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:18:31,797 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:31,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash 420427061, now seen corresponding path program 1 times [2024-10-10 23:18:31,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:31,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500944137] [2024-10-10 23:18:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-10 23:18:32,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:32,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500944137] [2024-10-10 23:18:32,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500944137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:32,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:32,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:18:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061144565] [2024-10-10 23:18:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:32,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:18:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:32,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:18:32,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:32,443 INFO L87 Difference]: Start difference. First operand 15717 states and 17453 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:33,516 INFO L93 Difference]: Finished difference Result 32358 states and 35958 transitions. [2024-10-10 23:18:33,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:18:33,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 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 362 [2024-10-10 23:18:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:33,539 INFO L225 Difference]: With dead ends: 32358 [2024-10-10 23:18:33,539 INFO L226 Difference]: Without dead ends: 17010 [2024-10-10 23:18:33,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:33,552 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 307 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:33,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 133 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:18:33,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17010 states. [2024-10-10 23:18:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17010 to 16269. [2024-10-10 23:18:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16269 states, 16268 states have (on average 1.1089869682812885) internal successors, (18041), 16268 states have internal predecessors, (18041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16269 states to 16269 states and 18041 transitions. [2024-10-10 23:18:33,746 INFO L78 Accepts]: Start accepts. Automaton has 16269 states and 18041 transitions. Word has length 362 [2024-10-10 23:18:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:33,747 INFO L471 AbstractCegarLoop]: Abstraction has 16269 states and 18041 transitions. [2024-10-10 23:18:33,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 16269 states and 18041 transitions. [2024-10-10 23:18:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2024-10-10 23:18:33,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:33,758 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:33,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:18:33,759 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:33,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash 240693292, now seen corresponding path program 1 times [2024-10-10 23:18:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:33,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505642763] [2024-10-10 23:18:33,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:18:34,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:34,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505642763] [2024-10-10 23:18:34,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505642763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:34,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:34,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:34,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782219791] [2024-10-10 23:18:34,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:34,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:18:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:34,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:18:34,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:34,185 INFO L87 Difference]: Start difference. First operand 16269 states and 18041 transitions. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:35,253 INFO L93 Difference]: Finished difference Result 43056 states and 47696 transitions. [2024-10-10 23:18:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:18:35,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 376 [2024-10-10 23:18:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:35,288 INFO L225 Difference]: With dead ends: 43056 [2024-10-10 23:18:35,288 INFO L226 Difference]: Without dead ends: 26232 [2024-10-10 23:18:35,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:35,306 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 225 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:35,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 66 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:18:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26232 states. [2024-10-10 23:18:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26232 to 24939. [2024-10-10 23:18:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24939 states, 24938 states have (on average 1.101732296094314) internal successors, (27475), 24938 states have internal predecessors, (27475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24939 states to 24939 states and 27475 transitions. [2024-10-10 23:18:35,626 INFO L78 Accepts]: Start accepts. Automaton has 24939 states and 27475 transitions. Word has length 376 [2024-10-10 23:18:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:35,626 INFO L471 AbstractCegarLoop]: Abstraction has 24939 states and 27475 transitions. [2024-10-10 23:18:35,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 24939 states and 27475 transitions. [2024-10-10 23:18:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-10-10 23:18:35,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:35,641 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:35,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:18:35,641 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:35,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2047818624, now seen corresponding path program 1 times [2024-10-10 23:18:35,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:35,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803168170] [2024-10-10 23:18:35,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:35,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-10-10 23:18:36,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:36,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803168170] [2024-10-10 23:18:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803168170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:36,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:36,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842683896] [2024-10-10 23:18:36,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:36,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:36,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:36,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:36,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:36,224 INFO L87 Difference]: Start difference. First operand 24939 states and 27475 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:36,825 INFO L93 Difference]: Finished difference Result 28805 states and 31707 transitions. [2024-10-10 23:18:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:36,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 407 [2024-10-10 23:18:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:36,851 INFO L225 Difference]: With dead ends: 28805 [2024-10-10 23:18:36,851 INFO L226 Difference]: Without dead ends: 28803 [2024-10-10 23:18:36,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:36,860 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 165 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:36,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 130 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:18:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28803 states. [2024-10-10 23:18:37,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28803 to 25307. [2024-10-10 23:18:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25307 states, 25306 states have (on average 1.1021892041413104) internal successors, (27892), 25306 states have internal predecessors, (27892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25307 states to 25307 states and 27892 transitions. [2024-10-10 23:18:37,265 INFO L78 Accepts]: Start accepts. Automaton has 25307 states and 27892 transitions. Word has length 407 [2024-10-10 23:18:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:37,266 INFO L471 AbstractCegarLoop]: Abstraction has 25307 states and 27892 transitions. [2024-10-10 23:18:37,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 25307 states and 27892 transitions. [2024-10-10 23:18:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2024-10-10 23:18:37,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:37,285 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:37,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:18:37,285 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:37,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:37,286 INFO L85 PathProgramCache]: Analyzing trace with hash -238395606, now seen corresponding path program 1 times [2024-10-10 23:18:37,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:37,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986022032] [2024-10-10 23:18:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:37,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 23:18:37,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:37,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986022032] [2024-10-10 23:18:37,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986022032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:37,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:37,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:37,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77532398] [2024-10-10 23:18:37,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:37,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:37,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:37,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:37,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:37,579 INFO L87 Difference]: Start difference. First operand 25307 states and 27892 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:38,265 INFO L93 Difference]: Finished difference Result 54666 states and 60217 transitions. [2024-10-10 23:18:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:38,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 418 [2024-10-10 23:18:38,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:38,297 INFO L225 Difference]: With dead ends: 54666 [2024-10-10 23:18:38,297 INFO L226 Difference]: Without dead ends: 29912 [2024-10-10 23:18:38,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:38,314 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:38,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 66 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:18:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29912 states. [2024-10-10 23:18:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29912 to 29723. [2024-10-10 23:18:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29723 states, 29722 states have (on average 1.0919520893614159) internal successors, (32455), 29722 states have internal predecessors, (32455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29723 states to 29723 states and 32455 transitions. [2024-10-10 23:18:38,611 INFO L78 Accepts]: Start accepts. Automaton has 29723 states and 32455 transitions. Word has length 418 [2024-10-10 23:18:38,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:38,611 INFO L471 AbstractCegarLoop]: Abstraction has 29723 states and 32455 transitions. [2024-10-10 23:18:38,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 29723 states and 32455 transitions. [2024-10-10 23:18:38,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-10 23:18:38,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:38,620 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:18:38,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:18:38,620 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:38,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:38,621 INFO L85 PathProgramCache]: Analyzing trace with hash 932881900, now seen corresponding path program 1 times [2024-10-10 23:18:38,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:38,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266395353] [2024-10-10 23:18:38,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:38,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 23:18:39,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:39,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266395353] [2024-10-10 23:18:39,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266395353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:39,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:39,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:18:39,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050995850] [2024-10-10 23:18:39,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:39,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:18:39,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:39,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:18:39,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:39,183 INFO L87 Difference]: Start difference. First operand 29723 states and 32455 transitions. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:40,295 INFO L93 Difference]: Finished difference Result 63686 states and 69563 transitions. [2024-10-10 23:18:40,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:18:40,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 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 426 [2024-10-10 23:18:40,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:40,335 INFO L225 Difference]: With dead ends: 63686 [2024-10-10 23:18:40,335 INFO L226 Difference]: Without dead ends: 34700 [2024-10-10 23:18:40,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:40,356 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 265 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:40,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 82 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:18:40,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34700 states. [2024-10-10 23:18:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34700 to 30830. [2024-10-10 23:18:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30830 states, 30829 states have (on average 1.0880988679490091) internal successors, (33545), 30829 states have internal predecessors, (33545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30830 states to 30830 states and 33545 transitions. [2024-10-10 23:18:40,768 INFO L78 Accepts]: Start accepts. Automaton has 30830 states and 33545 transitions. Word has length 426 [2024-10-10 23:18:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:40,768 INFO L471 AbstractCegarLoop]: Abstraction has 30830 states and 33545 transitions. [2024-10-10 23:18:40,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 30830 states and 33545 transitions. [2024-10-10 23:18:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-10-10 23:18:40,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:40,777 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:40,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:18:40,778 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:40,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:40,778 INFO L85 PathProgramCache]: Analyzing trace with hash 315780294, now seen corresponding path program 1 times [2024-10-10 23:18:40,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:40,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274407941] [2024-10-10 23:18:40,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 249 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:41,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274407941] [2024-10-10 23:18:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274407941] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:18:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096586078] [2024-10-10 23:18:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:41,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:41,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:41,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:18:41,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:18:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:41,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 23:18:41,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:18:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 230 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:43,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:18:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 303 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:45,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096586078] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:18:45,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:18:45,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-10-10 23:18:45,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199260395] [2024-10-10 23:18:45,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:18:45,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-10 23:18:45,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:45,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-10 23:18:45,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-10 23:18:45,404 INFO L87 Difference]: Start difference. First operand 30830 states and 33545 transitions. Second operand has 12 states, 12 states have (on average 102.58333333333333) internal successors, (1231), 11 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:50,846 INFO L93 Difference]: Finished difference Result 76956 states and 83698 transitions. [2024-10-10 23:18:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-10 23:18:50,847 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 102.58333333333333) internal successors, (1231), 11 states have internal predecessors, (1231), 0 states have call successors, (0), 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 429 [2024-10-10 23:18:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:50,893 INFO L225 Difference]: With dead ends: 76956 [2024-10-10 23:18:50,893 INFO L226 Difference]: Without dead ends: 46311 [2024-10-10 23:18:50,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2024-10-10 23:18:50,910 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 2535 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 6201 mSolverCounterSat, 1367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2535 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 7568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1367 IncrementalHoareTripleChecker+Valid, 6201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:50,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2535 Valid, 231 Invalid, 7568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1367 Valid, 6201 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-10 23:18:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46311 states. [2024-10-10 23:18:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46311 to 29358. [2024-10-10 23:18:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29358 states, 29357 states have (on average 1.077289913819532) internal successors, (31626), 29357 states have internal predecessors, (31626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29358 states to 29358 states and 31626 transitions. [2024-10-10 23:18:51,266 INFO L78 Accepts]: Start accepts. Automaton has 29358 states and 31626 transitions. Word has length 429 [2024-10-10 23:18:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:51,267 INFO L471 AbstractCegarLoop]: Abstraction has 29358 states and 31626 transitions. [2024-10-10 23:18:51,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 102.58333333333333) internal successors, (1231), 11 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 29358 states and 31626 transitions. [2024-10-10 23:18:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2024-10-10 23:18:51,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:51,274 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:18:51,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:18:51,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:51,475 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:51,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:51,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1520252139, now seen corresponding path program 1 times [2024-10-10 23:18:51,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:51,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405258956] [2024-10-10 23:18:51,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:51,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-10-10 23:18:51,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:51,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405258956] [2024-10-10 23:18:51,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405258956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:51,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:51,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330514475] [2024-10-10 23:18:51,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:51,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:51,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:51,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:51,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:51,788 INFO L87 Difference]: Start difference. First operand 29358 states and 31626 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:52,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:52,378 INFO L93 Difference]: Finished difference Result 34144 states and 36689 transitions. [2024-10-10 23:18:52,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:52,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 443 [2024-10-10 23:18:52,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:52,420 INFO L225 Difference]: With dead ends: 34144 [2024-10-10 23:18:52,420 INFO L226 Difference]: Without dead ends: 34142 [2024-10-10 23:18:52,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:52,433 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 167 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:52,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 129 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:18:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34142 states. [2024-10-10 23:18:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34142 to 28990. [2024-10-10 23:18:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28990 states, 28989 states have (on average 1.077788126530753) internal successors, (31244), 28989 states have internal predecessors, (31244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28990 states to 28990 states and 31244 transitions. [2024-10-10 23:18:52,876 INFO L78 Accepts]: Start accepts. Automaton has 28990 states and 31244 transitions. Word has length 443 [2024-10-10 23:18:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:52,877 INFO L471 AbstractCegarLoop]: Abstraction has 28990 states and 31244 transitions. [2024-10-10 23:18:52,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28990 states and 31244 transitions. [2024-10-10 23:18:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-10-10 23:18:52,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:52,889 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:52,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 23:18:52,890 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:52,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1281662431, now seen corresponding path program 1 times [2024-10-10 23:18:52,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:52,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017647238] [2024-10-10 23:18:52,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:52,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 464 proven. 222 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 23:18:53,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:53,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017647238] [2024-10-10 23:18:53,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017647238] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:18:53,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703320705] [2024-10-10 23:18:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:53,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:53,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:53,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:18:53,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:18:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:53,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-10 23:18:53,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:18:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 464 proven. 222 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 23:18:55,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:18:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 464 proven. 222 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 23:18:56,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703320705] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:18:56,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:18:56,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-10 23:18:56,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957063586] [2024-10-10 23:18:56,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:18:56,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 23:18:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:56,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 23:18:56,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-10 23:18:56,819 INFO L87 Difference]: Start difference. First operand 28990 states and 31244 transitions. Second operand has 11 states, 11 states have (on average 64.18181818181819) internal successors, (706), 10 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:00,695 INFO L93 Difference]: Finished difference Result 60966 states and 65569 transitions. [2024-10-10 23:19:00,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-10 23:19:00,696 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 64.18181818181819) internal successors, (706), 10 states have internal predecessors, (706), 0 states have call successors, (0), 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 504 [2024-10-10 23:19:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:00,733 INFO L225 Difference]: With dead ends: 60966 [2024-10-10 23:19:00,733 INFO L226 Difference]: Without dead ends: 32345 [2024-10-10 23:19:00,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1030 GetRequests, 1003 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=536, Unknown=0, NotChecked=0, Total=812 [2024-10-10 23:19:00,757 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3161 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 3662 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3161 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 4849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 3662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:00,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3161 Valid, 96 Invalid, 4849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 3662 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-10 23:19:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32345 states. [2024-10-10 23:19:01,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32345 to 18832. [2024-10-10 23:19:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18832 states, 18831 states have (on average 1.0753013647708565) internal successors, (20249), 18831 states have internal predecessors, (20249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18832 states to 18832 states and 20249 transitions. [2024-10-10 23:19:01,075 INFO L78 Accepts]: Start accepts. Automaton has 18832 states and 20249 transitions. Word has length 504 [2024-10-10 23:19:01,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:01,076 INFO L471 AbstractCegarLoop]: Abstraction has 18832 states and 20249 transitions. [2024-10-10 23:19:01,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.18181818181819) internal successors, (706), 10 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:01,076 INFO L276 IsEmpty]: Start isEmpty. Operand 18832 states and 20249 transitions. [2024-10-10 23:19:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2024-10-10 23:19:01,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:01,126 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:01,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 23:19:01,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:19:01,327 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:01,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:01,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1991092206, now seen corresponding path program 1 times [2024-10-10 23:19:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:01,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322976229] [2024-10-10 23:19:01,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:01,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 410 proven. 206 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-10 23:19:02,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:02,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322976229] [2024-10-10 23:19:02,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322976229] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:19:02,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624280996] [2024-10-10 23:19:02,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:02,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:19:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:19:02,283 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:19:02,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:19:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:02,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 23:19:02,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:19:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 356 proven. 260 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-10 23:19:03,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:19:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 547 proven. 69 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-10 23:19:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624280996] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:19:06,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:19:06,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-10 23:19:06,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126647529] [2024-10-10 23:19:06,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:19:06,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 23:19:06,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:06,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 23:19:06,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:19:06,168 INFO L87 Difference]: Start difference. First operand 18832 states and 20249 transitions. Second operand has 10 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:09,681 INFO L93 Difference]: Finished difference Result 47623 states and 51280 transitions. [2024-10-10 23:19:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 23:19:09,682 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 0 states have call successors, (0), 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 540 [2024-10-10 23:19:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:09,683 INFO L225 Difference]: With dead ends: 47623 [2024-10-10 23:19:09,683 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:19:09,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 1073 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:19:09,700 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 1000 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4840 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 5403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 4840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:09,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 169 Invalid, 5403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 4840 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-10 23:19:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:19:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:19:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:19:09,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 540 [2024-10-10 23:19:09,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:09,702 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:19:09,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:19:09,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:19:09,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:19:09,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 23:19:09,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-10 23:19:09,910 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-10 23:19:09,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.