./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label54.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83b9baf9f6deb0db64cb6e97ea77e31e0e6aa56bc46a9ba9c0c02a0377225524 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:32:09,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:32:09,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:32:09,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:32:09,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:32:09,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:32:09,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:32:09,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:32:09,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:32:09,603 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:32:09,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:32:09,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:32:09,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:32:09,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:32:09,604 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:32:09,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:32:09,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:32:09,605 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:32:09,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:32:09,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:32:09,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:32:09,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:32:09,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:32:09,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:32:09,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:32:09,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:32:09,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:32:09,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:32:09,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:32:09,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:32:09,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:32:09,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:32:09,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:32:09,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:32:09,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:32:09,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:32:09,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:32:09,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:32:09,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:32:09,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:32:09,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:32:09,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:32:09,616 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83b9baf9f6deb0db64cb6e97ea77e31e0e6aa56bc46a9ba9c0c02a0377225524 [2024-11-08 10:32:09,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:32:09,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:32:09,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:32:09,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:32:09,943 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:32:09,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label54.c [2024-11-08 10:32:11,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:32:11,774 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:32:11,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label54.c [2024-11-08 10:32:11,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473f8d389/d0c5e8586ef547b4bed6a151ea338235/FLAG6533d621a [2024-11-08 10:32:11,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473f8d389/d0c5e8586ef547b4bed6a151ea338235 [2024-11-08 10:32:11,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:32:11,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:32:11,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:32:11,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:32:11,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:32:11,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:32:11" (1/1) ... [2024-11-08 10:32:11,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cefcd7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:11, skipping insertion in model container [2024-11-08 10:32:11,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:32:11" (1/1) ... [2024-11-08 10:32:11,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:32:12,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label54.c[56627,56640] [2024-11-08 10:32:12,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:32:12,520 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:32:12,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label54.c[56627,56640] [2024-11-08 10:32:12,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:32:12,853 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:32:12,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12 WrapperNode [2024-11-08 10:32:12,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:32:12,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:32:12,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:32:12,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:32:12,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (1/1) ... [2024-11-08 10:32:12,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (1/1) ... [2024-11-08 10:32:12,997 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-08 10:32:12,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:32:12,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:32:12,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:32:12,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:32:13,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (1/1) ... [2024-11-08 10:32:13,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (1/1) ... [2024-11-08 10:32:13,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (1/1) ... [2024-11-08 10:32:13,065 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:32:13,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (1/1) ... [2024-11-08 10:32:13,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (1/1) ... [2024-11-08 10:32:13,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (1/1) ... [2024-11-08 10:32:13,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (1/1) ... [2024-11-08 10:32:13,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (1/1) ... [2024-11-08 10:32:13,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (1/1) ... [2024-11-08 10:32:13,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:32:13,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:32:13,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:32:13,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:32:13,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (1/1) ... [2024-11-08 10:32:13,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:32:13,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:13,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:32:13,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:32:13,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:32:13,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:32:13,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:32:13,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:32:13,414 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:32:13,418 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:32:15,302 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-08 10:32:15,304 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:32:15,339 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:32:15,341 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:32:15,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:32:15 BoogieIcfgContainer [2024-11-08 10:32:15,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:32:15,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:32:15,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:32:15,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:32:15,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:32:11" (1/3) ... [2024-11-08 10:32:15,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138ea9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:32:15, skipping insertion in model container [2024-11-08 10:32:15,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:32:12" (2/3) ... [2024-11-08 10:32:15,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138ea9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:32:15, skipping insertion in model container [2024-11-08 10:32:15,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:32:15" (3/3) ... [2024-11-08 10:32:15,354 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label54.c [2024-11-08 10:32:15,372 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:32:15,372 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:32:15,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:32:15,464 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;@67d2dc4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:32:15,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:32:15,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 10:32:15,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:15,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:15,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:15,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash -590757190, now seen corresponding path program 1 times [2024-11-08 10:32:15,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:15,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495313328] [2024-11-08 10:32:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:15,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:32:16,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:16,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495313328] [2024-11-08 10:32:16,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495313328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:16,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:32:16,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722620636] [2024-11-08 10:32:16,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:16,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:16,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:16,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:16,261 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:17,493 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2024-11-08 10:32:17,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:17,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2024-11-08 10:32:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:17,509 INFO L225 Difference]: With dead ends: 829 [2024-11-08 10:32:17,509 INFO L226 Difference]: Without dead ends: 463 [2024-11-08 10:32:17,513 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-11-08 10:32:17,516 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 125 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:17,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 127 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 10:32:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-08 10:32:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2024-11-08 10:32:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.6183035714285714) internal successors, (725), 448 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2024-11-08 10:32:17,597 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 166 [2024-11-08 10:32:17,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:17,598 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2024-11-08 10:32:17,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:17,599 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2024-11-08 10:32:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 10:32:17,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:17,603 INFO L215 NwaCegarLoop]: trace histogram [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-11-08 10:32:17,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:32:17,604 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:17,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1027354506, now seen corresponding path program 1 times [2024-11-08 10:32:17,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:17,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137044697] [2024-11-08 10:32:17,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:32:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:17,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137044697] [2024-11-08 10:32:17,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137044697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:17,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:17,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:32:17,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448301258] [2024-11-08 10:32:17,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:17,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:17,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:17,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:17,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:17,965 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:18,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:18,707 INFO L93 Difference]: Finished difference Result 1319 states and 2138 transitions. [2024-11-08 10:32:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:18,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2024-11-08 10:32:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:18,712 INFO L225 Difference]: With dead ends: 1319 [2024-11-08 10:32:18,712 INFO L226 Difference]: Without dead ends: 872 [2024-11-08 10:32:18,714 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-11-08 10:32:18,716 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 249 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:18,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 150 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:32:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-08 10:32:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 870. [2024-11-08 10:32:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5120828538550057) internal successors, (1314), 869 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1314 transitions. [2024-11-08 10:32:18,760 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1314 transitions. Word has length 171 [2024-11-08 10:32:18,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:18,761 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1314 transitions. [2024-11-08 10:32:18,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1314 transitions. [2024-11-08 10:32:18,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 10:32:18,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:18,765 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2024-11-08 10:32:18,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:32:18,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:18,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2004202496, now seen corresponding path program 1 times [2024-11-08 10:32:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:18,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156422718] [2024-11-08 10:32:18,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:18,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:32:19,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:19,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156422718] [2024-11-08 10:32:19,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156422718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:19,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:19,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:32:19,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7943163] [2024-11-08 10:32:19,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:19,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:19,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:19,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:19,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:19,151 INFO L87 Difference]: Start difference. First operand 870 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:19,979 INFO L93 Difference]: Finished difference Result 2554 states and 3869 transitions. [2024-11-08 10:32:19,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:19,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 186 [2024-11-08 10:32:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:19,987 INFO L225 Difference]: With dead ends: 2554 [2024-11-08 10:32:19,987 INFO L226 Difference]: Without dead ends: 1686 [2024-11-08 10:32:19,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:19,991 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 232 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:19,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 417 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:32:19,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-11-08 10:32:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1684. [2024-11-08 10:32:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.3363042186571599) internal successors, (2249), 1683 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2249 transitions. [2024-11-08 10:32:20,035 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2249 transitions. Word has length 186 [2024-11-08 10:32:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:20,036 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2249 transitions. [2024-11-08 10:32:20,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2249 transitions. [2024-11-08 10:32:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 10:32:20,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:20,043 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:20,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:32:20,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:20,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1182972067, now seen corresponding path program 1 times [2024-11-08 10:32:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:20,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140962549] [2024-11-08 10:32:20,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:20,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:32:20,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:20,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140962549] [2024-11-08 10:32:20,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140962549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:20,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:20,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:32:20,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738972864] [2024-11-08 10:32:20,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:20,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:20,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:20,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:20,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:20,322 INFO L87 Difference]: Start difference. First operand 1684 states and 2249 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:21,140 INFO L93 Difference]: Finished difference Result 5005 states and 6687 transitions. [2024-11-08 10:32:21,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:21,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2024-11-08 10:32:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:21,152 INFO L225 Difference]: With dead ends: 5005 [2024-11-08 10:32:21,153 INFO L226 Difference]: Without dead ends: 3323 [2024-11-08 10:32:21,157 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-11-08 10:32:21,158 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 241 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:21,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 174 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:32:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2024-11-08 10:32:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3320. [2024-11-08 10:32:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3319 states have (on average 1.2847243145525762) internal successors, (4264), 3319 states have internal predecessors, (4264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4264 transitions. [2024-11-08 10:32:21,269 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4264 transitions. Word has length 189 [2024-11-08 10:32:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:21,270 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 4264 transitions. [2024-11-08 10:32:21,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4264 transitions. [2024-11-08 10:32:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 10:32:21,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:21,279 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2024-11-08 10:32:21,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:32:21,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:21,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:21,281 INFO L85 PathProgramCache]: Analyzing trace with hash 564713384, now seen corresponding path program 1 times [2024-11-08 10:32:21,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:21,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235269509] [2024-11-08 10:32:21,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:21,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:32:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235269509] [2024-11-08 10:32:21,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235269509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:21,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:21,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:32:21,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225821317] [2024-11-08 10:32:21,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:21,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:21,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:21,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:21,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:21,659 INFO L87 Difference]: Start difference. First operand 3320 states and 4264 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:22,592 INFO L93 Difference]: Finished difference Result 9900 states and 12717 transitions. [2024-11-08 10:32:22,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:22,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 201 [2024-11-08 10:32:22,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:22,620 INFO L225 Difference]: With dead ends: 9900 [2024-11-08 10:32:22,620 INFO L226 Difference]: Without dead ends: 6582 [2024-11-08 10:32:22,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:22,630 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 202 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:22,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 418 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:32:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6582 states. [2024-11-08 10:32:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6582 to 6577. [2024-11-08 10:32:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6577 states, 6576 states have (on average 1.2244525547445255) internal successors, (8052), 6576 states have internal predecessors, (8052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6577 states to 6577 states and 8052 transitions. [2024-11-08 10:32:22,765 INFO L78 Accepts]: Start accepts. Automaton has 6577 states and 8052 transitions. Word has length 201 [2024-11-08 10:32:22,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:22,766 INFO L471 AbstractCegarLoop]: Abstraction has 6577 states and 8052 transitions. [2024-11-08 10:32:22,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 6577 states and 8052 transitions. [2024-11-08 10:32:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 10:32:22,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:22,777 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:22,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:32:22,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:22,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:22,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1701117943, now seen corresponding path program 1 times [2024-11-08 10:32:22,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:22,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965048754] [2024-11-08 10:32:22,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:22,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:32:23,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:23,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965048754] [2024-11-08 10:32:23,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965048754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:23,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:23,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:32:23,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268820019] [2024-11-08 10:32:23,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:23,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:23,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:23,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:23,216 INFO L87 Difference]: Start difference. First operand 6577 states and 8052 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:24,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:24,085 INFO L93 Difference]: Finished difference Result 16215 states and 19822 transitions. [2024-11-08 10:32:24,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:24,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2024-11-08 10:32:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:24,119 INFO L225 Difference]: With dead ends: 16215 [2024-11-08 10:32:24,120 INFO L226 Difference]: Without dead ends: 9640 [2024-11-08 10:32:24,131 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-11-08 10:32:24,132 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 203 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:24,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 155 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:32:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states. [2024-11-08 10:32:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 9638. [2024-11-08 10:32:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9638 states, 9637 states have (on average 1.2036940956729272) internal successors, (11600), 9637 states have internal predecessors, (11600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 11600 transitions. [2024-11-08 10:32:24,375 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 11600 transitions. Word has length 207 [2024-11-08 10:32:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:24,375 INFO L471 AbstractCegarLoop]: Abstraction has 9638 states and 11600 transitions. [2024-11-08 10:32:24,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 11600 transitions. [2024-11-08 10:32:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 10:32:24,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:24,392 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:24,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:32:24,392 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:24,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:24,392 INFO L85 PathProgramCache]: Analyzing trace with hash -325061122, now seen corresponding path program 1 times [2024-11-08 10:32:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884869357] [2024-11-08 10:32:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:32:25,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:25,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884869357] [2024-11-08 10:32:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884869357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:25,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905335710] [2024-11-08 10:32:25,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:25,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:25,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:25,011 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:32:25,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:32:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:25,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:32:25,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:32:25,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:25,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905335710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:25,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:32:25,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880195969] [2024-11-08 10:32:25,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:25,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:25,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:25,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:25,468 INFO L87 Difference]: Start difference. First operand 9638 states and 11600 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:26,410 INFO L93 Difference]: Finished difference Result 23353 states and 28433 transitions. [2024-11-08 10:32:26,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:26,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 214 [2024-11-08 10:32:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:26,469 INFO L225 Difference]: With dead ends: 23353 [2024-11-08 10:32:26,471 INFO L226 Difference]: Without dead ends: 13717 [2024-11-08 10:32:26,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:26,485 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 86 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:26,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 400 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:32:26,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13717 states. [2024-11-08 10:32:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13717 to 13708. [2024-11-08 10:32:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13708 states, 13707 states have (on average 1.2035456336178594) internal successors, (16497), 13707 states have internal predecessors, (16497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13708 states to 13708 states and 16497 transitions. [2024-11-08 10:32:26,713 INFO L78 Accepts]: Start accepts. Automaton has 13708 states and 16497 transitions. Word has length 214 [2024-11-08 10:32:26,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:26,713 INFO L471 AbstractCegarLoop]: Abstraction has 13708 states and 16497 transitions. [2024-11-08 10:32:26,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 13708 states and 16497 transitions. [2024-11-08 10:32:26,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 10:32:26,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:26,737 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 10:32:26,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:32:26,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:26,939 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:26,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash 749729365, now seen corresponding path program 1 times [2024-11-08 10:32:26,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:26,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891635791] [2024-11-08 10:32:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:26,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:32:27,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:27,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891635791] [2024-11-08 10:32:27,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891635791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:27,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:27,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:32:27,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259144177] [2024-11-08 10:32:27,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:27,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:27,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:27,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:27,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:27,140 INFO L87 Difference]: Start difference. First operand 13708 states and 16497 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:27,609 INFO L93 Difference]: Finished difference Result 40490 states and 48779 transitions. [2024-11-08 10:32:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:27,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 227 [2024-11-08 10:32:27,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:27,665 INFO L225 Difference]: With dead ends: 40490 [2024-11-08 10:32:27,665 INFO L226 Difference]: Without dead ends: 26784 [2024-11-08 10:32:27,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:27,688 INFO L432 NwaCegarLoop]: 651 mSDtfsCounter, 332 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:27,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 946 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:32:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26784 states. [2024-11-08 10:32:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26784 to 26781. [2024-11-08 10:32:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26781 states, 26780 states have (on average 1.186706497386109) internal successors, (31780), 26780 states have internal predecessors, (31780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26781 states to 26781 states and 31780 transitions. [2024-11-08 10:32:28,076 INFO L78 Accepts]: Start accepts. Automaton has 26781 states and 31780 transitions. Word has length 227 [2024-11-08 10:32:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:28,076 INFO L471 AbstractCegarLoop]: Abstraction has 26781 states and 31780 transitions. [2024-11-08 10:32:28,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:28,078 INFO L276 IsEmpty]: Start isEmpty. Operand 26781 states and 31780 transitions. [2024-11-08 10:32:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 10:32:28,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:28,107 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 10:32:28,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:32:28,108 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:28,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash -585838557, now seen corresponding path program 1 times [2024-11-08 10:32:28,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:28,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108248556] [2024-11-08 10:32:28,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:32:28,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108248556] [2024-11-08 10:32:28,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108248556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:28,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765240372] [2024-11-08 10:32:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:28,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:28,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:28,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:32:28,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:32:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:28,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:32:28,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:32:28,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:28,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765240372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:28,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:28,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:32:28,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541617181] [2024-11-08 10:32:28,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:28,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:28,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:28,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:28,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:28,955 INFO L87 Difference]: Start difference. First operand 26781 states and 31780 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:30,163 INFO L93 Difference]: Finished difference Result 63308 states and 76200 transitions. [2024-11-08 10:32:30,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:30,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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 233 [2024-11-08 10:32:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:30,241 INFO L225 Difference]: With dead ends: 63308 [2024-11-08 10:32:30,241 INFO L226 Difference]: Without dead ends: 36529 [2024-11-08 10:32:30,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:30,279 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 224 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:30,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 171 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:32:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36529 states. [2024-11-08 10:32:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36529 to 36525. [2024-11-08 10:32:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36525 states, 36524 states have (on average 1.162249479794108) internal successors, (42450), 36524 states have internal predecessors, (42450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36525 states to 36525 states and 42450 transitions. [2024-11-08 10:32:31,008 INFO L78 Accepts]: Start accepts. Automaton has 36525 states and 42450 transitions. Word has length 233 [2024-11-08 10:32:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:31,009 INFO L471 AbstractCegarLoop]: Abstraction has 36525 states and 42450 transitions. [2024-11-08 10:32:31,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 36525 states and 42450 transitions. [2024-11-08 10:32:31,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 10:32:31,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:31,043 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:31,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 10:32:31,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-08 10:32:31,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:31,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:31,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1614905310, now seen corresponding path program 1 times [2024-11-08 10:32:31,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:31,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795408714] [2024-11-08 10:32:31,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:31,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:32:32,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:32,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795408714] [2024-11-08 10:32:32,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795408714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:32,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391087080] [2024-11-08 10:32:32,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:32,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:32,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:32,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:32:32,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:32:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:32,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:32:32,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:32:32,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:32,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391087080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:32,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:32,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:32:32,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484369832] [2024-11-08 10:32:32,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:32,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:32,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:32,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:32,315 INFO L87 Difference]: Start difference. First operand 36525 states and 42450 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:33,139 INFO L93 Difference]: Finished difference Result 73052 states and 84905 transitions. [2024-11-08 10:32:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:33,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 234 [2024-11-08 10:32:33,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:33,192 INFO L225 Difference]: With dead ends: 73052 [2024-11-08 10:32:33,192 INFO L226 Difference]: Without dead ends: 36529 [2024-11-08 10:32:33,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:33,221 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 260 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:33,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 96 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:32:33,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36529 states. [2024-11-08 10:32:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36529 to 36525. [2024-11-08 10:32:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36525 states, 36524 states have (on average 1.1549392180484066) internal successors, (42183), 36524 states have internal predecessors, (42183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36525 states to 36525 states and 42183 transitions. [2024-11-08 10:32:33,807 INFO L78 Accepts]: Start accepts. Automaton has 36525 states and 42183 transitions. Word has length 234 [2024-11-08 10:32:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:33,807 INFO L471 AbstractCegarLoop]: Abstraction has 36525 states and 42183 transitions. [2024-11-08 10:32:33,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 36525 states and 42183 transitions. [2024-11-08 10:32:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-08 10:32:33,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:33,833 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 10:32:33,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 10:32:34,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:34,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:34,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1649515910, now seen corresponding path program 1 times [2024-11-08 10:32:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:34,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22371494] [2024-11-08 10:32:34,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:34,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:32:34,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:34,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22371494] [2024-11-08 10:32:34,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22371494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:34,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:34,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:32:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683071925] [2024-11-08 10:32:34,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:34,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:34,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:34,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:34,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:34,451 INFO L87 Difference]: Start difference. First operand 36525 states and 42183 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:35,583 INFO L93 Difference]: Finished difference Result 83648 states and 97176 transitions. [2024-11-08 10:32:35,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:35,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 240 [2024-11-08 10:32:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:35,658 INFO L225 Difference]: With dead ends: 83648 [2024-11-08 10:32:35,659 INFO L226 Difference]: Without dead ends: 47125 [2024-11-08 10:32:35,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:35,699 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 73 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:35,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 388 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:32:35,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47125 states. [2024-11-08 10:32:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47125 to 47080. [2024-11-08 10:32:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47080 states, 47079 states have (on average 1.1570551625990357) internal successors, (54473), 47079 states have internal predecessors, (54473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47080 states to 47080 states and 54473 transitions. [2024-11-08 10:32:36,496 INFO L78 Accepts]: Start accepts. Automaton has 47080 states and 54473 transitions. Word has length 240 [2024-11-08 10:32:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:36,496 INFO L471 AbstractCegarLoop]: Abstraction has 47080 states and 54473 transitions. [2024-11-08 10:32:36,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 47080 states and 54473 transitions. [2024-11-08 10:32:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 10:32:36,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:36,546 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:36,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 10:32:36,546 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:36,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:36,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1848282652, now seen corresponding path program 1 times [2024-11-08 10:32:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:36,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493576884] [2024-11-08 10:32:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:36,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:32:36,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:36,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493576884] [2024-11-08 10:32:36,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493576884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:36,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:36,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:32:36,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320276151] [2024-11-08 10:32:36,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:36,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:36,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:36,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:36,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:36,967 INFO L87 Difference]: Start difference. First operand 47080 states and 54473 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:38,053 INFO L93 Difference]: Finished difference Result 94203 states and 109033 transitions. [2024-11-08 10:32:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:38,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2024-11-08 10:32:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:38,108 INFO L225 Difference]: With dead ends: 94203 [2024-11-08 10:32:38,108 INFO L226 Difference]: Without dead ends: 47125 [2024-11-08 10:32:38,138 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-11-08 10:32:38,139 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 167 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:38,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 210 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:32:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47125 states. [2024-11-08 10:32:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47125 to 47080. [2024-11-08 10:32:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47080 states, 47079 states have (on average 1.152870706684509) internal successors, (54276), 47079 states have internal predecessors, (54276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47080 states to 47080 states and 54276 transitions. [2024-11-08 10:32:38,800 INFO L78 Accepts]: Start accepts. Automaton has 47080 states and 54276 transitions. Word has length 254 [2024-11-08 10:32:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:38,800 INFO L471 AbstractCegarLoop]: Abstraction has 47080 states and 54276 transitions. [2024-11-08 10:32:38,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 47080 states and 54276 transitions. [2024-11-08 10:32:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-08 10:32:38,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:38,837 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 10:32:38,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 10:32:38,837 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:38,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:38,838 INFO L85 PathProgramCache]: Analyzing trace with hash -831447720, now seen corresponding path program 1 times [2024-11-08 10:32:38,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:38,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187867042] [2024-11-08 10:32:38,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:38,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:32:39,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:39,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187867042] [2024-11-08 10:32:39,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187867042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:39,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:39,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:32:39,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989868325] [2024-11-08 10:32:39,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:39,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:39,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:39,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:39,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:39,193 INFO L87 Difference]: Start difference. First operand 47080 states and 54276 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:40,125 INFO L93 Difference]: Finished difference Result 90673 states and 104354 transitions. [2024-11-08 10:32:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:40,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2024-11-08 10:32:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:40,184 INFO L225 Difference]: With dead ends: 90673 [2024-11-08 10:32:40,184 INFO L226 Difference]: Without dead ends: 43595 [2024-11-08 10:32:40,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:40,205 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 277 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:40,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 373 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:32:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43595 states. [2024-11-08 10:32:40,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43595 to 43594. [2024-11-08 10:32:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43594 states, 43593 states have (on average 1.1196981166701077) internal successors, (48811), 43593 states have internal predecessors, (48811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43594 states to 43594 states and 48811 transitions. [2024-11-08 10:32:40,806 INFO L78 Accepts]: Start accepts. Automaton has 43594 states and 48811 transitions. Word has length 259 [2024-11-08 10:32:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:40,806 INFO L471 AbstractCegarLoop]: Abstraction has 43594 states and 48811 transitions. [2024-11-08 10:32:40,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 43594 states and 48811 transitions. [2024-11-08 10:32:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-08 10:32:40,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:40,839 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 10:32:40,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 10:32:40,839 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:40,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash -385750121, now seen corresponding path program 1 times [2024-11-08 10:32:40,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:40,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823925389] [2024-11-08 10:32:40,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:40,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 116 proven. 6 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-08 10:32:41,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:41,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823925389] [2024-11-08 10:32:41,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823925389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:41,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152082807] [2024-11-08 10:32:41,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:41,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:41,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:41,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:32:41,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:32:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:41,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:32:41,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-08 10:32:41,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:41,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152082807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:41,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:32:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190781197] [2024-11-08 10:32:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:41,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:41,772 INFO L87 Difference]: Start difference. First operand 43594 states and 48811 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:42,581 INFO L93 Difference]: Finished difference Result 86984 states and 97391 transitions. [2024-11-08 10:32:42,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:42,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 267 [2024-11-08 10:32:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:42,629 INFO L225 Difference]: With dead ends: 86984 [2024-11-08 10:32:42,629 INFO L226 Difference]: Without dead ends: 43392 [2024-11-08 10:32:42,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:42,658 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 104 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:42,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 342 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:32:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43392 states. [2024-11-08 10:32:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43392 to 43388. [2024-11-08 10:32:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43388 states, 43387 states have (on average 1.1165556503100007) internal successors, (48444), 43387 states have internal predecessors, (48444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43388 states to 43388 states and 48444 transitions. [2024-11-08 10:32:43,263 INFO L78 Accepts]: Start accepts. Automaton has 43388 states and 48444 transitions. Word has length 267 [2024-11-08 10:32:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:43,263 INFO L471 AbstractCegarLoop]: Abstraction has 43388 states and 48444 transitions. [2024-11-08 10:32:43,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 43388 states and 48444 transitions. [2024-11-08 10:32:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-08 10:32:43,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:43,294 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:43,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 10:32:43,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:43,495 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:43,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash -212940218, now seen corresponding path program 1 times [2024-11-08 10:32:43,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:43,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244758837] [2024-11-08 10:32:43,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:43,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 195 proven. 6 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-08 10:32:44,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:44,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244758837] [2024-11-08 10:32:44,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244758837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:44,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377498740] [2024-11-08 10:32:44,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:44,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:44,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:44,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:32:44,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:32:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:44,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:32:44,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-11-08 10:32:44,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:44,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377498740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:44,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:44,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:32:44,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638661450] [2024-11-08 10:32:44,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:44,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:44,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:44,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:44,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:44,418 INFO L87 Difference]: Start difference. First operand 43388 states and 48444 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:45,304 INFO L93 Difference]: Finished difference Result 86198 states and 96192 transitions. [2024-11-08 10:32:45,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:45,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 331 [2024-11-08 10:32:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:45,363 INFO L225 Difference]: With dead ends: 86198 [2024-11-08 10:32:45,363 INFO L226 Difference]: Without dead ends: 42812 [2024-11-08 10:32:45,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:45,398 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 214 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:45,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 386 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:32:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42812 states. [2024-11-08 10:32:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42812 to 42779. [2024-11-08 10:32:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42779 states, 42778 states have (on average 1.1118331852821544) internal successors, (47562), 42778 states have internal predecessors, (47562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42779 states to 42779 states and 47562 transitions. [2024-11-08 10:32:46,036 INFO L78 Accepts]: Start accepts. Automaton has 42779 states and 47562 transitions. Word has length 331 [2024-11-08 10:32:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:46,036 INFO L471 AbstractCegarLoop]: Abstraction has 42779 states and 47562 transitions. [2024-11-08 10:32:46,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 42779 states and 47562 transitions. [2024-11-08 10:32:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-08 10:32:46,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:46,067 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-08 10:32:46,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 10:32:46,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 10:32:46,268 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:46,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash -834220771, now seen corresponding path program 1 times [2024-11-08 10:32:46,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:46,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175894906] [2024-11-08 10:32:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:46,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-08 10:32:46,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:46,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175894906] [2024-11-08 10:32:46,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175894906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:46,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766924667] [2024-11-08 10:32:46,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:46,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:46,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:46,860 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:32:46,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:32:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:47,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:32:47,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-08 10:32:47,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:47,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766924667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:47,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:47,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-08 10:32:47,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799823216] [2024-11-08 10:32:47,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:47,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:47,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:47,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:47,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:47,199 INFO L87 Difference]: Start difference. First operand 42779 states and 47562 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:47,640 INFO L93 Difference]: Finished difference Result 78991 states and 87878 transitions. [2024-11-08 10:32:47,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:47,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 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 332 [2024-11-08 10:32:47,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:47,685 INFO L225 Difference]: With dead ends: 78991 [2024-11-08 10:32:47,685 INFO L226 Difference]: Without dead ends: 36214 [2024-11-08 10:32:47,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:47,712 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 213 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:47,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:32:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36214 states. [2024-11-08 10:32:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36214 to 36214. [2024-11-08 10:32:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36214 states, 36213 states have (on average 1.1062877971999006) internal successors, (40062), 36213 states have internal predecessors, (40062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36214 states to 36214 states and 40062 transitions. [2024-11-08 10:32:48,193 INFO L78 Accepts]: Start accepts. Automaton has 36214 states and 40062 transitions. Word has length 332 [2024-11-08 10:32:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:48,193 INFO L471 AbstractCegarLoop]: Abstraction has 36214 states and 40062 transitions. [2024-11-08 10:32:48,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 36214 states and 40062 transitions. [2024-11-08 10:32:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-08 10:32:48,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:48,223 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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] [2024-11-08 10:32:48,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 10:32:48,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 10:32:48,424 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:48,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2141763303, now seen corresponding path program 1 times [2024-11-08 10:32:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:48,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077083338] [2024-11-08 10:32:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 10:32:49,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:49,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077083338] [2024-11-08 10:32:49,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077083338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:49,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:49,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:32:49,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224994517] [2024-11-08 10:32:49,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:49,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:32:49,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:49,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:32:49,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:32:49,048 INFO L87 Difference]: Start difference. First operand 36214 states and 40062 transitions. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:50,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:50,050 INFO L93 Difference]: Finished difference Result 72426 states and 80122 transitions. [2024-11-08 10:32:50,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:32:50,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 350 [2024-11-08 10:32:50,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:50,103 INFO L225 Difference]: With dead ends: 72426 [2024-11-08 10:32:50,103 INFO L226 Difference]: Without dead ends: 36214 [2024-11-08 10:32:50,136 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-11-08 10:32:50,137 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 325 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:50,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 166 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:32:50,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36214 states. [2024-11-08 10:32:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36214 to 36214. [2024-11-08 10:32:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36214 states, 36213 states have (on average 1.1029740700853286) internal successors, (39942), 36213 states have internal predecessors, (39942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36214 states to 36214 states and 39942 transitions. [2024-11-08 10:32:50,870 INFO L78 Accepts]: Start accepts. Automaton has 36214 states and 39942 transitions. Word has length 350 [2024-11-08 10:32:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:50,871 INFO L471 AbstractCegarLoop]: Abstraction has 36214 states and 39942 transitions. [2024-11-08 10:32:50,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 36214 states and 39942 transitions. [2024-11-08 10:32:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-08 10:32:50,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:50,899 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:50,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 10:32:50,900 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:50,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1017291907, now seen corresponding path program 1 times [2024-11-08 10:32:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:50,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007444147] [2024-11-08 10:32:50,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:50,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 10:32:51,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:51,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007444147] [2024-11-08 10:32:51,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007444147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:51,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:51,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:32:51,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999654313] [2024-11-08 10:32:51,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:51,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:32:51,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:51,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:32:51,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:32:51,183 INFO L87 Difference]: Start difference. First operand 36214 states and 39942 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:52,337 INFO L93 Difference]: Finished difference Result 78749 states and 86929 transitions. [2024-11-08 10:32:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:32:52,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 351 [2024-11-08 10:32:52,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:52,388 INFO L225 Difference]: With dead ends: 78749 [2024-11-08 10:32:52,388 INFO L226 Difference]: Without dead ends: 42537 [2024-11-08 10:32:52,405 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-11-08 10:32:52,406 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 365 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:52,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 82 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:32:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42537 states. [2024-11-08 10:32:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42537 to 40899. [2024-11-08 10:32:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40899 states, 40898 states have (on average 1.1046261430876816) internal successors, (45177), 40898 states have internal predecessors, (45177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40899 states to 40899 states and 45177 transitions. [2024-11-08 10:32:52,787 INFO L78 Accepts]: Start accepts. Automaton has 40899 states and 45177 transitions. Word has length 351 [2024-11-08 10:32:52,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:52,788 INFO L471 AbstractCegarLoop]: Abstraction has 40899 states and 45177 transitions. [2024-11-08 10:32:52,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:52,788 INFO L276 IsEmpty]: Start isEmpty. Operand 40899 states and 45177 transitions. [2024-11-08 10:32:52,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-11-08 10:32:52,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:52,813 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 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, 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-11-08 10:32:52,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 10:32:52,813 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:52,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:52,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1244791155, now seen corresponding path program 1 times [2024-11-08 10:32:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:52,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68251233] [2024-11-08 10:32:52,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 115 proven. 6 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2024-11-08 10:32:53,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:53,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68251233] [2024-11-08 10:32:53,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68251233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:53,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294620469] [2024-11-08 10:32:53,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:53,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:53,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:53,275 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:32:53,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 10:32:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:53,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:32:53,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-08 10:32:53,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:53,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294620469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:53,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:53,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:32:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109335129] [2024-11-08 10:32:53,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:53,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:53,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:53,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:53,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:53,491 INFO L87 Difference]: Start difference. First operand 40899 states and 45177 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:54,138 INFO L93 Difference]: Finished difference Result 76303 states and 84292 transitions. [2024-11-08 10:32:54,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:54,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 378 [2024-11-08 10:32:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:54,141 INFO L225 Difference]: With dead ends: 76303 [2024-11-08 10:32:54,141 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:32:54,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:54,168 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 242 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:54,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 309 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:32:54,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:32:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:32:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:32:54,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 378 [2024-11-08 10:32:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:54,170 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:32:54,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:32:54,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:32:54,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:32:54,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 10:32:54,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:54,376 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:54,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:32:56,796 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:32:56,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:32:56 BoogieIcfgContainer [2024-11-08 10:32:56,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:32:56,831 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:32:56,831 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:32:56,831 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:32:56,832 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:32:15" (3/4) ... [2024-11-08 10:32:56,834 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:32:56,870 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:32:56,873 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:32:56,875 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:32:56,877 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:32:57,103 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:32:57,104 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:32:57,104 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:32:57,104 INFO L158 Benchmark]: Toolchain (without parser) took 45282.55ms. Allocated memory was 176.2MB in the beginning and 11.8GB in the end (delta: 11.6GB). Free memory was 140.9MB in the beginning and 10.2GB in the end (delta: -10.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-08 10:32:57,105 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:32:57,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1030.15ms. Allocated memory is still 176.2MB. Free memory was 140.1MB in the beginning and 76.1MB in the end (delta: 64.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-08 10:32:57,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 142.37ms. Allocated memory is still 176.2MB. Free memory was 76.1MB in the beginning and 60.4MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 10:32:57,106 INFO L158 Benchmark]: Boogie Preprocessor took 167.29ms. Allocated memory is still 176.2MB. Free memory was 60.4MB in the beginning and 48.8MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:32:57,106 INFO L158 Benchmark]: RCFGBuilder took 2175.13ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 48.8MB in the beginning and 176.2MB in the end (delta: -127.4MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-11-08 10:32:57,106 INFO L158 Benchmark]: TraceAbstraction took 41486.28ms. Allocated memory was 237.0MB in the beginning and 11.8GB in the end (delta: 11.5GB). Free memory was 175.1MB in the beginning and 10.2GB in the end (delta: -10.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-08 10:32:57,106 INFO L158 Benchmark]: Witness Printer took 273.23ms. Allocated memory is still 11.8GB. Free memory was 10.2GB in the beginning and 10.2GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 10:32:57,108 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.20ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1030.15ms. Allocated memory is still 176.2MB. Free memory was 140.1MB in the beginning and 76.1MB in the end (delta: 64.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 142.37ms. Allocated memory is still 176.2MB. Free memory was 76.1MB in the beginning and 60.4MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 167.29ms. Allocated memory is still 176.2MB. Free memory was 60.4MB in the beginning and 48.8MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2175.13ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 48.8MB in the beginning and 176.2MB in the end (delta: -127.4MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 41486.28ms. Allocated memory was 237.0MB in the beginning and 11.8GB in the end (delta: 11.5GB). Free memory was 175.1MB in the beginning and 10.2GB in the end (delta: -10.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 273.23ms. Allocated memory is still 11.8GB. Free memory was 10.2GB in the beginning and 10.2GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 1543]: 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, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.0s, OverallIterations: 19, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4134 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4134 mSDsluCounter, 5341 SdHoareTripleChecker+Invalid, 11.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 728 mSDsCounter, 2190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11500 IncrementalHoareTripleChecker+Invalid, 13690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2190 mSolverCounterUnsat, 4613 mSDtfsCounter, 11500 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2034 GetRequests, 1999 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47080occurred in iteration=11, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 1814 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 6779 NumberOfCodeBlocks, 6779 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 6753 ConstructedInterpolants, 0 QuantifiedInterpolants, 12073 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3902 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 26 InterpolantComputations, 19 PerfectInterpolantSequences, 4291/4333 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: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((a5 == 1) && (a12 == 1)) && (a26 <= 0)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0)) || ((((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (2 <= a3)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a26 <= 0)) && (a11 == 1)) && (a3 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (a26 <= 0)) && (a3 == 1)) && (a11 <= 0)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0))) || ((((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((a5 == 1) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0))) || ((((((a5 == 1) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0))) || ((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a26 <= 0)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a26 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a3 == 0))) || ((((((a26 == 1) && (a5 == 1)) && (2 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a3 == 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a3 == 0)) && (a27 <= 0))) || ((((((a5 == 1) && (a26 <= 0)) && (a11 == 1)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0))) || ((((((a5 == 1) && (a26 <= 0)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((((a25 == 1) && (a5 == 1)) && (a12 == 1)) && (a26 <= 0)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (2 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || ((((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a11 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a11 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a26 <= 0)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:32:57,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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