./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label40.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8fd8a7f4bc5b8a783328ea3ccb02a1c89ebaa08f4ab2de173aa0152f6877b7b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:50:21,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:50:22,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:50:22,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:50:22,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:50:22,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:50:22,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:50:22,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:50:22,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:50:22,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:50:22,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:50:22,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:50:22,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:50:22,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:50:22,101 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:50:22,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:50:22,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:50:22,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:50:22,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:50:22,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:50:22,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:50:22,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:50:22,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:50:22,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:50:22,106 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:50:22,107 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:50:22,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:50:22,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:50:22,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:50:22,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:50:22,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:50:22,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:50:22,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:50:22,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:50:22,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:50:22,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:50:22,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:50:22,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:50:22,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:50:22,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:50:22,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:50:22,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:50:22,112 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8fd8a7f4bc5b8a783328ea3ccb02a1c89ebaa08f4ab2de173aa0152f6877b7b [2024-11-11 16:50:22,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:50:22,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:50:22,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:50:22,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:50:22,369 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:50:22,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label40.c [2024-11-11 16:50:23,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:50:24,161 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:50:24,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label40.c [2024-11-11 16:50:24,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417a1cca7/82e8cfa427424c799b014d90f993537a/FLAGebd7ba085 [2024-11-11 16:50:24,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417a1cca7/82e8cfa427424c799b014d90f993537a [2024-11-11 16:50:24,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:50:24,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:50:24,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:50:24,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:50:24,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:50:24,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:50:24" (1/1) ... [2024-11-11 16:50:24,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45833849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:24, skipping insertion in model container [2024-11-11 16:50:24,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:50:24" (1/1) ... [2024-11-11 16:50:24,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:50:24,524 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label40.c[6409,6422] [2024-11-11 16:50:24,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:50:24,834 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:50:24,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label40.c[6409,6422] [2024-11-11 16:50:25,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:50:25,115 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:50:25,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25 WrapperNode [2024-11-11 16:50:25,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:50:25,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:50:25,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:50:25,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:50:25,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (1/1) ... [2024-11-11 16:50:25,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (1/1) ... [2024-11-11 16:50:25,264 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-11 16:50:25,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:50:25,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:50:25,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:50:25,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:50:25,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (1/1) ... [2024-11-11 16:50:25,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (1/1) ... [2024-11-11 16:50:25,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (1/1) ... [2024-11-11 16:50:25,337 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:50:25,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (1/1) ... [2024-11-11 16:50:25,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (1/1) ... [2024-11-11 16:50:25,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (1/1) ... [2024-11-11 16:50:25,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (1/1) ... [2024-11-11 16:50:25,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (1/1) ... [2024-11-11 16:50:25,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (1/1) ... [2024-11-11 16:50:25,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:50:25,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:50:25,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:50:25,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:50:25,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (1/1) ... [2024-11-11 16:50:25,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:50:25,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:50:25,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:50:25,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:50:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:50:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:50:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:50:25,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:50:25,587 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:50:25,588 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:50:27,129 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-11 16:50:27,129 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:50:27,152 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:50:27,154 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:50:27,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:50:27 BoogieIcfgContainer [2024-11-11 16:50:27,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:50:27,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:50:27,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:50:27,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:50:27,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:50:24" (1/3) ... [2024-11-11 16:50:27,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d22062a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:50:27, skipping insertion in model container [2024-11-11 16:50:27,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:25" (2/3) ... [2024-11-11 16:50:27,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d22062a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:50:27, skipping insertion in model container [2024-11-11 16:50:27,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:50:27" (3/3) ... [2024-11-11 16:50:27,164 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label40.c [2024-11-11 16:50:27,180 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:50:27,180 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:50:27,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:50:27,263 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;@103b59f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:50:27,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:50:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 16:50:27,278 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:27,280 INFO L218 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] [2024-11-11 16:50:27,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:27,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash 626000386, now seen corresponding path program 1 times [2024-11-11 16:50:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:27,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547591461] [2024-11-11 16:50:27,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:27,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:27,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:27,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547591461] [2024-11-11 16:50:27,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547591461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:27,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:27,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:27,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669907823] [2024-11-11 16:50:27,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:27,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:27,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:27,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:27,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:27,706 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:28,868 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-11 16:50:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:28,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-11-11 16:50:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:28,888 INFO L225 Difference]: With dead ends: 761 [2024-11-11 16:50:28,889 INFO L226 Difference]: Without dead ends: 413 [2024-11-11 16:50:28,894 INFO L434 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-11-11 16:50:28,899 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 184 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:28,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 16:50:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-11 16:50:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-11 16:50:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-11 16:50:28,964 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 44 [2024-11-11 16:50:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:28,965 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-11 16:50:28,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-11 16:50:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 16:50:28,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:28,968 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:28,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:50:28,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:28,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1200539258, now seen corresponding path program 1 times [2024-11-11 16:50:28,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:28,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787503443] [2024-11-11 16:50:28,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:29,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:29,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787503443] [2024-11-11 16:50:29,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787503443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:29,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:29,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:29,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318895456] [2024-11-11 16:50:29,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:29,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:29,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:29,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:29,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:29,239 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:29,993 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-11 16:50:29,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:29,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-11 16:50:29,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:29,998 INFO L225 Difference]: With dead ends: 1211 [2024-11-11 16:50:29,999 INFO L226 Difference]: Without dead ends: 800 [2024-11-11 16:50:30,000 INFO L434 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-11-11 16:50:30,002 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:30,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 118 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:50:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-11 16:50:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-11 16:50:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2024-11-11 16:50:30,037 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 112 [2024-11-11 16:50:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:30,037 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2024-11-11 16:50:30,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2024-11-11 16:50:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 16:50:30,041 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:30,041 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:30,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:50:30,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:30,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash -590739588, now seen corresponding path program 1 times [2024-11-11 16:50:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:30,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119883311] [2024-11-11 16:50:30,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:30,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:30,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:30,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119883311] [2024-11-11 16:50:30,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119883311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:30,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:30,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:30,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446028601] [2024-11-11 16:50:30,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:30,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:30,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:30,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:30,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:30,426 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:31,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:31,078 INFO L93 Difference]: Finished difference Result 1945 states and 2614 transitions. [2024-11-11 16:50:31,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:31,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-11 16:50:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:31,087 INFO L225 Difference]: With dead ends: 1945 [2024-11-11 16:50:31,087 INFO L226 Difference]: Without dead ends: 1158 [2024-11-11 16:50:31,091 INFO L434 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-11-11 16:50:31,092 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:31,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-11 16:50:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-11 16:50:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2716262975778547) internal successors, (1470), 1156 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1470 transitions. [2024-11-11 16:50:31,130 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1470 transitions. Word has length 113 [2024-11-11 16:50:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:31,131 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1470 transitions. [2024-11-11 16:50:31,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1470 transitions. [2024-11-11 16:50:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-11 16:50:31,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:31,136 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:31,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:50:31,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:31,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1199532265, now seen corresponding path program 1 times [2024-11-11 16:50:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832909275] [2024-11-11 16:50:31,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:31,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:31,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832909275] [2024-11-11 16:50:31,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832909275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:31,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:31,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:31,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855762916] [2024-11-11 16:50:31,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:31,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:50:31,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:31,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:50:31,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:50:31,392 INFO L87 Difference]: Start difference. First operand 1157 states and 1470 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:32,700 INFO L93 Difference]: Finished difference Result 3445 states and 4568 transitions. [2024-11-11 16:50:32,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:50:32,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2024-11-11 16:50:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:32,713 INFO L225 Difference]: With dead ends: 3445 [2024-11-11 16:50:32,713 INFO L226 Difference]: Without dead ends: 2474 [2024-11-11 16:50:32,715 INFO L434 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-11-11 16:50:32,716 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 350 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:32,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 87 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 16:50:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2024-11-11 16:50:32,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2473. [2024-11-11 16:50:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2472 states have (on average 1.287621359223301) internal successors, (3183), 2472 states have internal predecessors, (3183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3183 transitions. [2024-11-11 16:50:32,764 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3183 transitions. Word has length 171 [2024-11-11 16:50:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:32,766 INFO L471 AbstractCegarLoop]: Abstraction has 2473 states and 3183 transitions. [2024-11-11 16:50:32,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3183 transitions. [2024-11-11 16:50:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-11 16:50:32,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:32,773 INFO L218 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, 2, 2, 2, 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] [2024-11-11 16:50:32,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:50:32,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:32,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash -362773066, now seen corresponding path program 1 times [2024-11-11 16:50:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:32,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544405824] [2024-11-11 16:50:32,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:32,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:33,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:33,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544405824] [2024-11-11 16:50:33,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544405824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:33,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:33,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:33,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774819467] [2024-11-11 16:50:33,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:33,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:33,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:33,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:33,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:33,085 INFO L87 Difference]: Start difference. First operand 2473 states and 3183 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:33,850 INFO L93 Difference]: Finished difference Result 5695 states and 7520 transitions. [2024-11-11 16:50:33,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:33,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2024-11-11 16:50:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:33,862 INFO L225 Difference]: With dead ends: 5695 [2024-11-11 16:50:33,862 INFO L226 Difference]: Without dead ends: 3592 [2024-11-11 16:50:33,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:33,866 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:33,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 347 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:50:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2024-11-11 16:50:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 3579. [2024-11-11 16:50:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3579 states, 3578 states have (on average 1.252375628842929) internal successors, (4481), 3578 states have internal predecessors, (4481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 4481 transitions. [2024-11-11 16:50:33,925 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 4481 transitions. Word has length 224 [2024-11-11 16:50:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:33,925 INFO L471 AbstractCegarLoop]: Abstraction has 3579 states and 4481 transitions. [2024-11-11 16:50:33,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 4481 transitions. [2024-11-11 16:50:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-11 16:50:33,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:33,929 INFO L218 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, 2, 2, 2, 2, 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] [2024-11-11 16:50:33,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:50:33,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:33,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:33,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1808781376, now seen corresponding path program 1 times [2024-11-11 16:50:33,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:33,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422964478] [2024-11-11 16:50:33,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:33,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-11 16:50:34,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:34,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422964478] [2024-11-11 16:50:34,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422964478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:34,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:34,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:34,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336191669] [2024-11-11 16:50:34,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:34,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:34,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:34,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:34,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:34,177 INFO L87 Difference]: Start difference. First operand 3579 states and 4481 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:34,867 INFO L93 Difference]: Finished difference Result 7726 states and 9781 transitions. [2024-11-11 16:50:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:34,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 225 [2024-11-11 16:50:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:34,881 INFO L225 Difference]: With dead ends: 7726 [2024-11-11 16:50:34,881 INFO L226 Difference]: Without dead ends: 4517 [2024-11-11 16:50:34,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:34,886 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 158 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:34,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 346 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2024-11-11 16:50:34,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 4499. [2024-11-11 16:50:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4499 states, 4498 states have (on average 1.240773677189862) internal successors, (5581), 4498 states have internal predecessors, (5581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 5581 transitions. [2024-11-11 16:50:34,975 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 5581 transitions. Word has length 225 [2024-11-11 16:50:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:34,976 INFO L471 AbstractCegarLoop]: Abstraction has 4499 states and 5581 transitions. [2024-11-11 16:50:34,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 5581 transitions. [2024-11-11 16:50:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-11 16:50:34,979 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:34,979 INFO L218 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, 2, 2, 2, 2, 2, 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] [2024-11-11 16:50:34,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:50:34,980 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:34,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:34,980 INFO L85 PathProgramCache]: Analyzing trace with hash -218901039, now seen corresponding path program 1 times [2024-11-11 16:50:34,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:34,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000979215] [2024-11-11 16:50:34,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-11 16:50:35,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:35,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000979215] [2024-11-11 16:50:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000979215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:35,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501617475] [2024-11-11 16:50:35,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:35,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:35,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:35,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:35,183 INFO L87 Difference]: Start difference. First operand 4499 states and 5581 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:36,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:36,037 INFO L93 Difference]: Finished difference Result 9741 states and 12305 transitions. [2024-11-11 16:50:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:36,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 226 [2024-11-11 16:50:36,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:36,058 INFO L225 Difference]: With dead ends: 9741 [2024-11-11 16:50:36,058 INFO L226 Difference]: Without dead ends: 5612 [2024-11-11 16:50:36,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:36,066 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 153 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:36,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 371 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:50:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2024-11-11 16:50:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 5419. [2024-11-11 16:50:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5419 states, 5418 states have (on average 1.2331118493909192) internal successors, (6681), 5418 states have internal predecessors, (6681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 6681 transitions. [2024-11-11 16:50:36,158 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 6681 transitions. Word has length 226 [2024-11-11 16:50:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:36,159 INFO L471 AbstractCegarLoop]: Abstraction has 5419 states and 6681 transitions. [2024-11-11 16:50:36,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 6681 transitions. [2024-11-11 16:50:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-11 16:50:36,163 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:36,163 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:50:36,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:50:36,163 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:36,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash -25691425, now seen corresponding path program 1 times [2024-11-11 16:50:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:36,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962012138] [2024-11-11 16:50:36,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-11 16:50:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962012138] [2024-11-11 16:50:36,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962012138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:50:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436812668] [2024-11-11 16:50:36,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:36,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:50:36,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:50:36,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:50:36,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:50:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:36,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 16:50:36,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:50:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-11 16:50:37,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:50:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-11 16:50:38,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436812668] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 16:50:38,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:50:38,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2024-11-11 16:50:38,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026795266] [2024-11-11 16:50:38,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:38,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:50:38,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:38,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:50:38,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:50:38,579 INFO L87 Difference]: Start difference. First operand 5419 states and 6681 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:40,081 INFO L93 Difference]: Finished difference Result 13052 states and 16454 transitions. [2024-11-11 16:50:40,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:50:40,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 246 [2024-11-11 16:50:40,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:40,111 INFO L225 Difference]: With dead ends: 13052 [2024-11-11 16:50:40,111 INFO L226 Difference]: Without dead ends: 8929 [2024-11-11 16:50:40,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:50:40,119 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 361 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:40,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 68 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 16:50:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8929 states. [2024-11-11 16:50:40,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8929 to 8193. [2024-11-11 16:50:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8193 states, 8192 states have (on average 1.245849609375) internal successors, (10206), 8192 states have internal predecessors, (10206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8193 states to 8193 states and 10206 transitions. [2024-11-11 16:50:40,262 INFO L78 Accepts]: Start accepts. Automaton has 8193 states and 10206 transitions. Word has length 246 [2024-11-11 16:50:40,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:40,263 INFO L471 AbstractCegarLoop]: Abstraction has 8193 states and 10206 transitions. [2024-11-11 16:50:40,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:40,263 INFO L276 IsEmpty]: Start isEmpty. Operand 8193 states and 10206 transitions. [2024-11-11 16:50:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-11 16:50:40,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:40,267 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:50:40,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:50:40,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:50:40,472 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:40,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:40,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1131175066, now seen corresponding path program 1 times [2024-11-11 16:50:40,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:40,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846631707] [2024-11-11 16:50:40,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:40,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-11 16:50:40,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:40,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846631707] [2024-11-11 16:50:40,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846631707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:40,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:40,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:40,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525690457] [2024-11-11 16:50:40,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:40,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:40,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:40,751 INFO L87 Difference]: Start difference. First operand 8193 states and 10206 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:41,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:41,551 INFO L93 Difference]: Finished difference Result 16207 states and 20235 transitions. [2024-11-11 16:50:41,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:41,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 253 [2024-11-11 16:50:41,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:41,569 INFO L225 Difference]: With dead ends: 16207 [2024-11-11 16:50:41,569 INFO L226 Difference]: Without dead ends: 8200 [2024-11-11 16:50:41,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:41,579 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 157 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:41,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 379 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:50:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8200 states. [2024-11-11 16:50:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8200 to 8192. [2024-11-11 16:50:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8192 states, 8191 states have (on average 1.2020510316200708) internal successors, (9846), 8191 states have internal predecessors, (9846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 9846 transitions. [2024-11-11 16:50:41,704 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 9846 transitions. Word has length 253 [2024-11-11 16:50:41,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:41,705 INFO L471 AbstractCegarLoop]: Abstraction has 8192 states and 9846 transitions. [2024-11-11 16:50:41,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 9846 transitions. [2024-11-11 16:50:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-11 16:50:41,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:41,712 INFO L218 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:41,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:50:41,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:41,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:41,713 INFO L85 PathProgramCache]: Analyzing trace with hash 126662482, now seen corresponding path program 1 times [2024-11-11 16:50:41,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:41,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240997247] [2024-11-11 16:50:41,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:41,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-11 16:50:41,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:41,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240997247] [2024-11-11 16:50:41,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240997247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:41,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:41,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390941084] [2024-11-11 16:50:41,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:41,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:41,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:41,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:41,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:41,913 INFO L87 Difference]: Start difference. First operand 8192 states and 9846 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:42,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:42,524 INFO L93 Difference]: Finished difference Result 18400 states and 22298 transitions. [2024-11-11 16:50:42,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:42,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 293 [2024-11-11 16:50:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:42,541 INFO L225 Difference]: With dead ends: 18400 [2024-11-11 16:50:42,542 INFO L226 Difference]: Without dead ends: 10392 [2024-11-11 16:50:42,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:42,552 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 174 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:42,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 152 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:42,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10392 states. [2024-11-11 16:50:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10392 to 9283. [2024-11-11 16:50:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9283 states, 9282 states have (on average 1.152014652014652) internal successors, (10693), 9282 states have internal predecessors, (10693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9283 states to 9283 states and 10693 transitions. [2024-11-11 16:50:42,676 INFO L78 Accepts]: Start accepts. Automaton has 9283 states and 10693 transitions. Word has length 293 [2024-11-11 16:50:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:42,676 INFO L471 AbstractCegarLoop]: Abstraction has 9283 states and 10693 transitions. [2024-11-11 16:50:42,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 9283 states and 10693 transitions. [2024-11-11 16:50:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-11 16:50:42,683 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:42,683 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:42,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:50:42,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:42,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:42,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1759383677, now seen corresponding path program 1 times [2024-11-11 16:50:42,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:42,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561145776] [2024-11-11 16:50:42,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:42,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-11 16:50:42,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:42,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561145776] [2024-11-11 16:50:42,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561145776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:42,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:42,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:42,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825758171] [2024-11-11 16:50:42,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:42,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:42,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:42,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:42,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:42,965 INFO L87 Difference]: Start difference. First operand 9283 states and 10693 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:43,574 INFO L93 Difference]: Finished difference Result 17270 states and 19957 transitions. [2024-11-11 16:50:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:43,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 323 [2024-11-11 16:50:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:43,590 INFO L225 Difference]: With dead ends: 17270 [2024-11-11 16:50:43,590 INFO L226 Difference]: Without dead ends: 9281 [2024-11-11 16:50:43,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:43,601 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 148 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:43,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 299 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2024-11-11 16:50:43,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 8729. [2024-11-11 16:50:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8729 states, 8728 states have (on average 1.135884509624198) internal successors, (9914), 8728 states have internal predecessors, (9914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8729 states to 8729 states and 9914 transitions. [2024-11-11 16:50:43,793 INFO L78 Accepts]: Start accepts. Automaton has 8729 states and 9914 transitions. Word has length 323 [2024-11-11 16:50:43,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:43,794 INFO L471 AbstractCegarLoop]: Abstraction has 8729 states and 9914 transitions. [2024-11-11 16:50:43,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8729 states and 9914 transitions. [2024-11-11 16:50:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-11 16:50:43,804 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:43,804 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:50:43,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:50:43,804 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:43,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash -126252397, now seen corresponding path program 1 times [2024-11-11 16:50:43,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254514930] [2024-11-11 16:50:43,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:43,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-11 16:50:44,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254514930] [2024-11-11 16:50:44,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254514930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:44,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:44,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633491436] [2024-11-11 16:50:44,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:44,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:44,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:44,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:44,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:44,186 INFO L87 Difference]: Start difference. First operand 8729 states and 9914 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:44,944 INFO L93 Difference]: Finished difference Result 21136 states and 24080 transitions. [2024-11-11 16:50:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:44,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 342 [2024-11-11 16:50:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:44,961 INFO L225 Difference]: With dead ends: 21136 [2024-11-11 16:50:44,961 INFO L226 Difference]: Without dead ends: 12777 [2024-11-11 16:50:44,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:44,970 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 175 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:44,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 297 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:50:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12777 states. [2024-11-11 16:50:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12777 to 11120. [2024-11-11 16:50:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11120 states, 11119 states have (on average 1.123572263692778) internal successors, (12493), 11119 states have internal predecessors, (12493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11120 states to 11120 states and 12493 transitions. [2024-11-11 16:50:45,113 INFO L78 Accepts]: Start accepts. Automaton has 11120 states and 12493 transitions. Word has length 342 [2024-11-11 16:50:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:45,114 INFO L471 AbstractCegarLoop]: Abstraction has 11120 states and 12493 transitions. [2024-11-11 16:50:45,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 11120 states and 12493 transitions. [2024-11-11 16:50:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2024-11-11 16:50:45,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:45,133 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:45,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:50:45,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:45,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:45,134 INFO L85 PathProgramCache]: Analyzing trace with hash -575963578, now seen corresponding path program 1 times [2024-11-11 16:50:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941963465] [2024-11-11 16:50:45,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-11 16:50:45,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:45,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941963465] [2024-11-11 16:50:45,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941963465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:45,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532955794] [2024-11-11 16:50:45,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:45,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:45,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:45,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:45,380 INFO L87 Difference]: Start difference. First operand 11120 states and 12493 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:45,939 INFO L93 Difference]: Finished difference Result 22601 states and 25416 transitions. [2024-11-11 16:50:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:45,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 439 [2024-11-11 16:50:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:45,953 INFO L225 Difference]: With dead ends: 22601 [2024-11-11 16:50:45,953 INFO L226 Difference]: Without dead ends: 12959 [2024-11-11 16:50:45,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:45,964 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 177 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:45,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 139 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:50:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12959 states. [2024-11-11 16:50:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12959 to 8347. [2024-11-11 16:50:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8347 states, 8346 states have (on average 1.1284447639587827) internal successors, (9418), 8346 states have internal predecessors, (9418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8347 states to 8347 states and 9418 transitions. [2024-11-11 16:50:46,071 INFO L78 Accepts]: Start accepts. Automaton has 8347 states and 9418 transitions. Word has length 439 [2024-11-11 16:50:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:46,072 INFO L471 AbstractCegarLoop]: Abstraction has 8347 states and 9418 transitions. [2024-11-11 16:50:46,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 8347 states and 9418 transitions. [2024-11-11 16:50:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2024-11-11 16:50:46,085 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:46,085 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:46,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:50:46,086 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:46,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:46,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1542853619, now seen corresponding path program 1 times [2024-11-11 16:50:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060833148] [2024-11-11 16:50:46,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:46,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-11 16:50:46,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:46,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060833148] [2024-11-11 16:50:46,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060833148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:46,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:46,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:46,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049708667] [2024-11-11 16:50:46,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:46,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:50:46,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:46,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:50:46,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:50:46,750 INFO L87 Difference]: Start difference. First operand 8347 states and 9418 transitions. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:47,682 INFO L93 Difference]: Finished difference Result 18534 states and 20893 transitions. [2024-11-11 16:50:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:50:47,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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 449 [2024-11-11 16:50:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:47,692 INFO L225 Difference]: With dead ends: 18534 [2024-11-11 16:50:47,692 INFO L226 Difference]: Without dead ends: 10557 [2024-11-11 16:50:47,698 INFO L434 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-11-11 16:50:47,699 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 105 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:47,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 124 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 16:50:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10557 states. [2024-11-11 16:50:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10557 to 10187. [2024-11-11 16:50:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10187 states, 10186 states have (on average 1.1175142352248184) internal successors, (11383), 10186 states have internal predecessors, (11383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10187 states to 10187 states and 11383 transitions. [2024-11-11 16:50:47,868 INFO L78 Accepts]: Start accepts. Automaton has 10187 states and 11383 transitions. Word has length 449 [2024-11-11 16:50:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:47,868 INFO L471 AbstractCegarLoop]: Abstraction has 10187 states and 11383 transitions. [2024-11-11 16:50:47,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 10187 states and 11383 transitions. [2024-11-11 16:50:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2024-11-11 16:50:47,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:47,887 INFO L218 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, 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, 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-11-11 16:50:47,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:50:47,888 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:47,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:47,888 INFO L85 PathProgramCache]: Analyzing trace with hash 132646832, now seen corresponding path program 1 times [2024-11-11 16:50:47,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:47,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797735338] [2024-11-11 16:50:47,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:47,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 607 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-11 16:50:48,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:48,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797735338] [2024-11-11 16:50:48,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797735338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:48,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:48,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:48,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531610236] [2024-11-11 16:50:48,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:48,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:48,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:48,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:48,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:48,363 INFO L87 Difference]: Start difference. First operand 10187 states and 11383 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:49,031 INFO L93 Difference]: Finished difference Result 20930 states and 23469 transitions. [2024-11-11 16:50:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:49,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 475 [2024-11-11 16:50:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:49,046 INFO L225 Difference]: With dead ends: 20930 [2024-11-11 16:50:49,046 INFO L226 Difference]: Without dead ends: 11297 [2024-11-11 16:50:49,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:49,055 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 84 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:49,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 353 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11297 states. [2024-11-11 16:50:49,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11297 to 10744. [2024-11-11 16:50:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10744 states, 10743 states have (on average 1.1144931583356605) internal successors, (11973), 10743 states have internal predecessors, (11973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 11973 transitions. [2024-11-11 16:50:49,245 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 11973 transitions. Word has length 475 [2024-11-11 16:50:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:49,246 INFO L471 AbstractCegarLoop]: Abstraction has 10744 states and 11973 transitions. [2024-11-11 16:50:49,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 11973 transitions. [2024-11-11 16:50:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2024-11-11 16:50:49,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:49,258 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-11-11 16:50:49,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 16:50:49,259 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:49,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:49,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2079186287, now seen corresponding path program 1 times [2024-11-11 16:50:49,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:49,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430347565] [2024-11-11 16:50:49,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:49,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 304 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-11 16:50:50,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:50,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430347565] [2024-11-11 16:50:50,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430347565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:50:50,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663782106] [2024-11-11 16:50:50,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:50,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:50:50,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:50:50,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:50:50,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:50:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:50,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:50:50,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:50:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-11 16:50:50,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:50:50,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663782106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:50,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:50:50,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 16:50:50,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030920527] [2024-11-11 16:50:50,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:50,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:50,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:50,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:50:50,794 INFO L87 Difference]: Start difference. First operand 10744 states and 11973 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:51,396 INFO L93 Difference]: Finished difference Result 22430 states and 25088 transitions. [2024-11-11 16:50:51,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:51,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 487 [2024-11-11 16:50:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:51,409 INFO L225 Difference]: With dead ends: 22430 [2024-11-11 16:50:51,409 INFO L226 Difference]: Without dead ends: 12240 [2024-11-11 16:50:51,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:50:51,417 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 113 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:51,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 318 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:50:51,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12240 states. [2024-11-11 16:50:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12240 to 11860. [2024-11-11 16:50:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11860 states, 11859 states have (on average 1.1160300193945527) internal successors, (13235), 11859 states have internal predecessors, (13235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11860 states to 11860 states and 13235 transitions. [2024-11-11 16:50:51,541 INFO L78 Accepts]: Start accepts. Automaton has 11860 states and 13235 transitions. Word has length 487 [2024-11-11 16:50:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:51,542 INFO L471 AbstractCegarLoop]: Abstraction has 11860 states and 13235 transitions. [2024-11-11 16:50:51,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 11860 states and 13235 transitions. [2024-11-11 16:50:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2024-11-11 16:50:51,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:51,555 INFO L218 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:51,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 16:50:51,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 16:50:51,756 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:51,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:51,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1008492538, now seen corresponding path program 1 times [2024-11-11 16:50:51,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:51,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648094977] [2024-11-11 16:50:51,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:51,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-11 16:50:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:52,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648094977] [2024-11-11 16:50:52,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648094977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:52,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:52,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170959485] [2024-11-11 16:50:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:52,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:52,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:52,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:52,370 INFO L87 Difference]: Start difference. First operand 11860 states and 13235 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:53,004 INFO L93 Difference]: Finished difference Result 25558 states and 28511 transitions. [2024-11-11 16:50:53,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:53,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 489 [2024-11-11 16:50:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:53,018 INFO L225 Difference]: With dead ends: 25558 [2024-11-11 16:50:53,018 INFO L226 Difference]: Without dead ends: 14068 [2024-11-11 16:50:53,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:53,027 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 106 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:53,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 362 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14068 states. [2024-11-11 16:50:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14068 to 13512. [2024-11-11 16:50:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13512 states, 13511 states have (on average 1.101398860187995) internal successors, (14881), 13511 states have internal predecessors, (14881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13512 states to 13512 states and 14881 transitions. [2024-11-11 16:50:53,223 INFO L78 Accepts]: Start accepts. Automaton has 13512 states and 14881 transitions. Word has length 489 [2024-11-11 16:50:53,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:53,224 INFO L471 AbstractCegarLoop]: Abstraction has 13512 states and 14881 transitions. [2024-11-11 16:50:53,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 13512 states and 14881 transitions. [2024-11-11 16:50:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2024-11-11 16:50:53,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:53,244 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:53,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 16:50:53,245 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:53,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2127881712, now seen corresponding path program 1 times [2024-11-11 16:50:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:53,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216071875] [2024-11-11 16:50:53,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 950 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-11 16:50:54,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:54,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216071875] [2024-11-11 16:50:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216071875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:54,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:50:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557938564] [2024-11-11 16:50:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:54,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:50:54,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:54,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:50:54,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:50:54,168 INFO L87 Difference]: Start difference. First operand 13512 states and 14881 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:55,075 INFO L93 Difference]: Finished difference Result 32019 states and 35410 transitions. [2024-11-11 16:50:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:50:55,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 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 562 [2024-11-11 16:50:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:55,093 INFO L225 Difference]: With dead ends: 32019 [2024-11-11 16:50:55,093 INFO L226 Difference]: Without dead ends: 19061 [2024-11-11 16:50:55,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:50:55,105 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 192 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:55,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 162 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:50:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19061 states. [2024-11-11 16:50:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19061 to 17019. [2024-11-11 16:50:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17019 states, 17018 states have (on average 1.0964860735691622) internal successors, (18660), 17018 states have internal predecessors, (18660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17019 states to 17019 states and 18660 transitions. [2024-11-11 16:50:55,257 INFO L78 Accepts]: Start accepts. Automaton has 17019 states and 18660 transitions. Word has length 562 [2024-11-11 16:50:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:55,258 INFO L471 AbstractCegarLoop]: Abstraction has 17019 states and 18660 transitions. [2024-11-11 16:50:55,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 17019 states and 18660 transitions. [2024-11-11 16:50:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-11-11 16:50:55,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:55,269 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:55,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 16:50:55,270 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:55,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:55,270 INFO L85 PathProgramCache]: Analyzing trace with hash 399883863, now seen corresponding path program 1 times [2024-11-11 16:50:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:55,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007748865] [2024-11-11 16:50:55,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:55,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-11 16:50:55,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:55,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007748865] [2024-11-11 16:50:55,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007748865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:55,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:55,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:55,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591315080] [2024-11-11 16:50:55,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:55,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:50:55,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:55,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:50:55,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:50:55,883 INFO L87 Difference]: Start difference. First operand 17019 states and 18660 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:56,825 INFO L93 Difference]: Finished difference Result 35886 states and 39369 transitions. [2024-11-11 16:50:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:50:56,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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 572 [2024-11-11 16:50:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:56,843 INFO L225 Difference]: With dead ends: 35886 [2024-11-11 16:50:56,843 INFO L226 Difference]: Without dead ends: 19237 [2024-11-11 16:50:56,856 INFO L434 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-11-11 16:50:56,857 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 166 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:56,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 115 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:50:56,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19237 states. [2024-11-11 16:50:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19237 to 18859. [2024-11-11 16:50:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18859 states, 18858 states have (on average 1.092586700604518) internal successors, (20604), 18858 states have internal predecessors, (20604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18859 states to 18859 states and 20604 transitions. [2024-11-11 16:50:57,024 INFO L78 Accepts]: Start accepts. Automaton has 18859 states and 20604 transitions. Word has length 572 [2024-11-11 16:50:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:57,024 INFO L471 AbstractCegarLoop]: Abstraction has 18859 states and 20604 transitions. [2024-11-11 16:50:57,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 18859 states and 20604 transitions. [2024-11-11 16:50:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2024-11-11 16:50:57,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:57,038 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-11-11 16:50:57,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 16:50:57,039 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:57,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2124046520, now seen corresponding path program 1 times [2024-11-11 16:50:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:57,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075206799] [2024-11-11 16:50:57,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:57,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 917 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2024-11-11 16:50:57,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:57,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075206799] [2024-11-11 16:50:57,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075206799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:57,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:57,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:57,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505558348] [2024-11-11 16:50:57,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:57,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:57,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:57,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:57,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:57,380 INFO L87 Difference]: Start difference. First operand 18859 states and 20604 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:57,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:57,976 INFO L93 Difference]: Finished difference Result 38819 states and 42488 transitions. [2024-11-11 16:50:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:57,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 660 [2024-11-11 16:50:57,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:57,994 INFO L225 Difference]: With dead ends: 38819 [2024-11-11 16:50:57,994 INFO L226 Difference]: Without dead ends: 19960 [2024-11-11 16:50:58,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:58,006 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 193 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:58,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 351 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:50:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19960 states. [2024-11-11 16:50:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19960 to 19406. [2024-11-11 16:50:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19406 states, 19405 states have (on average 1.0824014429270807) internal successors, (21004), 19405 states have internal predecessors, (21004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19406 states to 19406 states and 21004 transitions. [2024-11-11 16:50:58,163 INFO L78 Accepts]: Start accepts. Automaton has 19406 states and 21004 transitions. Word has length 660 [2024-11-11 16:50:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:58,164 INFO L471 AbstractCegarLoop]: Abstraction has 19406 states and 21004 transitions. [2024-11-11 16:50:58,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 19406 states and 21004 transitions. [2024-11-11 16:50:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2024-11-11 16:50:58,179 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:58,179 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:58,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 16:50:58,179 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:58,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash 456496721, now seen corresponding path program 1 times [2024-11-11 16:50:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422193516] [2024-11-11 16:50:58,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:58,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 1651 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-11 16:50:59,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:59,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422193516] [2024-11-11 16:50:59,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422193516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:59,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:59,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:50:59,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289938313] [2024-11-11 16:50:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:59,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:50:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:59,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:50:59,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:50:59,377 INFO L87 Difference]: Start difference. First operand 19406 states and 21004 transitions. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:00,305 INFO L93 Difference]: Finished difference Result 40667 states and 43981 transitions. [2024-11-11 16:51:00,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:00,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 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 725 [2024-11-11 16:51:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:00,330 INFO L225 Difference]: With dead ends: 40667 [2024-11-11 16:51:00,330 INFO L226 Difference]: Without dead ends: 21631 [2024-11-11 16:51:00,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:00,343 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 177 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:00,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 166 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:51:00,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21631 states. [2024-11-11 16:51:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21631 to 19406. [2024-11-11 16:51:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19406 states, 19405 states have (on average 1.0824014429270807) internal successors, (21004), 19405 states have internal predecessors, (21004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19406 states to 19406 states and 21004 transitions. [2024-11-11 16:51:00,510 INFO L78 Accepts]: Start accepts. Automaton has 19406 states and 21004 transitions. Word has length 725 [2024-11-11 16:51:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:00,510 INFO L471 AbstractCegarLoop]: Abstraction has 19406 states and 21004 transitions. [2024-11-11 16:51:00,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 19406 states and 21004 transitions. [2024-11-11 16:51:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2024-11-11 16:51:00,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:00,528 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:51:00,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 16:51:00,528 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:00,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1541384588, now seen corresponding path program 1 times [2024-11-11 16:51:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:00,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662706180] [2024-11-11 16:51:00,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:00,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 999 proven. 8 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2024-11-11 16:51:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662706180] [2024-11-11 16:51:01,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662706180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:51:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003716720] [2024-11-11 16:51:01,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:01,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:01,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:51:01,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:51:01,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 16:51:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:02,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:51:02,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:51:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2024-11-11 16:51:02,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:51:02,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003716720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:02,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:51:02,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-11 16:51:02,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393501890] [2024-11-11 16:51:02,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:02,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:02,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:02,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:02,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:51:02,328 INFO L87 Difference]: Start difference. First operand 19406 states and 21004 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:02,871 INFO L93 Difference]: Finished difference Result 40659 states and 44021 transitions. [2024-11-11 16:51:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:02,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 733 [2024-11-11 16:51:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:02,896 INFO L225 Difference]: With dead ends: 40659 [2024-11-11 16:51:02,897 INFO L226 Difference]: Without dead ends: 21623 [2024-11-11 16:51:02,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 733 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:51:02,910 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 99 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:02,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 341 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:51:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21623 states. [2024-11-11 16:51:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21623 to 20510. [2024-11-11 16:51:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20510 states, 20509 states have (on average 1.082207811204837) internal successors, (22195), 20509 states have internal predecessors, (22195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20510 states to 20510 states and 22195 transitions. [2024-11-11 16:51:03,163 INFO L78 Accepts]: Start accepts. Automaton has 20510 states and 22195 transitions. Word has length 733 [2024-11-11 16:51:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:03,163 INFO L471 AbstractCegarLoop]: Abstraction has 20510 states and 22195 transitions. [2024-11-11 16:51:03,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand 20510 states and 22195 transitions. [2024-11-11 16:51:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2024-11-11 16:51:03,179 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:03,179 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 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] [2024-11-11 16:51:03,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 16:51:03,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:03,380 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:03,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:03,381 INFO L85 PathProgramCache]: Analyzing trace with hash 747293827, now seen corresponding path program 1 times [2024-11-11 16:51:03,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:03,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937520251] [2024-11-11 16:51:03,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:03,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2389 backedges. 1225 proven. 448 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-11-11 16:51:06,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:06,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937520251] [2024-11-11 16:51:06,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937520251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:51:06,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540918607] [2024-11-11 16:51:06,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:06,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:06,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:51:06,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:51:06,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 16:51:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:06,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:51:06,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:51:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2389 backedges. 1382 proven. 0 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2024-11-11 16:51:06,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:51:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540918607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:06,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:51:06,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2024-11-11 16:51:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69530218] [2024-11-11 16:51:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:06,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:06,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:06,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-11 16:51:06,888 INFO L87 Difference]: Start difference. First operand 20510 states and 22195 transitions. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:07,609 INFO L93 Difference]: Finished difference Result 44148 states and 47734 transitions. [2024-11-11 16:51:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:07,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 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 863 [2024-11-11 16:51:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:07,632 INFO L225 Difference]: With dead ends: 44148 [2024-11-11 16:51:07,632 INFO L226 Difference]: Without dead ends: 24008 [2024-11-11 16:51:07,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 861 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-11 16:51:07,645 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 248 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:07,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 134 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24008 states. [2024-11-11 16:51:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24008 to 20142. [2024-11-11 16:51:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20142 states, 20141 states have (on average 1.081574896976317) internal successors, (21784), 20141 states have internal predecessors, (21784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20142 states to 20142 states and 21784 transitions. [2024-11-11 16:51:07,821 INFO L78 Accepts]: Start accepts. Automaton has 20142 states and 21784 transitions. Word has length 863 [2024-11-11 16:51:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:07,822 INFO L471 AbstractCegarLoop]: Abstraction has 20142 states and 21784 transitions. [2024-11-11 16:51:07,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 20142 states and 21784 transitions. [2024-11-11 16:51:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 874 [2024-11-11 16:51:07,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:07,837 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2024-11-11 16:51:07,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 16:51:08,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:08,038 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:08,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1448162269, now seen corresponding path program 1 times [2024-11-11 16:51:08,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:08,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888587708] [2024-11-11 16:51:08,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:08,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2399 backedges. 1032 proven. 651 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-11-11 16:51:10,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:10,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888587708] [2024-11-11 16:51:10,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888587708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:51:10,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370777829] [2024-11-11 16:51:10,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:10,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:10,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:51:10,076 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:51:10,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 16:51:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:10,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 1107 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:51:10,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:51:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2399 backedges. 815 proven. 0 refuted. 0 times theorem prover too weak. 1584 trivial. 0 not checked. [2024-11-11 16:51:10,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:51:10,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370777829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:10,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:51:10,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-11-11 16:51:10,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631224595] [2024-11-11 16:51:10,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:10,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:10,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:10,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:10,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:51:10,589 INFO L87 Difference]: Start difference. First operand 20142 states and 21784 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:11,106 INFO L93 Difference]: Finished difference Result 41207 states and 44536 transitions. [2024-11-11 16:51:11,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:11,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 873 [2024-11-11 16:51:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:11,127 INFO L225 Difference]: With dead ends: 41207 [2024-11-11 16:51:11,127 INFO L226 Difference]: Without dead ends: 21435 [2024-11-11 16:51:11,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:51:11,140 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 98 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:11,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 348 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:51:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21435 states. [2024-11-11 16:51:11,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21435 to 19958. [2024-11-11 16:51:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19958 states, 19957 states have (on average 1.0793205391591922) internal successors, (21540), 19957 states have internal predecessors, (21540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19958 states to 19958 states and 21540 transitions. [2024-11-11 16:51:11,309 INFO L78 Accepts]: Start accepts. Automaton has 19958 states and 21540 transitions. Word has length 873 [2024-11-11 16:51:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:11,309 INFO L471 AbstractCegarLoop]: Abstraction has 19958 states and 21540 transitions. [2024-11-11 16:51:11,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 19958 states and 21540 transitions. [2024-11-11 16:51:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2024-11-11 16:51:11,326 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:11,327 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 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-11-11 16:51:11,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 16:51:11,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-11 16:51:11,528 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:11,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:11,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1116372708, now seen corresponding path program 1 times [2024-11-11 16:51:11,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:11,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810573202] [2024-11-11 16:51:11,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2976 backedges. 1385 proven. 0 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-11-11 16:51:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810573202] [2024-11-11 16:51:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810573202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:11,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:11,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028068105] [2024-11-11 16:51:11,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:11,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:11,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:11,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:11,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:11,899 INFO L87 Difference]: Start difference. First operand 19958 states and 21540 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:12,431 INFO L93 Difference]: Finished difference Result 38077 states and 41065 transitions. [2024-11-11 16:51:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:12,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 934 [2024-11-11 16:51:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:12,433 INFO L225 Difference]: With dead ends: 38077 [2024-11-11 16:51:12,433 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:51:12,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:12,449 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 110 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:12,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 346 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:51:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:51:12,450 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-11-11 16:51:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:51:12,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 934 [2024-11-11 16:51:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:12,451 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:51:12,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:51:12,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:51:12,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:51:12,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 16:51:12,459 INFO L421 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-11-11 16:51:12,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:51:19,654 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:51:19,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:51:19 BoogieIcfgContainer [2024-11-11 16:51:19,681 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:51:19,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:51:19,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:51:19,682 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:51:19,682 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:50:27" (3/4) ... [2024-11-11 16:51:19,684 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:51:19,710 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:51:19,711 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:51:19,712 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:51:19,714 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:51:19,881 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:51:19,881 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:51:19,881 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:51:19,883 INFO L158 Benchmark]: Toolchain (without parser) took 55680.64ms. Allocated memory was 130.0MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 71.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 400.8MB. Max. memory is 16.1GB. [2024-11-11 16:51:19,883 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory was 91.4MB in the beginning and 91.2MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:51:19,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 914.27ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 71.5MB in the beginning and 113.6MB in the end (delta: -42.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-11-11 16:51:19,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 148.12ms. Allocated memory is still 169.9MB. Free memory was 113.6MB in the beginning and 95.7MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 16:51:19,884 INFO L158 Benchmark]: Boogie Preprocessor took 156.89ms. Allocated memory is still 169.9MB. Free memory was 95.7MB in the beginning and 70.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 16:51:19,884 INFO L158 Benchmark]: RCFGBuilder took 1729.95ms. Allocated memory is still 169.9MB. Free memory was 70.6MB in the beginning and 110.5MB in the end (delta: -40.0MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. [2024-11-11 16:51:19,886 INFO L158 Benchmark]: TraceAbstraction took 52524.78ms. Allocated memory was 169.9MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 109.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-11 16:51:19,887 INFO L158 Benchmark]: Witness Printer took 199.94ms. Allocated memory is still 2.3GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:51:19,888 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory was 91.4MB in the beginning and 91.2MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 914.27ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 71.5MB in the beginning and 113.6MB in the end (delta: -42.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 148.12ms. Allocated memory is still 169.9MB. Free memory was 113.6MB in the beginning and 95.7MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 156.89ms. Allocated memory is still 169.9MB. Free memory was 95.7MB in the beginning and 70.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1729.95ms. Allocated memory is still 169.9MB. Free memory was 70.6MB in the beginning and 110.5MB in the end (delta: -40.0MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. * TraceAbstraction took 52524.78ms. Allocated memory was 169.9MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 109.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 199.94ms. Allocated memory is still 2.3GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 148]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.2s, OverallIterations: 25, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4128 SdHoareTripleChecker+Valid, 17.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4128 mSDsluCounter, 6135 SdHoareTripleChecker+Invalid, 14.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 650 mSDsCounter, 2574 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16420 IncrementalHoareTripleChecker+Invalid, 18994 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2574 mSolverCounterUnsat, 5485 mSDtfsCounter, 16420 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3537 GetRequests, 3475 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20510occurred in iteration=22, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 22425 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 14035 NumberOfCodeBlocks, 14035 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 14250 ConstructedInterpolants, 0 QuantifiedInterpolants, 44990 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4123 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 25727/27304 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((a25 == 9) && (a4 == 1)) && (a23 <= 312)) || (((a25 <= 10) && (a23 <= 138)) && (a4 == 1))) || (((a25 == 11) && (a4 == 1)) && (a23 <= 312))) || ((((a25 == 13) && (a29 <= 220)) && (a4 == 1)) && (a23 <= 312))) || (((a25 == 13) && (a4 == 0)) && (a23 <= 138))) || ((((a25 == 13) && (a29 <= 245)) && (141 <= a29)) && (a4 == 1))) || ((((a25 == 13) && (261 <= a29)) && (a4 == 1)) && (a23 <= 312))) || (((a4 == 0) && (a25 == 11)) && (a23 <= 138))) || (((a25 == 12) && (a4 == 0)) && (((a23 >= 0) ? (a23 / 25) : ((a23 / 25) - 1)) <= 127750))) || ((((a25 == 12) && (141 <= a29)) && (((a23 >= 0) ? (a23 / 25) : ((a23 / 25) - 1)) <= 127750)) && (a4 == 1))) || (((a25 == 13) && (a23 <= 138)) && (a4 == 1))) || ((((a25 == 11) && (141 <= a29)) && (((a23 >= 0) ? (a23 / 25) : ((a23 / 25) - 1)) <= 127750)) && (a4 == 1))) || (((a25 == 12) && (a4 == 1)) && (a23 <= 312))) || (((a25 == 12) && (a4 == 0)) && (((long long) a29 + 554036) <= 0))) || ((((a25 == 13) && (307 <= a23)) && (((a23 >= 0) ? (a23 / 25) : ((a23 / 25) - 1)) <= 127750)) && (a4 == 1))) || ((((a25 <= 10) && (((a23 >= 0) ? (a23 / 25) : ((a23 / 25) - 1)) <= 127750)) && (a4 == 1)) && (312 <= a23))) || (((a25 == 12) && (a4 == 0)) && (141 <= a29))) || (((a4 == 0) && (a25 <= 10)) && (((a23 >= 0) ? (a23 / 25) : ((a23 / 25) - 1)) <= 127750))) || (((a25 == 11) && (278 <= a29)) && (a4 == 1))) || (((((a25 == 12) || (a25 == 11)) && (((long long) 28470 + a29) <= 0)) && (((a23 >= 0) ? (a23 / 25) : ((a23 / 25) - 1)) <= 127750)) && (a4 == 1))) || ((((307 <= a23) && (a25 <= 10)) && (a4 == 1)) && (a23 <= 312))) || (((a25 <= 10) && (141 <= a29)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:51:19,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE