./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:46:55,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:46:55,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:46:55,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:46:55,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:46:55,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:46:55,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:46:55,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:46:55,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:46:55,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:46:55,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:46:55,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:46:55,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:46:55,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:46:55,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:46:55,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:46:55,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:46:55,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:46:55,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:46:55,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:46:55,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:46:55,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:46:55,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:46:55,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:46:55,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:46:55,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:46:55,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:46:55,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:46:55,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:46:55,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:46:55,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:46:55,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:46:55,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:46:55,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:46:55,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:46:55,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:46:55,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:46:55,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:46:55,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:46:55,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:46:55,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:46:55,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:46:55,579 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-11 16:46:55,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:46:55,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:46:55,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:46:55,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:46:55,803 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:46:55,804 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-11 16:46:57,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:46:57,351 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:46:57,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label09.c [2024-11-11 16:46:57,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fa509706/61ca90e9590140c9b0d3b4fd8f110a50/FLAG36c50357d [2024-11-11 16:46:57,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fa509706/61ca90e9590140c9b0d3b4fd8f110a50 [2024-11-11 16:46:57,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:46:57,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:46:57,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:46:57,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:46:57,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:46:57,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:46:57" (1/1) ... [2024-11-11 16:46:57,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@837a57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:57, skipping insertion in model container [2024-11-11 16:46:57,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:46:57" (1/1) ... [2024-11-11 16:46:57,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:46:57,939 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-11 16:46:58,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:46:58,061 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:46:58,090 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-11 16:46:58,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:46:58,162 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:46:58,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58 WrapperNode [2024-11-11 16:46:58,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:46:58,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:46:58,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:46:58,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:46:58,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (1/1) ... [2024-11-11 16:46:58,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (1/1) ... [2024-11-11 16:46:58,224 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-11 16:46:58,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:46:58,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:46:58,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:46:58,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:46:58,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (1/1) ... [2024-11-11 16:46:58,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (1/1) ... [2024-11-11 16:46:58,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (1/1) ... [2024-11-11 16:46:58,276 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:46:58,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (1/1) ... [2024-11-11 16:46:58,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (1/1) ... [2024-11-11 16:46:58,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (1/1) ... [2024-11-11 16:46:58,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (1/1) ... [2024-11-11 16:46:58,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (1/1) ... [2024-11-11 16:46:58,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (1/1) ... [2024-11-11 16:46:58,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:46:58,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:46:58,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:46:58,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:46:58,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (1/1) ... [2024-11-11 16:46:58,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:46:58,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:46:58,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:46:58,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:46:58,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:46:58,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:46:58,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:46:58,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:46:58,448 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:46:58,450 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:46:59,229 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-11 16:46:59,229 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:46:59,248 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:46:59,250 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:46:59,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:46:59 BoogieIcfgContainer [2024-11-11 16:46:59,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:46:59,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:46:59,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:46:59,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:46:59,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:46:57" (1/3) ... [2024-11-11 16:46:59,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9ac72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:46:59, skipping insertion in model container [2024-11-11 16:46:59,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:58" (2/3) ... [2024-11-11 16:46:59,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9ac72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:46:59, skipping insertion in model container [2024-11-11 16:46:59,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:46:59" (3/3) ... [2024-11-11 16:46:59,258 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label09.c [2024-11-11 16:46:59,272 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:46:59,272 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:46:59,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:46:59,337 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;@3fc163b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:46:59,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:46:59,342 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-11 16:46:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 16:46:59,351 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:46:59,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:46:59,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:46:59,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:46:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2158734, now seen corresponding path program 1 times [2024-11-11 16:46:59,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:46:59,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843914068] [2024-11-11 16:46:59,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:46:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:46:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:46:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:46:59,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:46:59,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843914068] [2024-11-11 16:46:59,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843914068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:46:59,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:46:59,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:46:59,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495555610] [2024-11-11 16:46:59,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:46:59,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:46:59,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:46:59,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:46:59,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:46:59,750 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-11 16:47:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:00,326 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-11 16:47:00,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:00,328 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-11 16:47:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:00,337 INFO L225 Difference]: With dead ends: 552 [2024-11-11 16:47:00,337 INFO L226 Difference]: Without dead ends: 282 [2024-11-11 16:47:00,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:00,347 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:00,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:00,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-11 16:47:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-11 16:47:00,395 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-11 16:47:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2024-11-11 16:47:00,397 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 56 [2024-11-11 16:47:00,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:00,397 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2024-11-11 16:47:00,398 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-11 16:47:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2024-11-11 16:47:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 16:47:00,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:00,401 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11 16:47:00,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:47:00,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:00,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:00,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1351612926, now seen corresponding path program 1 times [2024-11-11 16:47:00,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:00,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842675280] [2024-11-11 16:47:00,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:00,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:00,784 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-11 16:47:00,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:00,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842675280] [2024-11-11 16:47:00,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842675280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:47:00,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992107107] [2024-11-11 16:47:00,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:00,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:00,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:00,787 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:47:00,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:47:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:00,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:47:00,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:47:00,993 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-11 16:47:00,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:47:00,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992107107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:00,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:47:00,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-11 16:47:00,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671449626] [2024-11-11 16:47:00,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:00,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:00,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:00,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:00,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:47:00,996 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-11 16:47:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:01,361 INFO L93 Difference]: Finished difference Result 562 states and 752 transitions. [2024-11-11 16:47:01,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:01,362 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-11 16:47:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:01,364 INFO L225 Difference]: With dead ends: 562 [2024-11-11 16:47:01,364 INFO L226 Difference]: Without dead ends: 560 [2024-11-11 16:47:01,365 INFO L434 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-11 16:47:01,367 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 114 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:01,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 11 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:47:01,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-11 16:47:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2024-11-11 16:47:01,379 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-11 16:47:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 591 transitions. [2024-11-11 16:47:01,380 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 591 transitions. Word has length 122 [2024-11-11 16:47:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:01,380 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 591 transitions. [2024-11-11 16:47:01,380 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-11 16:47:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 591 transitions. [2024-11-11 16:47:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 16:47:01,383 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:01,383 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:01,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:47:01,587 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-11 16:47:01,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:01,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1832463333, now seen corresponding path program 1 times [2024-11-11 16:47:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:01,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747958906] [2024-11-11 16:47:01,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:01,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:01,810 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-11 16:47:01,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:01,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747958906] [2024-11-11 16:47:01,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747958906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:01,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:01,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:47:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313898461] [2024-11-11 16:47:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:01,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:01,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:01,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:01,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:01,812 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-11 16:47:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:02,133 INFO L93 Difference]: Finished difference Result 979 states and 1339 transitions. [2024-11-11 16:47:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:02,133 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-11 16:47:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:02,135 INFO L225 Difference]: With dead ends: 979 [2024-11-11 16:47:02,135 INFO L226 Difference]: Without dead ends: 560 [2024-11-11 16:47:02,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:02,137 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:02,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:47:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-11 16:47:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-11 16:47:02,147 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-11 16:47:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 740 transitions. [2024-11-11 16:47:02,149 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 740 transitions. Word has length 125 [2024-11-11 16:47:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:02,149 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 740 transitions. [2024-11-11 16:47:02,149 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-11 16:47:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 740 transitions. [2024-11-11 16:47:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 16:47:02,151 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:02,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11 16:47:02,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:47:02,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:02,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:02,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1619344244, now seen corresponding path program 1 times [2024-11-11 16:47:02,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:02,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087805406] [2024-11-11 16:47:02,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:02,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:02,407 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-11 16:47:02,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:02,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087805406] [2024-11-11 16:47:02,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087805406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:47:02,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919101115] [2024-11-11 16:47:02,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:02,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:02,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:02,409 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:47:02,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:47:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:02,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:47:02,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:47:02,517 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-11 16:47:02,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:47:02,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919101115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:02,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:47:02,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 16:47:02,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096127717] [2024-11-11 16:47:02,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:02,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:02,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:02,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:02,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:47:02,522 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-11 16:47:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:02,952 INFO L93 Difference]: Finished difference Result 1257 states and 1758 transitions. [2024-11-11 16:47:02,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:02,953 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-11 16:47:02,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:02,955 INFO L225 Difference]: With dead ends: 1257 [2024-11-11 16:47:02,955 INFO L226 Difference]: Without dead ends: 838 [2024-11-11 16:47:02,955 INFO L434 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-11 16:47:02,956 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 91 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:02,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 77 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-11 16:47:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2024-11-11 16:47:02,966 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-11 16:47:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 924 transitions. [2024-11-11 16:47:02,968 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 924 transitions. Word has length 131 [2024-11-11 16:47:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:02,968 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 924 transitions. [2024-11-11 16:47:02,968 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-11 16:47:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 924 transitions. [2024-11-11 16:47:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-11 16:47:02,974 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:02,975 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11 16:47:02,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 16:47:03,175 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-11 16:47:03,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:03,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:03,176 INFO L85 PathProgramCache]: Analyzing trace with hash -484638449, now seen corresponding path program 1 times [2024-11-11 16:47:03,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:03,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49748277] [2024-11-11 16:47:03,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:03,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:03,399 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-11 16:47:03,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:03,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49748277] [2024-11-11 16:47:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49748277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:03,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:03,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:47:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838163655] [2024-11-11 16:47:03,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:03,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:03,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:03,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:03,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:03,401 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-11 16:47:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:03,744 INFO L93 Difference]: Finished difference Result 1535 states and 2040 transitions. [2024-11-11 16:47:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:03,747 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-11 16:47:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:03,749 INFO L225 Difference]: With dead ends: 1535 [2024-11-11 16:47:03,749 INFO L226 Difference]: Without dead ends: 977 [2024-11-11 16:47:03,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:03,750 INFO L435 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.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:03,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:47:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-11 16:47:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-11 16:47:03,760 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-11 16:47:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1177 transitions. [2024-11-11 16:47:03,762 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1177 transitions. Word has length 191 [2024-11-11 16:47:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:03,762 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1177 transitions. [2024-11-11 16:47:03,762 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-11 16:47:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1177 transitions. [2024-11-11 16:47:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-11 16:47:03,764 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:03,764 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11 16:47:03,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:47:03,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:03,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:03,765 INFO L85 PathProgramCache]: Analyzing trace with hash 430176664, now seen corresponding path program 1 times [2024-11-11 16:47:03,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:03,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311496636] [2024-11-11 16:47:03,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:03,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:03,913 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-11 16:47:03,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:03,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311496636] [2024-11-11 16:47:03,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311496636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:03,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:03,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:47:03,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333759202] [2024-11-11 16:47:03,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:03,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:03,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:03,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:03,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:03,915 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-11 16:47:04,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:04,249 INFO L93 Difference]: Finished difference Result 2091 states and 2587 transitions. [2024-11-11 16:47:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:04,250 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-11 16:47:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:04,253 INFO L225 Difference]: With dead ends: 2091 [2024-11-11 16:47:04,253 INFO L226 Difference]: Without dead ends: 1255 [2024-11-11 16:47:04,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:04,254 INFO L435 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.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:04,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 213 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:47:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-11 16:47:04,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-11 16:47:04,265 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-11 16:47:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1476 transitions. [2024-11-11 16:47:04,267 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1476 transitions. Word has length 208 [2024-11-11 16:47:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:04,267 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1476 transitions. [2024-11-11 16:47:04,268 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-11 16:47:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1476 transitions. [2024-11-11 16:47:04,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-11 16:47:04,270 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:04,270 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11 16:47:04,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:47:04,270 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:04,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:04,271 INFO L85 PathProgramCache]: Analyzing trace with hash 243218451, now seen corresponding path program 1 times [2024-11-11 16:47:04,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:04,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845335892] [2024-11-11 16:47:04,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:04,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:04,563 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-11 16:47:04,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845335892] [2024-11-11 16:47:04,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845335892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:04,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:04,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 16:47:04,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381622852] [2024-11-11 16:47:04,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:04,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 16:47:04,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:04,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 16:47:04,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:47:04,565 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-11 16:47:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:04,986 INFO L93 Difference]: Finished difference Result 2424 states and 2861 transitions. [2024-11-11 16:47:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 16:47:04,986 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-11 16:47:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:04,989 INFO L225 Difference]: With dead ends: 2424 [2024-11-11 16:47:04,989 INFO L226 Difference]: Without dead ends: 1255 [2024-11-11 16:47:04,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:47:04,991 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:04,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:04,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-11 16:47:05,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-11 16:47:05,006 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-11 16:47:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1469 transitions. [2024-11-11 16:47:05,009 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1469 transitions. Word has length 263 [2024-11-11 16:47:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:05,009 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1469 transitions. [2024-11-11 16:47:05,009 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-11 16:47:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1469 transitions. [2024-11-11 16:47:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-11 16:47:05,013 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:05,013 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11 16:47:05,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:47:05,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:05,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:05,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1978709063, now seen corresponding path program 1 times [2024-11-11 16:47:05,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:05,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83739201] [2024-11-11 16:47:05,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:05,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:05,284 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-11 16:47:05,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:05,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83739201] [2024-11-11 16:47:05,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83739201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:47:05,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677044173] [2024-11-11 16:47:05,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:05,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:05,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:05,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:47:05,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 16:47:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:05,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:47:05,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:47:05,437 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-11 16:47:05,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:47:05,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677044173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:05,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:47:05,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 16:47:05,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953767414] [2024-11-11 16:47:05,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:05,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:05,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:05,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:05,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:47:05,439 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-11 16:47:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:05,787 INFO L93 Difference]: Finished difference Result 1813 states and 2115 transitions. [2024-11-11 16:47:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:05,788 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-11 16:47:05,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:05,792 INFO L225 Difference]: With dead ends: 1813 [2024-11-11 16:47:05,792 INFO L226 Difference]: Without dead ends: 1811 [2024-11-11 16:47:05,793 INFO L434 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-11 16:47:05,793 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 128 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:05,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 11 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:47:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-11 16:47:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1255. [2024-11-11 16:47:05,807 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-11 16:47:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1469 transitions. [2024-11-11 16:47:05,809 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1469 transitions. Word has length 299 [2024-11-11 16:47:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:05,809 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1469 transitions. [2024-11-11 16:47:05,809 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-11 16:47:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1469 transitions. [2024-11-11 16:47:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-11 16:47:05,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:05,813 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-11 16:47:05,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 16:47:06,013 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-11 16:47:06,013 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:06,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1078107625, now seen corresponding path program 1 times [2024-11-11 16:47:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:06,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136354080] [2024-11-11 16:47:06,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:06,269 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-11 16:47:06,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:06,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136354080] [2024-11-11 16:47:06,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136354080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:06,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:06,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:47:06,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894191138] [2024-11-11 16:47:06,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:06,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:06,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:06,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:06,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:06,271 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-11 16:47:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:06,809 INFO L93 Difference]: Finished difference Result 1396 states and 1618 transitions. [2024-11-11 16:47:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:06,809 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-11 16:47:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:06,813 INFO L225 Difference]: With dead ends: 1396 [2024-11-11 16:47:06,813 INFO L226 Difference]: Without dead ends: 1394 [2024-11-11 16:47:06,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:06,818 INFO L435 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.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:06,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 11 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-11 16:47:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1116. [2024-11-11 16:47:06,841 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-11 16:47:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1319 transitions. [2024-11-11 16:47:06,848 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1319 transitions. Word has length 334 [2024-11-11 16:47:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:06,848 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1319 transitions. [2024-11-11 16:47:06,848 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-11 16:47:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1319 transitions. [2024-11-11 16:47:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-11 16:47:06,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:06,855 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-11 16:47:06,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:47:06,855 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:06,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash 236282857, now seen corresponding path program 1 times [2024-11-11 16:47:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:06,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571991108] [2024-11-11 16:47:06,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:07,431 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-11 16:47:07,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:07,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571991108] [2024-11-11 16:47:07,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571991108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:07,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:07,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:47:07,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627589904] [2024-11-11 16:47:07,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:07,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:07,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:07,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:07,433 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-11 16:47:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:08,075 INFO L93 Difference]: Finished difference Result 2089 states and 2492 transitions. [2024-11-11 16:47:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:08,075 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-11 16:47:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:08,076 INFO L225 Difference]: With dead ends: 2089 [2024-11-11 16:47:08,076 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:47:08,077 INFO L434 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-11 16:47:08,078 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 109 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:08,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 19 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:47:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:47:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:47:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:47:08,079 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 355 [2024-11-11 16:47:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:08,079 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:47:08,079 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-11 16:47:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:47:08,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:47:08,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:47:08,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:47:08,084 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:08,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:47:08,231 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:47:08,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:47:08 BoogieIcfgContainer [2024-11-11 16:47:08,248 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:47:08,248 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:47:08,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:47:08,248 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:47:08,249 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:46:59" (3/4) ... [2024-11-11 16:47:08,250 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:47:08,268 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:47:08,268 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:47:08,269 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:47:08,269 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:47:08,387 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:47:08,388 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:47:08,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:47:08,388 INFO L158 Benchmark]: Toolchain (without parser) took 10687.92ms. Allocated memory was 144.7MB in the beginning and 373.3MB in the end (delta: 228.6MB). Free memory was 106.9MB in the beginning and 227.6MB in the end (delta: -120.7MB). Peak memory consumption was 110.5MB. Max. memory is 16.1GB. [2024-11-11 16:47:08,390 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 144.7MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:47:08,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.41ms. Allocated memory is still 144.7MB. Free memory was 106.9MB in the beginning and 77.1MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-11 16:47:08,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.62ms. Allocated memory is still 144.7MB. Free memory was 77.1MB in the beginning and 68.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 16:47:08,391 INFO L158 Benchmark]: Boogie Preprocessor took 84.13ms. Allocated memory is still 144.7MB. Free memory was 68.7MB in the beginning and 58.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 16:47:08,391 INFO L158 Benchmark]: RCFGBuilder took 940.85ms. Allocated memory was 144.7MB in the beginning and 213.9MB in the end (delta: 69.2MB). Free memory was 58.7MB in the beginning and 103.9MB in the end (delta: -45.2MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-11-11 16:47:08,391 INFO L158 Benchmark]: TraceAbstraction took 8995.59ms. Allocated memory was 213.9MB in the beginning and 373.3MB in the end (delta: 159.4MB). Free memory was 102.8MB in the beginning and 239.2MB in the end (delta: -136.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-11 16:47:08,392 INFO L158 Benchmark]: Witness Printer took 140.01ms. Allocated memory is still 373.3MB. Free memory was 239.2MB in the beginning and 227.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 16:47:08,393 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.15ms. Allocated memory is still 144.7MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.41ms. Allocated memory is still 144.7MB. Free memory was 106.9MB in the beginning and 77.1MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.62ms. Allocated memory is still 144.7MB. Free memory was 77.1MB in the beginning and 68.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.13ms. Allocated memory is still 144.7MB. Free memory was 68.7MB in the beginning and 58.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 940.85ms. Allocated memory was 144.7MB in the beginning and 213.9MB in the end (delta: 69.2MB). Free memory was 58.7MB in the beginning and 103.9MB in the end (delta: -45.2MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8995.59ms. Allocated memory was 213.9MB in the beginning and 373.3MB in the end (delta: 159.4MB). Free memory was 102.8MB in the beginning and 239.2MB in the end (delta: -136.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Witness Printer took 140.01ms. Allocated memory is still 373.3MB. Free memory was 239.2MB in the beginning and 227.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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: 8.8s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1058 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1058 mSDsluCounter, 595 SdHoareTripleChecker+Invalid, 3.4s 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.1s 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.3s SatisfiabilityAnalysisTime, 2.7s 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-11 16:47:08,427 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