./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/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-?-c7c6ca5-m [2024-11-08 11:08:45,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:08:45,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:08:45,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:08:45,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:08:45,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:08:45,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:08:45,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:08:45,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:08:45,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:08:45,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:08:45,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:08:45,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:08:45,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:08:45,377 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:08:45,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:08:45,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:08:45,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:08:45,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:08:45,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:08:45,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:08:45,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:08:45,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:08:45,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:08:45,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:08:45,383 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:08:45,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:08:45,384 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:08:45,384 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:08:45,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:08:45,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:08:45,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:08:45,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:08:45,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:08:45,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:08:45,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:08:45,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:08:45,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:08:45,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:08:45,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:08:45,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:08:45,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:08:45,388 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-08 11:08:45,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:08:45,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:08:45,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:08:45,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:08:45,666 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:08:45,668 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-08 11:08:47,158 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:08:47,398 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:08:47,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label09.c [2024-11-08 11:08:47,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e7e82ab/bfa0411c907a41f0a582ee8923ebdfa1/FLAGb94e61dd2 [2024-11-08 11:08:47,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e7e82ab/bfa0411c907a41f0a582ee8923ebdfa1 [2024-11-08 11:08:47,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:08:47,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:08:47,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:08:47,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:08:47,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:08:47,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:08:47" (1/1) ... [2024-11-08 11:08:47,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba9930a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:47, skipping insertion in model container [2024-11-08 11:08:47,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:08:47" (1/1) ... [2024-11-08 11:08:47,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:08:47,738 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-08 11:08:47,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:08:47,922 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:08:47,951 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-08 11:08:48,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:08:48,068 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:08:48,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48 WrapperNode [2024-11-08 11:08:48,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:08:48,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:08:48,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:08:48,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:08:48,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (1/1) ... [2024-11-08 11:08:48,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (1/1) ... [2024-11-08 11:08:48,145 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-08 11:08:48,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:08:48,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:08:48,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:08:48,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:08:48,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (1/1) ... [2024-11-08 11:08:48,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (1/1) ... [2024-11-08 11:08:48,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (1/1) ... [2024-11-08 11:08:48,202 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:08:48,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (1/1) ... [2024-11-08 11:08:48,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (1/1) ... [2024-11-08 11:08:48,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (1/1) ... [2024-11-08 11:08:48,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (1/1) ... [2024-11-08 11:08:48,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (1/1) ... [2024-11-08 11:08:48,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (1/1) ... [2024-11-08 11:08:48,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:08:48,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:08:48,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:08:48,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:08:48,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (1/1) ... [2024-11-08 11:08:48,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:08:48,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:08:48,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:08:48,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:08:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:08:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:08:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:08:48,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:08:48,427 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:08:48,429 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:08:49,471 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 11:08:49,471 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:08:49,492 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:08:49,494 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:08:49,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:08:49 BoogieIcfgContainer [2024-11-08 11:08:49,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:08:49,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:08:49,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:08:49,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:08:49,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:08:47" (1/3) ... [2024-11-08 11:08:49,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394e6ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:08:49, skipping insertion in model container [2024-11-08 11:08:49,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:08:48" (2/3) ... [2024-11-08 11:08:49,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394e6ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:08:49, skipping insertion in model container [2024-11-08 11:08:49,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:08:49" (3/3) ... [2024-11-08 11:08:49,506 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label09.c [2024-11-08 11:08:49,525 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:08:49,525 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:08:49,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:08:49,598 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;@33fea0b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:08:49,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:08:49,603 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-08 11:08:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 11:08:49,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:08:49,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:08:49,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:08:49,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:08:49,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2158734, now seen corresponding path program 1 times [2024-11-08 11:08:49,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:08:49,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308186643] [2024-11-08 11:08:49,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:49,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:08:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:08:50,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:08:50,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308186643] [2024-11-08 11:08:50,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308186643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:08:50,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:08:50,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:08:50,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698570623] [2024-11-08 11:08:50,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:08:50,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:08:50,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:08:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:08:50,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:08:50,037 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-08 11:08:50,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:08:50,811 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-08 11:08:50,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:08:50,813 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-08 11:08:50,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:08:50,824 INFO L225 Difference]: With dead ends: 552 [2024-11-08 11:08:50,824 INFO L226 Difference]: Without dead ends: 282 [2024-11-08 11:08:50,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:08:50,831 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:08:50,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:08:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-08 11:08:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-08 11:08:50,885 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-08 11:08:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2024-11-08 11:08:50,888 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 56 [2024-11-08 11:08:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:08:50,888 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2024-11-08 11:08:50,889 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-08 11:08:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2024-11-08 11:08:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 11:08:50,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:08:50,893 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:08:50,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:08:50,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:08:50,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:08:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1351612926, now seen corresponding path program 1 times [2024-11-08 11:08:50,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:08:50,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531991782] [2024-11-08 11:08:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:50,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:08:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:51,385 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-08 11:08:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:08:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531991782] [2024-11-08 11:08:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531991782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:08:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427837469] [2024-11-08 11:08:51,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:51,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:08:51,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:08:51,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:08:51,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:08:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:51,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:08:51,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:08:51,764 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-08 11:08:51,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:08:51,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427837469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:08:51,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:08:51,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-08 11:08:51,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043949210] [2024-11-08 11:08:51,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:08:51,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:08:51,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:08:51,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:08:51,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:08:51,769 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-08 11:08:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:08:52,288 INFO L93 Difference]: Finished difference Result 562 states and 752 transitions. [2024-11-08 11:08:52,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:08:52,289 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-08 11:08:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:08:52,296 INFO L225 Difference]: With dead ends: 562 [2024-11-08 11:08:52,296 INFO L226 Difference]: Without dead ends: 560 [2024-11-08 11:08:52,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:08:52,298 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 114 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:08:52,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 11 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:08:52,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-08 11:08:52,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2024-11-08 11:08:52,333 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-08 11:08:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 591 transitions. [2024-11-08 11:08:52,335 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 591 transitions. Word has length 122 [2024-11-08 11:08:52,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:08:52,337 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 591 transitions. [2024-11-08 11:08:52,337 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-08 11:08:52,338 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 591 transitions. [2024-11-08 11:08:52,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 11:08:52,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:08:52,343 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:08:52,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:08:52,544 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-08 11:08:52,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:08:52,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:08:52,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1832463333, now seen corresponding path program 1 times [2024-11-08 11:08:52,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:08:52,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375699240] [2024-11-08 11:08:52,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:08:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:52,844 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-08 11:08:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:08:52,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375699240] [2024-11-08 11:08:52,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375699240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:08:52,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:08:52,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:08:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74740500] [2024-11-08 11:08:52,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:08:52,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:08:52,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:08:52,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:08:52,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:08:52,847 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-08 11:08:53,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:08:53,256 INFO L93 Difference]: Finished difference Result 979 states and 1339 transitions. [2024-11-08 11:08:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:08:53,257 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-08 11:08:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:08:53,259 INFO L225 Difference]: With dead ends: 979 [2024-11-08 11:08:53,259 INFO L226 Difference]: Without dead ends: 560 [2024-11-08 11:08:53,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:08:53,262 INFO L432 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.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:08:53,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:08:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-08 11:08:53,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-08 11:08:53,274 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-08 11:08:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 740 transitions. [2024-11-08 11:08:53,276 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 740 transitions. Word has length 125 [2024-11-08 11:08:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:08:53,277 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 740 transitions. [2024-11-08 11:08:53,277 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-08 11:08:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 740 transitions. [2024-11-08 11:08:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 11:08:53,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:08:53,279 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:08:53,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:08:53,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:08:53,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:08:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1619344244, now seen corresponding path program 1 times [2024-11-08 11:08:53,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:08:53,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137102887] [2024-11-08 11:08:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:08:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:53,596 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-08 11:08:53,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:08:53,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137102887] [2024-11-08 11:08:53,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137102887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:08:53,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577026401] [2024-11-08 11:08:53,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:53,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:08:53,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:08:53,602 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:08:53,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:08:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:53,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:08:53,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:08:53,759 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-08 11:08:53,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:08:53,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577026401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:08:53,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:08:53,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:08:53,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212413458] [2024-11-08 11:08:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:08:53,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:08:53,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:08:53,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:08:53,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:08:53,764 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-08 11:08:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:08:54,231 INFO L93 Difference]: Finished difference Result 1257 states and 1758 transitions. [2024-11-08 11:08:54,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:08:54,232 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-08 11:08:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:08:54,235 INFO L225 Difference]: With dead ends: 1257 [2024-11-08 11:08:54,236 INFO L226 Difference]: Without dead ends: 838 [2024-11-08 11:08:54,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:08:54,239 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 91 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:08:54,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 77 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:08:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-08 11:08:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2024-11-08 11:08:54,259 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-08 11:08:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 924 transitions. [2024-11-08 11:08:54,263 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 924 transitions. Word has length 131 [2024-11-08 11:08:54,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:08:54,263 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 924 transitions. [2024-11-08 11:08:54,264 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-08 11:08:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 924 transitions. [2024-11-08 11:08:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 11:08:54,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:08:54,268 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:08:54,283 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-08 11:08:54,471 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-08 11:08:54,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:08:54,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:08:54,472 INFO L85 PathProgramCache]: Analyzing trace with hash -484638449, now seen corresponding path program 1 times [2024-11-08 11:08:54,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:08:54,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109664802] [2024-11-08 11:08:54,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:54,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:08:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:54,639 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-08 11:08:54,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:08:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109664802] [2024-11-08 11:08:54,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109664802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:08:54,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:08:54,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:08:54,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517411036] [2024-11-08 11:08:54,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:08:54,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:08:54,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:08:54,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:08:54,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:08:54,642 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-08 11:08:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:08:55,072 INFO L93 Difference]: Finished difference Result 1535 states and 2040 transitions. [2024-11-08 11:08:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:08:55,072 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-08 11:08:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:08:55,077 INFO L225 Difference]: With dead ends: 1535 [2024-11-08 11:08:55,077 INFO L226 Difference]: Without dead ends: 977 [2024-11-08 11:08:55,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:08:55,079 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:08:55,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:08:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-08 11:08:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-08 11:08:55,094 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-08 11:08:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1177 transitions. [2024-11-08 11:08:55,097 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1177 transitions. Word has length 191 [2024-11-08 11:08:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:08:55,098 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1177 transitions. [2024-11-08 11:08:55,098 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-08 11:08:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1177 transitions. [2024-11-08 11:08:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 11:08:55,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:08:55,102 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:08:55,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:08:55,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:08:55,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:08:55,106 INFO L85 PathProgramCache]: Analyzing trace with hash 430176664, now seen corresponding path program 1 times [2024-11-08 11:08:55,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:08:55,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401782651] [2024-11-08 11:08:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:55,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:08:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:55,284 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-08 11:08:55,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:08:55,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401782651] [2024-11-08 11:08:55,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401782651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:08:55,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:08:55,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:08:55,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750334314] [2024-11-08 11:08:55,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:08:55,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:08:55,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:08:55,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:08:55,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:08:55,290 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-08 11:08:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:08:55,767 INFO L93 Difference]: Finished difference Result 2091 states and 2587 transitions. [2024-11-08 11:08:55,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:08:55,768 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-08 11:08:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:08:55,772 INFO L225 Difference]: With dead ends: 2091 [2024-11-08 11:08:55,773 INFO L226 Difference]: Without dead ends: 1255 [2024-11-08 11:08:55,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:08:55,775 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 60 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:08:55,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 213 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:08:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-08 11:08:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-08 11:08:55,800 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-08 11:08:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1476 transitions. [2024-11-08 11:08:55,804 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1476 transitions. Word has length 208 [2024-11-08 11:08:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:08:55,804 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1476 transitions. [2024-11-08 11:08:55,804 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-08 11:08:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1476 transitions. [2024-11-08 11:08:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 11:08:55,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:08:55,809 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:08:55,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:08:55,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:08:55,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:08:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash 243218451, now seen corresponding path program 1 times [2024-11-08 11:08:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:08:55,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711333067] [2024-11-08 11:08:55,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:55,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:08:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:56,273 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-08 11:08:56,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:08:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711333067] [2024-11-08 11:08:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711333067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:08:56,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:08:56,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 11:08:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086816954] [2024-11-08 11:08:56,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:08:56,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 11:08:56,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:08:56,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 11:08:56,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:08:56,277 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-08 11:08:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:08:56,771 INFO L93 Difference]: Finished difference Result 2424 states and 2861 transitions. [2024-11-08 11:08:56,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 11:08:56,772 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-08 11:08:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:08:56,776 INFO L225 Difference]: With dead ends: 2424 [2024-11-08 11:08:56,776 INFO L226 Difference]: Without dead ends: 1255 [2024-11-08 11:08:56,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:08:56,779 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:08:56,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:08:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-08 11:08:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-08 11:08:56,799 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-08 11:08:56,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1469 transitions. [2024-11-08 11:08:56,802 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1469 transitions. Word has length 263 [2024-11-08 11:08:56,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:08:56,802 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1469 transitions. [2024-11-08 11:08:56,803 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-08 11:08:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1469 transitions. [2024-11-08 11:08:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-08 11:08:56,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:08:56,807 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:08:56,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:08:56,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:08:56,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:08:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1978709063, now seen corresponding path program 1 times [2024-11-08 11:08:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:08:56,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164442490] [2024-11-08 11:08:56,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:56,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:08:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:57,197 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-08 11:08:57,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:08:57,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164442490] [2024-11-08 11:08:57,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164442490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:08:57,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451048998] [2024-11-08 11:08:57,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:57,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:08:57,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:08:57,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:08:57,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 11:08:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:57,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:08:57,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:08:57,424 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-08 11:08:57,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:08:57,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451048998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:08:57,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:08:57,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 11:08:57,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40916143] [2024-11-08 11:08:57,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:08:57,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:08:57,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:08:57,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:08:57,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:08:57,426 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-08 11:08:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:08:57,880 INFO L93 Difference]: Finished difference Result 1813 states and 2115 transitions. [2024-11-08 11:08:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:08:57,881 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-08 11:08:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:08:57,887 INFO L225 Difference]: With dead ends: 1813 [2024-11-08 11:08:57,887 INFO L226 Difference]: Without dead ends: 1811 [2024-11-08 11:08:57,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:08:57,888 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 128 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:08:57,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 11 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:08:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-08 11:08:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1255. [2024-11-08 11:08:57,908 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-08 11:08:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1469 transitions. [2024-11-08 11:08:57,911 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1469 transitions. Word has length 299 [2024-11-08 11:08:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:08:57,911 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1469 transitions. [2024-11-08 11:08:57,911 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-08 11:08:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1469 transitions. [2024-11-08 11:08:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-08 11:08:57,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:08:57,916 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:08:57,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 11:08:58,117 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-08 11:08:58,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:08:58,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:08:58,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1078107625, now seen corresponding path program 1 times [2024-11-08 11:08:58,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:08:58,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34393091] [2024-11-08 11:08:58,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:58,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:08:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:58,327 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-08 11:08:58,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:08:58,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34393091] [2024-11-08 11:08:58,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34393091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:08:58,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:08:58,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:08:58,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83958243] [2024-11-08 11:08:58,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:08:58,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:08:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:08:58,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:08:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:08:58,331 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-08 11:08:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:08:58,793 INFO L93 Difference]: Finished difference Result 1396 states and 1618 transitions. [2024-11-08 11:08:58,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:08:58,794 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-08 11:08:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:08:58,799 INFO L225 Difference]: With dead ends: 1396 [2024-11-08 11:08:58,799 INFO L226 Difference]: Without dead ends: 1394 [2024-11-08 11:08:58,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:08:58,801 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 128 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:08:58,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 11 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:08:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-08 11:08:58,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1116. [2024-11-08 11:08:58,821 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-08 11:08:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1319 transitions. [2024-11-08 11:08:58,824 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1319 transitions. Word has length 334 [2024-11-08 11:08:58,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:08:58,824 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1319 transitions. [2024-11-08 11:08:58,825 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-08 11:08:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1319 transitions. [2024-11-08 11:08:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-08 11:08:58,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:08:58,831 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:08:58,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:08:58,831 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:08:58,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:08:58,832 INFO L85 PathProgramCache]: Analyzing trace with hash 236282857, now seen corresponding path program 1 times [2024-11-08 11:08:58,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:08:58,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970799407] [2024-11-08 11:08:58,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:08:58,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:08:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:08:59,370 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-08 11:08:59,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:08:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970799407] [2024-11-08 11:08:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970799407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:08:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:08:59,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:08:59,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300210866] [2024-11-08 11:08:59,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:08:59,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:08:59,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:08:59,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:08:59,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:08:59,374 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-08 11:08:59,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:08:59,791 INFO L93 Difference]: Finished difference Result 2089 states and 2492 transitions. [2024-11-08 11:08:59,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:08:59,792 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-08 11:08:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:08:59,793 INFO L225 Difference]: With dead ends: 2089 [2024-11-08 11:08:59,793 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:08:59,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:08:59,795 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 109 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:08:59,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 19 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:08:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:08:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:08:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:08:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:08:59,797 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 355 [2024-11-08 11:08:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:08:59,797 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:08:59,797 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-08 11:08:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:08:59,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:08:59,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:08:59,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:08:59,805 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:08:59,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:08:59,917 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:08:59,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:08:59 BoogieIcfgContainer [2024-11-08 11:08:59,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:08:59,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:08:59,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:08:59,934 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:08:59,935 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:08:49" (3/4) ... [2024-11-08 11:08:59,937 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:08:59,956 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:08:59,957 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:08:59,960 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:08:59,961 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:09:00,098 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:09:00,101 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:09:00,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:09:00,102 INFO L158 Benchmark]: Toolchain (without parser) took 12662.48ms. Allocated memory was 201.3MB in the beginning and 388.0MB in the end (delta: 186.6MB). Free memory was 130.5MB in the beginning and 239.7MB in the end (delta: -109.2MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2024-11-08 11:09:00,102 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 113.2MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:09:00,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.15ms. Allocated memory is still 201.3MB. Free memory was 130.2MB in the beginning and 162.4MB in the end (delta: -32.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 11:09:00,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.65ms. Allocated memory is still 201.3MB. Free memory was 162.4MB in the beginning and 154.4MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 11:09:00,103 INFO L158 Benchmark]: Boogie Preprocessor took 116.28ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 144.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 11:09:00,103 INFO L158 Benchmark]: RCFGBuilder took 1231.14ms. Allocated memory is still 201.3MB. Free memory was 144.0MB in the beginning and 129.6MB in the end (delta: 14.4MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2024-11-08 11:09:00,103 INFO L158 Benchmark]: TraceAbstraction took 10435.39ms. Allocated memory was 201.3MB in the beginning and 388.0MB in the end (delta: 186.6MB). Free memory was 128.5MB in the beginning and 251.2MB in the end (delta: -122.7MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2024-11-08 11:09:00,104 INFO L158 Benchmark]: Witness Printer took 167.62ms. Allocated memory is still 388.0MB. Free memory was 251.2MB in the beginning and 239.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 11:09:00,105 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.23ms. Allocated memory is still 113.2MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.15ms. Allocated memory is still 201.3MB. Free memory was 130.2MB in the beginning and 162.4MB in the end (delta: -32.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.65ms. Allocated memory is still 201.3MB. Free memory was 162.4MB in the beginning and 154.4MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.28ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 144.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1231.14ms. Allocated memory is still 201.3MB. Free memory was 144.0MB in the beginning and 129.6MB in the end (delta: 14.4MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10435.39ms. Allocated memory was 201.3MB in the beginning and 388.0MB in the end (delta: 186.6MB). Free memory was 128.5MB in the beginning and 251.2MB in the end (delta: -122.7MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * Witness Printer took 167.62ms. Allocated memory is still 388.0MB. Free memory was 251.2MB in the beginning and 239.7MB 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: 10.2s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1058 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1058 mSDsluCounter, 595 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 599 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3971 IncrementalHoareTripleChecker+Invalid, 4570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 599 mSolverCounterUnsat, 545 mSDtfsCounter, 3971 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.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.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2636 NumberOfCodeBlocks, 2636 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2623 ConstructedInterpolants, 0 QuantifiedInterpolants, 8871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 817 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 1909/2039 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: ((((((a19 <= 9) && (a10 != 2)) && (14 == a4)) && (a12 == 0)) || (((a10 <= 1) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (7 <= a19)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:09:00,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE