./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/Problem10_label09.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 0cc06aa14e3792b39a1660d29e8d4f8f87253b3eeb122cbd1713b212029132ef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 22:01:14,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 22:01:14,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 22:01:14,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 22:01:14,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 22:01:14,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 22:01:14,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 22:01:14,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 22:01:14,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 22:01:14,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 22:01:14,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 22:01:14,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 22:01:14,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 22:01:14,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 22:01:14,398 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 22:01:14,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 22:01:14,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 22:01:14,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 22:01:14,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 22:01:14,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 22:01:14,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 22:01:14,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 22:01:14,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 22:01:14,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 22:01:14,406 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 22:01:14,406 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 22:01:14,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 22:01:14,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 22:01:14,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 22:01:14,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 22:01:14,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 22:01:14,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 22:01:14,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:01:14,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 22:01:14,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 22:01:14,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 22:01:14,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 22:01:14,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 22:01:14,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 22:01:14,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 22:01:14,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 22:01:14,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 22:01:14,411 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 -> 0cc06aa14e3792b39a1660d29e8d4f8f87253b3eeb122cbd1713b212029132ef [2024-11-21 22:01:14,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 22:01:14,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 22:01:14,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 22:01:14,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 22:01:14,710 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 22:01:14,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label09.c [2024-11-21 22:01:16,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 22:01:16,345 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 22:01:16,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label09.c [2024-11-21 22:01:16,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d8dc943/d3b8bf52af51431abc8e5baf9e1e745d/FLAGc0ba1cacf [2024-11-21 22:01:16,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d8dc943/d3b8bf52af51431abc8e5baf9e1e745d [2024-11-21 22:01:16,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 22:01:16,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 22:01:16,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 22:01:16,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 22:01:16,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 22:01:16,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:01:16" (1/1) ... [2024-11-21 22:01:16,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257903dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:16, skipping insertion in model container [2024-11-21 22:01:16,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:01:16" (1/1) ... [2024-11-21 22:01:16,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 22:01:16,949 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/Problem10_label09.c[6451,6464] [2024-11-21 22:01:17,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:01:17,104 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 22:01:17,149 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/Problem10_label09.c[6451,6464] [2024-11-21 22:01:17,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:01:17,245 INFO L204 MainTranslator]: Completed translation [2024-11-21 22:01:17,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17 WrapperNode [2024-11-21 22:01:17,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 22:01:17,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 22:01:17,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 22:01:17,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 22:01:17,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (1/1) ... [2024-11-21 22:01:17,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (1/1) ... [2024-11-21 22:01:17,338 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-21 22:01:17,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 22:01:17,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 22:01:17,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 22:01:17,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 22:01:17,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (1/1) ... [2024-11-21 22:01:17,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (1/1) ... [2024-11-21 22:01:17,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (1/1) ... [2024-11-21 22:01:17,405 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-21 22:01:17,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (1/1) ... [2024-11-21 22:01:17,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (1/1) ... [2024-11-21 22:01:17,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (1/1) ... [2024-11-21 22:01:17,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (1/1) ... [2024-11-21 22:01:17,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (1/1) ... [2024-11-21 22:01:17,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (1/1) ... [2024-11-21 22:01:17,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 22:01:17,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 22:01:17,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 22:01:17,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 22:01:17,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (1/1) ... [2024-11-21 22:01:17,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:01:17,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:01:17,483 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-21 22:01:17,490 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-21 22:01:17,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 22:01:17,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 22:01:17,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 22:01:17,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 22:01:17,633 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 22:01:17,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 22:01:18,697 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-21 22:01:18,697 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 22:01:18,724 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 22:01:18,725 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 22:01:18,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:18 BoogieIcfgContainer [2024-11-21 22:01:18,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 22:01:18,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 22:01:18,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 22:01:18,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 22:01:18,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:01:16" (1/3) ... [2024-11-21 22:01:18,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3974d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:01:18, skipping insertion in model container [2024-11-21 22:01:18,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:17" (2/3) ... [2024-11-21 22:01:18,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3974d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:01:18, skipping insertion in model container [2024-11-21 22:01:18,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:18" (3/3) ... [2024-11-21 22:01:18,737 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label09.c [2024-11-21 22:01:18,756 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 22:01:18,757 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 22:01:18,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 22:01:18,829 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;@6072c418, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 22:01:18,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 22:01:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-21 22:01:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-21 22:01:18,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:18,844 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] [2024-11-21 22:01:18,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:18,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:18,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2158734, now seen corresponding path program 1 times [2024-11-21 22:01:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:18,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183070933] [2024-11-21 22:01:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:18,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:19,259 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-21 22:01:19,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:19,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183070933] [2024-11-21 22:01:19,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183070933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:19,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:19,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:01:19,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99000220] [2024-11-21 22:01:19,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:19,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:19,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:19,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:19,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:19,300 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 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 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-21 22:01:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:20,053 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-21 22:01:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:20,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-21 22:01:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:20,064 INFO L225 Difference]: With dead ends: 552 [2024-11-21 22:01:20,065 INFO L226 Difference]: Without dead ends: 282 [2024-11-21 22:01:20,068 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-21 22:01:20,073 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:20,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:01:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-21 22:01:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-21 22:01:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 0 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-21 22:01:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2024-11-21 22:01:20,123 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 56 [2024-11-21 22:01:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:20,124 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2024-11-21 22:01:20,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-21 22:01:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2024-11-21 22:01:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-21 22:01:20,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:20,128 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:20,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 22:01:20,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:20,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:20,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1351612926, now seen corresponding path program 1 times [2024-11-21 22:01:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:20,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677494147] [2024-11-21 22:01:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:20,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 22:01:20,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:20,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677494147] [2024-11-21 22:01:20,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677494147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:01:20,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959357408] [2024-11-21 22:01:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:20,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:01:20,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:01:20,670 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-21 22:01:20,672 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-21 22:01:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:20,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:01:20,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:01:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-21 22:01:21,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:01:21,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959357408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:21,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:01:21,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-21 22:01:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527674009] [2024-11-21 22:01:21,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:21,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:21,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 22:01:21,021 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:21,518 INFO L93 Difference]: Finished difference Result 562 states and 752 transitions. [2024-11-21 22:01:21,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:21,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-21 22:01:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:21,522 INFO L225 Difference]: With dead ends: 562 [2024-11-21 22:01:21,522 INFO L226 Difference]: Without dead ends: 560 [2024-11-21 22:01:21,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 22:01:21,523 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 114 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:21,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 11 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:01:21,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-21 22:01:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2024-11-21 22:01:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4071428571428573) internal successors, (591), 420 states have internal predecessors, (591), 0 states have call successors, (0), 0 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-21 22:01:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 591 transitions. [2024-11-21 22:01:21,552 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 591 transitions. Word has length 122 [2024-11-21 22:01:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:21,553 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 591 transitions. [2024-11-21 22:01:21,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 591 transitions. [2024-11-21 22:01:21,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-21 22:01:21,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:21,557 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:21,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-21 22:01:21,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:01:21,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:21,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:21,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1832463333, now seen corresponding path program 1 times [2024-11-21 22:01:21,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:21,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293697257] [2024-11-21 22:01:21,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:21,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:22,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:22,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293697257] [2024-11-21 22:01:22,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293697257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:22,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:22,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:01:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460273501] [2024-11-21 22:01:22,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:22,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:22,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:22,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:22,058 INFO L87 Difference]: Start difference. First operand 421 states and 591 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-21 22:01:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:22,507 INFO L93 Difference]: Finished difference Result 979 states and 1339 transitions. [2024-11-21 22:01:22,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:22,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-21 22:01:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:22,513 INFO L225 Difference]: With dead ends: 979 [2024-11-21 22:01:22,513 INFO L226 Difference]: Without dead ends: 560 [2024-11-21 22:01:22,514 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-21 22:01:22,515 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:22,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-21 22:01:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-21 22:01:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3237924865831843) internal successors, (740), 559 states have internal predecessors, (740), 0 states have call successors, (0), 0 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-21 22:01:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 740 transitions. [2024-11-21 22:01:22,548 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 740 transitions. Word has length 125 [2024-11-21 22:01:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:22,548 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 740 transitions. [2024-11-21 22:01:22,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-21 22:01:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 740 transitions. [2024-11-21 22:01:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-21 22:01:22,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:22,555 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:22,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 22:01:22,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:22,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:22,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1619344244, now seen corresponding path program 1 times [2024-11-21 22:01:22,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:22,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564633432] [2024-11-21 22:01:22,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:22,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 35 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:22,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564633432] [2024-11-21 22:01:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564633432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:01:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397614136] [2024-11-21 22:01:22,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:22,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:01:22,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:01:22,917 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-21 22:01:22,919 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-21 22:01:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:22,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:01:22,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:01:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:23,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:01:23,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397614136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:23,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:01:23,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-21 22:01:23,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668271942] [2024-11-21 22:01:23,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:23,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:23,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:23,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-21 22:01:23,079 INFO L87 Difference]: Start difference. First operand 560 states and 740 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-21 22:01:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:23,559 INFO L93 Difference]: Finished difference Result 1257 states and 1758 transitions. [2024-11-21 22:01:23,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:23,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2024-11-21 22:01:23,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:23,563 INFO L225 Difference]: With dead ends: 1257 [2024-11-21 22:01:23,563 INFO L226 Difference]: Without dead ends: 838 [2024-11-21 22:01:23,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-21 22:01:23,565 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 91 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:23,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 77 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:01:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-21 22:01:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2024-11-21 22:01:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.32378223495702) internal successors, (924), 698 states have internal predecessors, (924), 0 states have call successors, (0), 0 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-21 22:01:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 924 transitions. [2024-11-21 22:01:23,581 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 924 transitions. Word has length 131 [2024-11-21 22:01:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:23,582 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 924 transitions. [2024-11-21 22:01:23,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-21 22:01:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 924 transitions. [2024-11-21 22:01:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-21 22:01:23,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:23,587 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:23,597 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-21 22:01:23,787 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,SelfDestructingSolverStorable3 [2024-11-21 22:01:23,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:23,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:23,789 INFO L85 PathProgramCache]: Analyzing trace with hash -484638449, now seen corresponding path program 1 times [2024-11-21 22:01:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:23,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652928695] [2024-11-21 22:01:23,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-21 22:01:23,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:23,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652928695] [2024-11-21 22:01:23,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652928695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:23,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:23,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:01:23,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681216861] [2024-11-21 22:01:23,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:23,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:23,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:23,951 INFO L87 Difference]: Start difference. First operand 699 states and 924 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-21 22:01:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:24,381 INFO L93 Difference]: Finished difference Result 1535 states and 2040 transitions. [2024-11-21 22:01:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:24,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 191 [2024-11-21 22:01:24,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:24,385 INFO L225 Difference]: With dead ends: 1535 [2024-11-21 22:01:24,385 INFO L226 Difference]: Without dead ends: 977 [2024-11-21 22:01:24,386 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-21 22:01:24,387 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:24,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-21 22:01:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-21 22:01:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2059426229508197) internal successors, (1177), 976 states have internal predecessors, (1177), 0 states have call successors, (0), 0 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-21 22:01:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1177 transitions. [2024-11-21 22:01:24,403 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1177 transitions. Word has length 191 [2024-11-21 22:01:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:24,403 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1177 transitions. [2024-11-21 22:01:24,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-21 22:01:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1177 transitions. [2024-11-21 22:01:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-21 22:01:24,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:24,406 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-21 22:01:24,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 22:01:24,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:24,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash 430176664, now seen corresponding path program 1 times [2024-11-21 22:01:24,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:24,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921909289] [2024-11-21 22:01:24,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:24,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:24,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:24,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921909289] [2024-11-21 22:01:24,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921909289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:24,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:24,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:24,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292589521] [2024-11-21 22:01:24,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:24,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:24,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:24,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:24,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:24,582 INFO L87 Difference]: Start difference. First operand 977 states and 1177 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 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-21 22:01:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:25,032 INFO L93 Difference]: Finished difference Result 2091 states and 2587 transitions. [2024-11-21 22:01:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:25,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2024-11-21 22:01:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:25,037 INFO L225 Difference]: With dead ends: 2091 [2024-11-21 22:01:25,037 INFO L226 Difference]: Without dead ends: 1255 [2024-11-21 22:01:25,038 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-21 22:01:25,040 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 60 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:25,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 213 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-21 22:01:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-21 22:01:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1770334928229664) internal successors, (1476), 1254 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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-21 22:01:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1476 transitions. [2024-11-21 22:01:25,063 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1476 transitions. Word has length 208 [2024-11-21 22:01:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:25,064 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1476 transitions. [2024-11-21 22:01:25,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 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-21 22:01:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1476 transitions. [2024-11-21 22:01:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-21 22:01:25,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:25,068 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:01:25,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 22:01:25,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:25,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash 243218451, now seen corresponding path program 1 times [2024-11-21 22:01:25,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:25,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35642375] [2024-11-21 22:01:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:25,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35642375] [2024-11-21 22:01:25,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35642375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:25,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:25,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 22:01:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565704732] [2024-11-21 22:01:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:25,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-21 22:01:25,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:25,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-21 22:01:25,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:01:25,496 INFO L87 Difference]: Start difference. First operand 1255 states and 1476 transitions. Second operand has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 6 states have internal predecessors, (263), 0 states have call successors, (0), 0 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-21 22:01:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:26,006 INFO L93 Difference]: Finished difference Result 2424 states and 2861 transitions. [2024-11-21 22:01:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 22:01:26,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 6 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2024-11-21 22:01:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:26,011 INFO L225 Difference]: With dead ends: 2424 [2024-11-21 22:01:26,011 INFO L226 Difference]: Without dead ends: 1255 [2024-11-21 22:01:26,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:01:26,014 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:26,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:01:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-21 22:01:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-21 22:01:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.171451355661882) internal successors, (1469), 1254 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1469 transitions. [2024-11-21 22:01:26,037 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1469 transitions. Word has length 263 [2024-11-21 22:01:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:26,037 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1469 transitions. [2024-11-21 22:01:26,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 6 states have internal predecessors, (263), 0 states have call successors, (0), 0 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-21 22:01:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1469 transitions. [2024-11-21 22:01:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-21 22:01:26,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:26,041 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-21 22:01:26,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 22:01:26,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:26,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1978709063, now seen corresponding path program 1 times [2024-11-21 22:01:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:26,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362946078] [2024-11-21 22:01:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:26,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 39 proven. 68 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-21 22:01:26,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:26,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362946078] [2024-11-21 22:01:26,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362946078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:01:26,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344622271] [2024-11-21 22:01:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:26,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:01:26,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:01:26,440 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-21 22:01:26,443 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-21 22:01:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:26,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:01:26,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:01:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-21 22:01:26,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:01:26,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344622271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:26,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:01:26,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-21 22:01:26,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300484955] [2024-11-21 22:01:26,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:26,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:26,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:26,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:26,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:01:26,676 INFO L87 Difference]: Start difference. First operand 1255 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-21 22:01:27,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:27,125 INFO L93 Difference]: Finished difference Result 1813 states and 2115 transitions. [2024-11-21 22:01:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:27,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 299 [2024-11-21 22:01:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:27,132 INFO L225 Difference]: With dead ends: 1813 [2024-11-21 22:01:27,132 INFO L226 Difference]: Without dead ends: 1811 [2024-11-21 22:01:27,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:01:27,135 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 128 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:27,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 11 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-21 22:01:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1255. [2024-11-21 22:01:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.171451355661882) internal successors, (1469), 1254 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1469 transitions. [2024-11-21 22:01:27,167 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1469 transitions. Word has length 299 [2024-11-21 22:01:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:27,169 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1469 transitions. [2024-11-21 22:01:27,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-21 22:01:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1469 transitions. [2024-11-21 22:01:27,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-21 22:01:27,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:27,174 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-21 22:01:27,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-21 22:01:27,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:01:27,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:27,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1078107625, now seen corresponding path program 1 times [2024-11-21 22:01:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:27,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520115056] [2024-11-21 22:01:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:27,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-21 22:01:27,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:27,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520115056] [2024-11-21 22:01:27,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520115056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:27,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:27,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114703686] [2024-11-21 22:01:27,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:27,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:27,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:27,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:27,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:27,598 INFO L87 Difference]: Start difference. First operand 1255 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 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-21 22:01:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:28,046 INFO L93 Difference]: Finished difference Result 1396 states and 1618 transitions. [2024-11-21 22:01:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:28,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 334 [2024-11-21 22:01:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:28,051 INFO L225 Difference]: With dead ends: 1396 [2024-11-21 22:01:28,051 INFO L226 Difference]: Without dead ends: 1394 [2024-11-21 22:01:28,052 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-21 22:01:28,054 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 128 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:28,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 11 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-21 22:01:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1116. [2024-11-21 22:01:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1829596412556054) internal successors, (1319), 1115 states have internal predecessors, (1319), 0 states have call successors, (0), 0 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-21 22:01:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1319 transitions. [2024-11-21 22:01:28,075 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1319 transitions. Word has length 334 [2024-11-21 22:01:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:28,076 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1319 transitions. [2024-11-21 22:01:28,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 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-21 22:01:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1319 transitions. [2024-11-21 22:01:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-21 22:01:28,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:28,082 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:28,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 22:01:28,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:28,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:28,083 INFO L85 PathProgramCache]: Analyzing trace with hash 236282857, now seen corresponding path program 1 times [2024-11-21 22:01:28,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:28,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574776602] [2024-11-21 22:01:28,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:28,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-21 22:01:28,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:28,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574776602] [2024-11-21 22:01:28,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574776602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:28,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:28,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:28,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314973500] [2024-11-21 22:01:28,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:28,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:28,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:28,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:28,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:28,625 INFO L87 Difference]: Start difference. First operand 1116 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-21 22:01:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:29,054 INFO L93 Difference]: Finished difference Result 2089 states and 2492 transitions. [2024-11-21 22:01:29,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:29,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 355 [2024-11-21 22:01:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:29,056 INFO L225 Difference]: With dead ends: 2089 [2024-11-21 22:01:29,056 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 22:01:29,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 22:01:29,058 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 109 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:29,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 19 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:29,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 22:01:29,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 22:01:29,059 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-21 22:01:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 22:01:29,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 355 [2024-11-21 22:01:29,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:29,060 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 22:01:29,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-21 22:01:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 22:01:29,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 22:01:29,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 22:01:29,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 22:01:29,066 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:29,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 22:01:29,166 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 22:01:29,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:01:29 BoogieIcfgContainer [2024-11-21 22:01:29,182 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 22:01:29,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 22:01:29,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 22:01:29,183 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 22:01:29,183 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:18" (3/4) ... [2024-11-21 22:01:29,186 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 22:01:29,208 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 22:01:29,209 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 22:01:29,209 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 22:01:29,210 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 22:01:29,354 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 22:01:29,354 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 22:01:29,354 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 22:01:29,355 INFO L158 Benchmark]: Toolchain (without parser) took 12684.63ms. Allocated memory was 169.9MB in the beginning and 283.1MB in the end (delta: 113.2MB). Free memory was 124.0MB in the beginning and 126.8MB in the end (delta: -2.8MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. [2024-11-21 22:01:29,355 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 22:01:29,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.00ms. Allocated memory is still 169.9MB. Free memory was 123.7MB in the beginning and 93.2MB in the end (delta: 30.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-21 22:01:29,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.83ms. Allocated memory is still 169.9MB. Free memory was 92.6MB in the beginning and 84.8MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-21 22:01:29,356 INFO L158 Benchmark]: Boogie Preprocessor took 106.02ms. Allocated memory is still 169.9MB. Free memory was 84.8MB in the beginning and 74.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-21 22:01:29,357 INFO L158 Benchmark]: RCFGBuilder took 1279.34ms. Allocated memory was 169.9MB in the beginning and 234.9MB in the end (delta: 65.0MB). Free memory was 74.3MB in the beginning and 193.7MB in the end (delta: -119.5MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-11-21 22:01:29,357 INFO L158 Benchmark]: TraceAbstraction took 10453.16ms. Allocated memory was 234.9MB in the beginning and 283.1MB in the end (delta: 48.2MB). Free memory was 192.7MB in the beginning and 138.3MB in the end (delta: 54.4MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. [2024-11-21 22:01:29,357 INFO L158 Benchmark]: Witness Printer took 171.81ms. Allocated memory is still 283.1MB. Free memory was 138.3MB in the beginning and 126.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-21 22:01:29,359 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 100.7MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.00ms. Allocated memory is still 169.9MB. Free memory was 123.7MB in the beginning and 93.2MB in the end (delta: 30.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.83ms. Allocated memory is still 169.9MB. Free memory was 92.6MB in the beginning and 84.8MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.02ms. Allocated memory is still 169.9MB. Free memory was 84.8MB in the beginning and 74.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1279.34ms. Allocated memory was 169.9MB in the beginning and 234.9MB in the end (delta: 65.0MB). Free memory was 74.3MB in the beginning and 193.7MB in the end (delta: -119.5MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10453.16ms. Allocated memory was 234.9MB in the beginning and 283.1MB in the end (delta: 48.2MB). Free memory was 192.7MB in the beginning and 138.3MB in the end (delta: 54.4MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. * Witness Printer took 171.81ms. Allocated memory is still 283.1MB. Free memory was 138.3MB in the beginning and 126.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 182]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1058 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1058 mSDsluCounter, 595 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 599 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3971 IncrementalHoareTripleChecker+Invalid, 4570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 599 mSolverCounterUnsat, 545 mSDtfsCounter, 3971 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1255occurred in iteration=6, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1112 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2636 NumberOfCodeBlocks, 2636 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2623 ConstructedInterpolants, 0 QuantifiedInterpolants, 8871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 817 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 1909/2039 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: 592]: Loop Invariant Derived loop invariant: ((((((a19 <= 9) && (a10 != 2)) && (14 == a4)) && (a12 == 0)) || (((a10 <= 1) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (7 <= a19)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-21 22:01:29,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE