./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label54.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f137b4cfcf2c394c1a64ac698bc08e2e305ac6959ca2787cbc9ca23749e2553 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:25:30,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:25:30,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:25:30,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:25:30,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:25:30,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:25:30,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:25:30,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:25:30,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:25:30,585 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:25:30,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:25:30,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:25:30,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:25:30,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:25:30,586 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:25:30,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:25:30,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:25:30,587 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:25:30,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:25:30,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:25:30,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:25:30,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:25:30,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:25:30,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:25:30,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:25:30,592 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:25:30,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:25:30,592 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:25:30,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:25:30,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:25:30,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:25:30,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:25:30,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:25:30,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:25:30,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:25:30,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:25:30,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:25:30,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:25:30,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:25:30,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:25:30,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:25:30,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:25:30,596 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f137b4cfcf2c394c1a64ac698bc08e2e305ac6959ca2787cbc9ca23749e2553 [2024-10-10 23:25:30,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:25:30,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:25:30,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:25:30,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:25:30,810 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:25:30,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label54.c [2024-10-10 23:25:32,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:25:32,309 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:25:32,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label54.c [2024-10-10 23:25:32,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/86b481d57/b8cf827598754403b56532a492d07929/FLAGf69bef8d3 [2024-10-10 23:25:32,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/86b481d57/b8cf827598754403b56532a492d07929 [2024-10-10 23:25:32,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:25:32,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:25:32,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:25:32,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:25:32,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:25:32,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:25:32" (1/1) ... [2024-10-10 23:25:32,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36caaf9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:32, skipping insertion in model container [2024-10-10 23:25:32,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:25:32" (1/1) ... [2024-10-10 23:25:32,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:25:32,646 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label54.c[4370,4383] [2024-10-10 23:25:33,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:25:33,251 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:25:33,265 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label54.c[4370,4383] [2024-10-10 23:25:33,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:25:33,601 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:25:33,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33 WrapperNode [2024-10-10 23:25:33,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:25:33,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:25:33,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:25:33,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:25:33,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (1/1) ... [2024-10-10 23:25:33,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (1/1) ... [2024-10-10 23:25:33,831 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-10 23:25:33,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:25:33,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:25:33,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:25:33,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:25:33,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (1/1) ... [2024-10-10 23:25:33,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (1/1) ... [2024-10-10 23:25:33,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (1/1) ... [2024-10-10 23:25:34,036 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:25:34,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (1/1) ... [2024-10-10 23:25:34,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (1/1) ... [2024-10-10 23:25:34,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (1/1) ... [2024-10-10 23:25:34,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (1/1) ... [2024-10-10 23:25:34,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (1/1) ... [2024-10-10 23:25:34,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (1/1) ... [2024-10-10 23:25:34,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:25:34,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:25:34,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:25:34,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:25:34,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (1/1) ... [2024-10-10 23:25:34,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:25:34,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:25:34,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:25:34,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:25:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:25:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:25:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:25:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:25:34,495 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:25:34,497 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:25:37,559 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-10 23:25:37,559 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:25:37,608 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:25:37,608 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:25:37,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:37 BoogieIcfgContainer [2024-10-10 23:25:37,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:25:37,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:25:37,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:25:37,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:25:37,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:25:32" (1/3) ... [2024-10-10 23:25:37,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b9d1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:25:37, skipping insertion in model container [2024-10-10 23:25:37,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:33" (2/3) ... [2024-10-10 23:25:37,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b9d1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:25:37, skipping insertion in model container [2024-10-10 23:25:37,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:37" (3/3) ... [2024-10-10 23:25:37,617 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label54.c [2024-10-10 23:25:37,629 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:25:37,630 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:25:37,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:25:37,701 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;@74c27a1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:25:37,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:25:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 23:25:37,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:37,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:37,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:37,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:37,718 INFO L85 PathProgramCache]: Analyzing trace with hash 321369996, now seen corresponding path program 1 times [2024-10-10 23:25:37,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:37,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908441412] [2024-10-10 23:25:37,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:37,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:25:37,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:37,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908441412] [2024-10-10 23:25:37,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908441412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:37,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:37,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:25:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895277775] [2024-10-10 23:25:37,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:37,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:25:37,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:37,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:25:37,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:25:37,864 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:37,935 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-10 23:25:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:25:37,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-10-10 23:25:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:37,954 INFO L225 Difference]: With dead ends: 1511 [2024-10-10 23:25:37,956 INFO L226 Difference]: Without dead ends: 754 [2024-10-10 23:25:37,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:25:37,965 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:37,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:25:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-10 23:25:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-10 23:25:38,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-10 23:25:38,028 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 32 [2024-10-10 23:25:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:38,029 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-10 23:25:38,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-10 23:25:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 23:25:38,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:38,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:38,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:25:38,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:38,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:38,031 INFO L85 PathProgramCache]: Analyzing trace with hash 750078650, now seen corresponding path program 1 times [2024-10-10 23:25:38,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:38,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879964562] [2024-10-10 23:25:38,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:38,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:25:38,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:38,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879964562] [2024-10-10 23:25:38,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879964562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:38,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:38,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:38,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819313994] [2024-10-10 23:25:38,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:38,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:25:38,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:38,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:25:38,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:25:38,246 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:42,399 INFO L93 Difference]: Finished difference Result 3017 states and 5755 transitions. [2024-10-10 23:25:42,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:25:42,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-10-10 23:25:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:42,407 INFO L225 Difference]: With dead ends: 3017 [2024-10-10 23:25:42,407 INFO L226 Difference]: Without dead ends: 2264 [2024-10-10 23:25:42,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:25:42,409 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 2377 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3613 mSolverCounterSat, 1596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2377 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 5209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1596 IncrementalHoareTripleChecker+Valid, 3613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:42,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2377 Valid, 197 Invalid, 5209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1596 Valid, 3613 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-10 23:25:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2024-10-10 23:25:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2256. [2024-10-10 23:25:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.5352549889135254) internal successors, (3462), 2255 states have internal predecessors, (3462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3462 transitions. [2024-10-10 23:25:42,455 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3462 transitions. Word has length 32 [2024-10-10 23:25:42,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:42,455 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3462 transitions. [2024-10-10 23:25:42,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3462 transitions. [2024-10-10 23:25:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-10 23:25:42,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:42,460 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:25:42,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:25:42,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:42,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:42,461 INFO L85 PathProgramCache]: Analyzing trace with hash -460640299, now seen corresponding path program 1 times [2024-10-10 23:25:42,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:42,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93863951] [2024-10-10 23:25:42,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:42,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:25:42,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:42,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93863951] [2024-10-10 23:25:42,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93863951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:42,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:42,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:42,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104651507] [2024-10-10 23:25:42,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:42,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:25:42,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:42,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:25:42,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:25:42,859 INFO L87 Difference]: Start difference. First operand 2256 states and 3462 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:46,004 INFO L93 Difference]: Finished difference Result 6050 states and 9663 transitions. [2024-10-10 23:25:46,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:25:46,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2024-10-10 23:25:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:46,015 INFO L225 Difference]: With dead ends: 6050 [2024-10-10 23:25:46,015 INFO L226 Difference]: Without dead ends: 3758 [2024-10-10 23:25:46,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:25:46,023 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 702 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:46,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 705 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:25:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2024-10-10 23:25:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3758. [2024-10-10 23:25:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3757 states have (on average 1.340963534735161) internal successors, (5038), 3757 states have internal predecessors, (5038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 5038 transitions. [2024-10-10 23:25:46,072 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 5038 transitions. Word has length 172 [2024-10-10 23:25:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:46,073 INFO L471 AbstractCegarLoop]: Abstraction has 3758 states and 5038 transitions. [2024-10-10 23:25:46,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 5038 transitions. [2024-10-10 23:25:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-10 23:25:46,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:46,076 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:25:46,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:25:46,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:46,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:46,077 INFO L85 PathProgramCache]: Analyzing trace with hash -729375258, now seen corresponding path program 1 times [2024-10-10 23:25:46,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:46,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709113372] [2024-10-10 23:25:46,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:46,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-10 23:25:46,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:46,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709113372] [2024-10-10 23:25:46,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709113372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:46,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:46,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:25:46,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601701930] [2024-10-10 23:25:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:46,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:46,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:46,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:46,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:46,304 INFO L87 Difference]: Start difference. First operand 3758 states and 5038 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:48,364 INFO L93 Difference]: Finished difference Result 10519 states and 14355 transitions. [2024-10-10 23:25:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:48,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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 242 [2024-10-10 23:25:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:48,382 INFO L225 Difference]: With dead ends: 10519 [2024-10-10 23:25:48,382 INFO L226 Difference]: Without dead ends: 6762 [2024-10-10 23:25:48,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:48,388 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 669 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:48,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 484 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:25:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2024-10-10 23:25:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6011. [2024-10-10 23:25:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6011 states, 6010 states have (on average 1.2815307820299502) internal successors, (7702), 6010 states have internal predecessors, (7702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6011 states to 6011 states and 7702 transitions. [2024-10-10 23:25:48,470 INFO L78 Accepts]: Start accepts. Automaton has 6011 states and 7702 transitions. Word has length 242 [2024-10-10 23:25:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:48,472 INFO L471 AbstractCegarLoop]: Abstraction has 6011 states and 7702 transitions. [2024-10-10 23:25:48,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 6011 states and 7702 transitions. [2024-10-10 23:25:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-10 23:25:48,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:48,475 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:25:48,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:25:48,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:48,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:48,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1221732457, now seen corresponding path program 1 times [2024-10-10 23:25:48,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:48,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159277244] [2024-10-10 23:25:48,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:48,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 61 proven. 54 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-10 23:25:48,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:48,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159277244] [2024-10-10 23:25:48,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159277244] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:25:48,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55648194] [2024-10-10 23:25:48,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:48,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:25:48,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:25:48,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:25:48,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:25:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:48,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:25:48,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:25:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:25:49,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:25:49,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55648194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:49,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:25:49,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 23:25:49,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931312328] [2024-10-10 23:25:49,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:49,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:49,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:49,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:49,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:25:49,083 INFO L87 Difference]: Start difference. First operand 6011 states and 7702 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:51,095 INFO L93 Difference]: Finished difference Result 15025 states and 19933 transitions. [2024-10-10 23:25:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:51,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2024-10-10 23:25:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:51,117 INFO L225 Difference]: With dead ends: 15025 [2024-10-10 23:25:51,118 INFO L226 Difference]: Without dead ends: 9015 [2024-10-10 23:25:51,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:25:51,126 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 907 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2073 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:51,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 307 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2073 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:25:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9015 states. [2024-10-10 23:25:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9015 to 9015. [2024-10-10 23:25:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9015 states, 9014 states have (on average 1.265808741956956) internal successors, (11410), 9014 states have internal predecessors, (11410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9015 states to 9015 states and 11410 transitions. [2024-10-10 23:25:51,232 INFO L78 Accepts]: Start accepts. Automaton has 9015 states and 11410 transitions. Word has length 255 [2024-10-10 23:25:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:51,232 INFO L471 AbstractCegarLoop]: Abstraction has 9015 states and 11410 transitions. [2024-10-10 23:25:51,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 9015 states and 11410 transitions. [2024-10-10 23:25:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-10-10 23:25:51,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:51,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:25:51,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:25:51,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:25:51,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:51,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1383660433, now seen corresponding path program 1 times [2024-10-10 23:25:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:51,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945896916] [2024-10-10 23:25:51,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-10 23:25:51,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:51,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945896916] [2024-10-10 23:25:51,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945896916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:51,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:51,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940149625] [2024-10-10 23:25:51,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:51,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:51,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:51,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:51,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:51,660 INFO L87 Difference]: Start difference. First operand 9015 states and 11410 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:53,813 INFO L93 Difference]: Finished difference Result 21784 states and 27826 transitions. [2024-10-10 23:25:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:53,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 272 [2024-10-10 23:25:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:53,838 INFO L225 Difference]: With dead ends: 21784 [2024-10-10 23:25:53,839 INFO L226 Difference]: Without dead ends: 12770 [2024-10-10 23:25:53,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:53,849 INFO L432 NwaCegarLoop]: 1206 mSDtfsCounter, 742 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:53,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1213 Invalid, 2780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:25:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2024-10-10 23:25:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 12770. [2024-10-10 23:25:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12770 states, 12769 states have (on average 1.1838828412561673) internal successors, (15117), 12769 states have internal predecessors, (15117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12770 states to 12770 states and 15117 transitions. [2024-10-10 23:25:53,987 INFO L78 Accepts]: Start accepts. Automaton has 12770 states and 15117 transitions. Word has length 272 [2024-10-10 23:25:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:53,988 INFO L471 AbstractCegarLoop]: Abstraction has 12770 states and 15117 transitions. [2024-10-10 23:25:53,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 12770 states and 15117 transitions. [2024-10-10 23:25:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-10-10 23:25:53,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:53,992 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:53,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:25:53,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:53,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1246266559, now seen corresponding path program 1 times [2024-10-10 23:25:53,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:53,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117503092] [2024-10-10 23:25:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-10 23:25:54,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:54,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117503092] [2024-10-10 23:25:54,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117503092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:54,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:54,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835065046] [2024-10-10 23:25:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:54,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:54,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:54,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:54,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:54,268 INFO L87 Difference]: Start difference. First operand 12770 states and 15117 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:56,682 INFO L93 Difference]: Finished difference Result 36053 states and 43061 transitions. [2024-10-10 23:25:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:56,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 359 [2024-10-10 23:25:56,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:56,715 INFO L225 Difference]: With dead ends: 36053 [2024-10-10 23:25:56,715 INFO L226 Difference]: Without dead ends: 23284 [2024-10-10 23:25:56,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:56,731 INFO L432 NwaCegarLoop]: 1213 mSDtfsCounter, 639 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:56,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1220 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:25:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23284 states. [2024-10-10 23:25:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23284 to 22533. [2024-10-10 23:25:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.172022013136872) internal successors, (26408), 22532 states have internal predecessors, (26408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 26408 transitions. [2024-10-10 23:25:56,941 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 26408 transitions. Word has length 359 [2024-10-10 23:25:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:56,942 INFO L471 AbstractCegarLoop]: Abstraction has 22533 states and 26408 transitions. [2024-10-10 23:25:56,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 26408 transitions. [2024-10-10 23:25:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-10-10 23:25:56,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:56,947 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:56,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:25:56,947 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:56,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1409445749, now seen corresponding path program 1 times [2024-10-10 23:25:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:56,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733317322] [2024-10-10 23:25:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-10 23:25:57,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:57,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733317322] [2024-10-10 23:25:57,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733317322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:57,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:57,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822889818] [2024-10-10 23:25:57,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:57,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:57,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:57,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:57,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:57,177 INFO L87 Difference]: Start difference. First operand 22533 states and 26408 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:59,003 INFO L93 Difference]: Finished difference Result 51073 states and 59607 transitions. [2024-10-10 23:25:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 363 [2024-10-10 23:25:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:59,038 INFO L225 Difference]: With dead ends: 51073 [2024-10-10 23:25:59,038 INFO L226 Difference]: Without dead ends: 25537 [2024-10-10 23:25:59,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:59,060 INFO L432 NwaCegarLoop]: 1377 mSDtfsCounter, 734 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:59,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1384 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:25:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25537 states. [2024-10-10 23:25:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25537 to 25537. [2024-10-10 23:25:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25537 states, 25536 states have (on average 1.1246867167919798) internal successors, (28720), 25536 states have internal predecessors, (28720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25537 states to 25537 states and 28720 transitions. [2024-10-10 23:25:59,280 INFO L78 Accepts]: Start accepts. Automaton has 25537 states and 28720 transitions. Word has length 363 [2024-10-10 23:25:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:59,280 INFO L471 AbstractCegarLoop]: Abstraction has 25537 states and 28720 transitions. [2024-10-10 23:25:59,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 25537 states and 28720 transitions. [2024-10-10 23:25:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-10-10 23:25:59,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:59,284 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:25:59,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:25:59,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:59,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:59,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1431863103, now seen corresponding path program 1 times [2024-10-10 23:25:59,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:59,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448215664] [2024-10-10 23:25:59,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:59,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-10 23:25:59,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:59,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448215664] [2024-10-10 23:25:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448215664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:59,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:59,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042863819] [2024-10-10 23:25:59,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:59,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:59,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:59,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:59,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:59,518 INFO L87 Difference]: Start difference. First operand 25537 states and 28720 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:01,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:01,381 INFO L93 Difference]: Finished difference Result 51073 states and 57439 transitions. [2024-10-10 23:26:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:01,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 393 [2024-10-10 23:26:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:01,416 INFO L225 Difference]: With dead ends: 51073 [2024-10-10 23:26:01,417 INFO L226 Difference]: Without dead ends: 25537 [2024-10-10 23:26:01,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:01,435 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 721 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:01,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 201 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:26:01,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25537 states. [2024-10-10 23:26:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25537 to 25537. [2024-10-10 23:26:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25537 states, 25536 states have (on average 1.115875626566416) internal successors, (28495), 25536 states have internal predecessors, (28495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25537 states to 25537 states and 28495 transitions. [2024-10-10 23:26:01,644 INFO L78 Accepts]: Start accepts. Automaton has 25537 states and 28495 transitions. Word has length 393 [2024-10-10 23:26:01,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:01,645 INFO L471 AbstractCegarLoop]: Abstraction has 25537 states and 28495 transitions. [2024-10-10 23:26:01,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 25537 states and 28495 transitions. [2024-10-10 23:26:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-10-10 23:26:01,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:01,697 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:01,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:26:01,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:01,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:01,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2138781087, now seen corresponding path program 1 times [2024-10-10 23:26:01,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:01,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020881468] [2024-10-10 23:26:01,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-10 23:26:01,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:01,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020881468] [2024-10-10 23:26:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020881468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:01,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:01,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:01,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941647898] [2024-10-10 23:26:01,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:01,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:01,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:01,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:01,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:01,850 INFO L87 Difference]: Start difference. First operand 25537 states and 28495 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:03,822 INFO L93 Difference]: Finished difference Result 69097 states and 77627 transitions. [2024-10-10 23:26:03,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:03,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 404 [2024-10-10 23:26:03,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:03,865 INFO L225 Difference]: With dead ends: 69097 [2024-10-10 23:26:03,865 INFO L226 Difference]: Without dead ends: 43561 [2024-10-10 23:26:03,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:03,888 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 686 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:03,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 439 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:26:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43561 states. [2024-10-10 23:26:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43561 to 42810. [2024-10-10 23:26:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42810 states, 42809 states have (on average 1.1068700506902753) internal successors, (47384), 42809 states have internal predecessors, (47384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42810 states to 42810 states and 47384 transitions. [2024-10-10 23:26:04,368 INFO L78 Accepts]: Start accepts. Automaton has 42810 states and 47384 transitions. Word has length 404 [2024-10-10 23:26:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:04,368 INFO L471 AbstractCegarLoop]: Abstraction has 42810 states and 47384 transitions. [2024-10-10 23:26:04,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 42810 states and 47384 transitions. [2024-10-10 23:26:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2024-10-10 23:26:04,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:04,377 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:04,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:26:04,377 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:04,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:04,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1075533492, now seen corresponding path program 1 times [2024-10-10 23:26:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:04,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935247489] [2024-10-10 23:26:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:04,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 403 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-10-10 23:26:04,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:04,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935247489] [2024-10-10 23:26:04,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935247489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:04,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:04,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:04,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707539265] [2024-10-10 23:26:04,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:04,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:04,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:04,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:04,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:04,685 INFO L87 Difference]: Start difference. First operand 42810 states and 47384 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:06,820 INFO L93 Difference]: Finished difference Result 99888 states and 110751 transitions. [2024-10-10 23:26:06,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:06,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 431 [2024-10-10 23:26:06,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:06,873 INFO L225 Difference]: With dead ends: 99888 [2024-10-10 23:26:06,873 INFO L226 Difference]: Without dead ends: 57079 [2024-10-10 23:26:06,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:06,890 INFO L432 NwaCegarLoop]: 1171 mSDtfsCounter, 689 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:06,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1178 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:26:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57079 states. [2024-10-10 23:26:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57079 to 55577. [2024-10-10 23:26:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55577 states, 55576 states have (on average 1.0885454152871743) internal successors, (60497), 55576 states have internal predecessors, (60497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55577 states to 55577 states and 60497 transitions. [2024-10-10 23:26:07,325 INFO L78 Accepts]: Start accepts. Automaton has 55577 states and 60497 transitions. Word has length 431 [2024-10-10 23:26:07,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:07,325 INFO L471 AbstractCegarLoop]: Abstraction has 55577 states and 60497 transitions. [2024-10-10 23:26:07,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand 55577 states and 60497 transitions. [2024-10-10 23:26:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2024-10-10 23:26:07,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:07,339 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:07,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:26:07,339 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:07,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1691318238, now seen corresponding path program 1 times [2024-10-10 23:26:07,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:07,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192879094] [2024-10-10 23:26:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 669 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-10-10 23:26:07,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:07,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192879094] [2024-10-10 23:26:07,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192879094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:07,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:07,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:07,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79724902] [2024-10-10 23:26:07,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:07,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:07,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:07,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:07,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:07,828 INFO L87 Difference]: Start difference. First operand 55577 states and 60497 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:09,873 INFO L93 Difference]: Finished difference Result 134434 states and 145933 transitions. [2024-10-10 23:26:09,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:09,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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 627 [2024-10-10 23:26:09,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:09,947 INFO L225 Difference]: With dead ends: 134434 [2024-10-10 23:26:09,948 INFO L226 Difference]: Without dead ends: 78858 [2024-10-10 23:26:09,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:09,964 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 722 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:09,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 281 Invalid, 2486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:26:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78858 states. [2024-10-10 23:26:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78858 to 75854. [2024-10-10 23:26:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75854 states, 75853 states have (on average 1.071124411691034) internal successors, (81248), 75853 states have internal predecessors, (81248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75854 states to 75854 states and 81248 transitions. [2024-10-10 23:26:10,816 INFO L78 Accepts]: Start accepts. Automaton has 75854 states and 81248 transitions. Word has length 627 [2024-10-10 23:26:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:10,817 INFO L471 AbstractCegarLoop]: Abstraction has 75854 states and 81248 transitions. [2024-10-10 23:26:10,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 75854 states and 81248 transitions. [2024-10-10 23:26:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2024-10-10 23:26:10,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:10,842 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:10,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:26:10,842 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:10,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash 481729901, now seen corresponding path program 1 times [2024-10-10 23:26:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:10,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827781044] [2024-10-10 23:26:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:10,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-10 23:26:11,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:11,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827781044] [2024-10-10 23:26:11,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827781044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:11,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:11,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:11,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254648886] [2024-10-10 23:26:11,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:11,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:11,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:11,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:11,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:11,495 INFO L87 Difference]: Start difference. First operand 75854 states and 81248 transitions. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:13,704 INFO L93 Difference]: Finished difference Result 165225 states and 177573 transitions. [2024-10-10 23:26:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:13,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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 649 [2024-10-10 23:26:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:13,802 INFO L225 Difference]: With dead ends: 165225 [2024-10-10 23:26:13,802 INFO L226 Difference]: Without dead ends: 89372 [2024-10-10 23:26:13,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:13,829 INFO L432 NwaCegarLoop]: 1153 mSDtfsCounter, 413 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:13,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1160 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:26:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89372 states. [2024-10-10 23:26:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89372 to 89372. [2024-10-10 23:26:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89372 states, 89371 states have (on average 1.06010898389858) internal successors, (94743), 89371 states have internal predecessors, (94743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89372 states to 89372 states and 94743 transitions. [2024-10-10 23:26:14,894 INFO L78 Accepts]: Start accepts. Automaton has 89372 states and 94743 transitions. Word has length 649 [2024-10-10 23:26:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:14,894 INFO L471 AbstractCegarLoop]: Abstraction has 89372 states and 94743 transitions. [2024-10-10 23:26:14,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 89372 states and 94743 transitions. [2024-10-10 23:26:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2024-10-10 23:26:14,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:14,916 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:14,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:26:14,916 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:14,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1085214576, now seen corresponding path program 1 times [2024-10-10 23:26:14,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:14,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102706019] [2024-10-10 23:26:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-10-10 23:26:15,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:15,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102706019] [2024-10-10 23:26:15,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102706019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:15,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:15,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:15,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375691573] [2024-10-10 23:26:15,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:15,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:15,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:15,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:15,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:15,326 INFO L87 Difference]: Start difference. First operand 89372 states and 94743 transitions. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:17,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:17,682 INFO L93 Difference]: Finished difference Result 212538 states and 225660 transitions. [2024-10-10 23:26:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:17,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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 729 [2024-10-10 23:26:17,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:17,835 INFO L225 Difference]: With dead ends: 212538 [2024-10-10 23:26:17,835 INFO L226 Difference]: Without dead ends: 123167 [2024-10-10 23:26:17,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:17,862 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 669 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:17,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 218 Invalid, 2680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:26:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123167 states. [2024-10-10 23:26:18,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123167 to 109649. [2024-10-10 23:26:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109649 states, 109648 states have (on average 1.0639409747555815) internal successors, (116659), 109648 states have internal predecessors, (116659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109649 states to 109649 states and 116659 transitions. [2024-10-10 23:26:19,112 INFO L78 Accepts]: Start accepts. Automaton has 109649 states and 116659 transitions. Word has length 729 [2024-10-10 23:26:19,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:19,113 INFO L471 AbstractCegarLoop]: Abstraction has 109649 states and 116659 transitions. [2024-10-10 23:26:19,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 109649 states and 116659 transitions. [2024-10-10 23:26:19,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2024-10-10 23:26:19,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:19,355 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:19,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:26:19,356 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:19,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2056537064, now seen corresponding path program 1 times [2024-10-10 23:26:19,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:19,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396402324] [2024-10-10 23:26:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:19,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-10-10 23:26:20,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:20,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396402324] [2024-10-10 23:26:20,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396402324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:20,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:20,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:20,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584353368] [2024-10-10 23:26:20,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:20,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:20,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:20,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:20,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:20,352 INFO L87 Difference]: Start difference. First operand 109649 states and 116659 transitions. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:22,435 INFO L93 Difference]: Finished difference Result 221550 states and 235609 transitions. [2024-10-10 23:26:22,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:22,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 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 790 [2024-10-10 23:26:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:22,552 INFO L225 Difference]: With dead ends: 221550 [2024-10-10 23:26:22,552 INFO L226 Difference]: Without dead ends: 111902 [2024-10-10 23:26:22,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:22,588 INFO L432 NwaCegarLoop]: 1156 mSDtfsCounter, 590 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:22,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1163 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:26:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111902 states. [2024-10-10 23:26:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111902 to 111151. [2024-10-10 23:26:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111151 states, 111150 states have (on average 1.0616644174538912) internal successors, (118004), 111150 states have internal predecessors, (118004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111151 states to 111151 states and 118004 transitions. [2024-10-10 23:26:23,798 INFO L78 Accepts]: Start accepts. Automaton has 111151 states and 118004 transitions. Word has length 790 [2024-10-10 23:26:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:23,798 INFO L471 AbstractCegarLoop]: Abstraction has 111151 states and 118004 transitions. [2024-10-10 23:26:23,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 111151 states and 118004 transitions. [2024-10-10 23:26:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2024-10-10 23:26:23,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:23,822 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:23,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:26:23,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:23,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:23,823 INFO L85 PathProgramCache]: Analyzing trace with hash 937532742, now seen corresponding path program 1 times [2024-10-10 23:26:23,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:23,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168947110] [2024-10-10 23:26:23,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:23,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-10 23:26:24,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168947110] [2024-10-10 23:26:24,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168947110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:24,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:24,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461407148] [2024-10-10 23:26:24,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:24,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:24,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:24,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:24,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:24,526 INFO L87 Difference]: Start difference. First operand 111151 states and 118004 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-10-10 23:26:26,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:26,630 INFO L93 Difference]: Finished difference Result 222301 states and 236007 transitions. [2024-10-10 23:26:26,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:26,630 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 798 [2024-10-10 23:26:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:26,746 INFO L225 Difference]: With dead ends: 222301 [2024-10-10 23:26:26,746 INFO L226 Difference]: Without dead ends: 111151 [2024-10-10 23:26:26,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:26,808 INFO L432 NwaCegarLoop]: 1194 mSDtfsCounter, 757 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:26,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1201 Invalid, 2206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:26:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111151 states. [2024-10-10 23:26:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111151 to 107396. [2024-10-10 23:26:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107396 states, 107395 states have (on average 1.0469016248428697) internal successors, (112432), 107395 states have internal predecessors, (112432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107396 states to 107396 states and 112432 transitions. [2024-10-10 23:26:28,112 INFO L78 Accepts]: Start accepts. Automaton has 107396 states and 112432 transitions. Word has length 798 [2024-10-10 23:26:28,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:28,113 INFO L471 AbstractCegarLoop]: Abstraction has 107396 states and 112432 transitions. [2024-10-10 23:26:28,113 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-10-10 23:26:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 107396 states and 112432 transitions. [2024-10-10 23:26:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2024-10-10 23:26:28,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:28,148 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:28,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:26:28,148 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:28,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:28,149 INFO L85 PathProgramCache]: Analyzing trace with hash -428336864, now seen corresponding path program 1 times [2024-10-10 23:26:28,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:28,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429151901] [2024-10-10 23:26:28,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:28,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-10-10 23:26:28,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:28,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429151901] [2024-10-10 23:26:28,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429151901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:28,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:28,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:28,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778828374] [2024-10-10 23:26:28,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:28,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:28,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:28,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:28,750 INFO L87 Difference]: Start difference. First operand 107396 states and 112432 transitions. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:30,970 INFO L93 Difference]: Finished difference Result 215540 states and 225646 transitions. [2024-10-10 23:26:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:30,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 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 976 [2024-10-10 23:26:30,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:30,972 INFO L225 Difference]: With dead ends: 215540 [2024-10-10 23:26:30,972 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:26:31,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:31,016 INFO L432 NwaCegarLoop]: 1004 mSDtfsCounter, 839 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2013 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:31,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1010 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2013 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:26:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:26:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:26:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:26:31,017 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 976 [2024-10-10 23:26:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:31,017 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:26:31,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:26:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:26:31,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:26:31,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:26:31,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:26:31,022 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:31,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:26:33,110 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:26:33,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:26:33 BoogieIcfgContainer [2024-10-10 23:26:33,125 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:26:33,125 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:26:33,125 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:26:33,125 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:26:33,125 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:37" (3/4) ... [2024-10-10 23:26:33,127 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:26:33,161 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-10 23:26:33,165 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:26:33,168 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:26:33,172 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:26:33,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:26:33,430 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:26:33,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:26:33,430 INFO L158 Benchmark]: Toolchain (without parser) took 61078.97ms. Allocated memory was 153.1MB in the beginning and 10.7GB in the end (delta: 10.5GB). Free memory was 80.7MB in the beginning and 8.5GB in the end (delta: -8.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-10-10 23:26:33,431 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:26:33,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1248.01ms. Allocated memory was 153.1MB in the beginning and 197.1MB in the end (delta: 44.0MB). Free memory was 80.7MB in the beginning and 117.8MB in the end (delta: -37.1MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2024-10-10 23:26:33,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 229.12ms. Allocated memory is still 197.1MB. Free memory was 117.8MB in the beginning and 89.4MB in the end (delta: 28.3MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. [2024-10-10 23:26:33,432 INFO L158 Benchmark]: Boogie Preprocessor took 500.44ms. Allocated memory is still 197.1MB. Free memory was 89.4MB in the beginning and 59.6MB in the end (delta: 29.8MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2024-10-10 23:26:33,432 INFO L158 Benchmark]: RCFGBuilder took 3276.49ms. Allocated memory was 197.1MB in the beginning and 555.7MB in the end (delta: 358.6MB). Free memory was 59.6MB in the beginning and 266.0MB in the end (delta: -206.4MB). Peak memory consumption was 175.4MB. Max. memory is 16.1GB. [2024-10-10 23:26:33,432 INFO L158 Benchmark]: TraceAbstraction took 55512.53ms. Allocated memory was 555.7MB in the beginning and 10.7GB in the end (delta: 10.1GB). Free memory was 266.0MB in the beginning and 8.6GB in the end (delta: -8.3GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-10-10 23:26:33,432 INFO L158 Benchmark]: Witness Printer took 304.91ms. Allocated memory is still 10.7GB. Free memory was 8.6GB in the beginning and 8.5GB in the end (delta: 69.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-10 23:26:33,433 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.12ms. Allocated memory is still 96.5MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1248.01ms. Allocated memory was 153.1MB in the beginning and 197.1MB in the end (delta: 44.0MB). Free memory was 80.7MB in the beginning and 117.8MB in the end (delta: -37.1MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 229.12ms. Allocated memory is still 197.1MB. Free memory was 117.8MB in the beginning and 89.4MB in the end (delta: 28.3MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 500.44ms. Allocated memory is still 197.1MB. Free memory was 89.4MB in the beginning and 59.6MB in the end (delta: 29.8MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * RCFGBuilder took 3276.49ms. Allocated memory was 197.1MB in the beginning and 555.7MB in the end (delta: 358.6MB). Free memory was 59.6MB in the beginning and 266.0MB in the end (delta: -206.4MB). Peak memory consumption was 175.4MB. Max. memory is 16.1GB. * TraceAbstraction took 55512.53ms. Allocated memory was 555.7MB in the beginning and 10.7GB in the end (delta: 10.1GB). Free memory was 266.0MB in the beginning and 8.6GB in the end (delta: -8.3GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 304.91ms. Allocated memory is still 10.7GB. Free memory was 8.6GB in the beginning and 8.5GB in the end (delta: 69.2MB). Peak memory consumption was 67.1MB. 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: 121]: 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, 756 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.4s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 38.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12856 SdHoareTripleChecker+Valid, 32.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12856 mSDsluCounter, 13799 SdHoareTripleChecker+Invalid, 26.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 8573 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36471 IncrementalHoareTripleChecker+Invalid, 45044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8573 mSolverCounterUnsat, 13677 mSDtfsCounter, 36471 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111151occurred in iteration=15, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 24791 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 7779 NumberOfCodeBlocks, 7779 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 7761 ConstructedInterpolants, 0 QuantifiedInterpolants, 14120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 7703/7757 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: 4828]: Loop Invariant Derived loop invariant: ((((((((((((((((((a5 <= 4) && (a17 <= 111)) || ((a2 <= 189) && (7 == a5))) || ((((256 <= a17) && (a7 == 13)) && (6 == a5)) && (a24 != 14))) || (((a7 == 13) && (a2 <= 189)) && (6 == a5))) || (((14 <= a7) && (6 == a5)) && (a24 != 14))) || (((a7 == 13) && (a5 <= 4)) && (190 <= a2))) || (((14 <= a7) && (a2 <= 189)) && (6 == a5))) || (((256 <= a17) && (a2 <= 189)) && (6 == a5))) || (((a2 <= 189) && (6 == a5)) && (a24 != 14))) || (((a2 <= 189) && (a17 <= 111)) && (6 == a5))) || (((256 <= a17) && (a5 <= 4)) && (190 <= a2))) || (5 == a5)) || (((a17 <= 111) && (6 == a5)) && (a24 != 14))) || (((14 <= a7) && (a5 <= 4)) && (14 <= a24))) || (((14 <= a7) && (a5 <= 4)) && (190 <= a2))) || (3 == a5)) || (((a7 <= 13) && (a5 <= 4)) && (a24 != 14))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:26:33,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE