./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label34.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/Problem02_label34.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 e946c16a3da25e9b3a559976cb9b3bd2f39939274bf6ba18ec27980a89869469 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:28:05,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:28:05,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:28:05,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:28:05,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:28:05,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:28:05,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:28:05,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:28:05,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:28:05,266 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:28:05,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:28:05,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:28:05,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:28:05,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:28:05,267 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:28:05,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:28:05,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:28:05,268 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:28:05,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:28:05,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:28:05,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:28:05,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:28:05,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:28:05,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:28:05,275 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:28:05,275 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:28:05,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:28:05,275 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:28:05,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:28:05,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:28:05,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:28:05,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:28:05,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:28:05,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:28:05,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:28:05,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:28:05,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:28:05,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:28:05,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:28:05,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:28:05,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:28:05,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:28:05,278 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 -> e946c16a3da25e9b3a559976cb9b3bd2f39939274bf6ba18ec27980a89869469 [2024-11-08 10:28:05,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:28:05,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:28:05,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:28:05,504 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:28:05,504 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:28:05,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label34.c [2024-11-08 10:28:06,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:28:06,964 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:28:06,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label34.c [2024-11-08 10:28:06,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08960407/990a48f101ef484eb71de7b2e3137722/FLAGae9ec9161 [2024-11-08 10:28:07,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08960407/990a48f101ef484eb71de7b2e3137722 [2024-11-08 10:28:07,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:28:07,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:28:07,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:28:07,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:28:07,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:28:07,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c12d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07, skipping insertion in model container [2024-11-08 10:28:07,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:28:07,553 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/Problem02_label34.c[16560,16573] [2024-11-08 10:28:07,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:28:07,591 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:28:07,652 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/Problem02_label34.c[16560,16573] [2024-11-08 10:28:07,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:28:07,684 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:28:07,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07 WrapperNode [2024-11-08 10:28:07,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:28:07,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:28:07,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:28:07,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:28:07,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,736 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-08 10:28:07,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:28:07,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:28:07,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:28:07,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:28:07,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,781 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:28:07,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:28:07,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:28:07,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:28:07,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:28:07,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (1/1) ... [2024-11-08 10:28:07,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:28:07,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:28:07,854 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:28:07,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:28:07,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:28:07,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:28:07,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:28:07,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:28:07,948 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:28:07,949 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:28:08,623 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 10:28:08,623 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:28:08,641 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:28:08,642 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:28:08,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:08 BoogieIcfgContainer [2024-11-08 10:28:08,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:28:08,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:28:08,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:28:08,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:28:08,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:28:07" (1/3) ... [2024-11-08 10:28:08,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc61a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:28:08, skipping insertion in model container [2024-11-08 10:28:08,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:07" (2/3) ... [2024-11-08 10:28:08,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc61a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:28:08, skipping insertion in model container [2024-11-08 10:28:08,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:08" (3/3) ... [2024-11-08 10:28:08,650 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label34.c [2024-11-08 10:28:08,662 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:28:08,662 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:28:08,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:28:08,715 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;@4a0fdb08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:28:08,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:28:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 10:28:08,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:08,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:08,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:08,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1560294413, now seen corresponding path program 1 times [2024-11-08 10:28:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:08,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244108560] [2024-11-08 10:28:08,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:09,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:09,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244108560] [2024-11-08 10:28:09,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244108560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:09,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:09,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:09,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097893752] [2024-11-08 10:28:09,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:09,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:09,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:09,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:09,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:09,188 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:09,795 INFO L93 Difference]: Finished difference Result 596 states and 1030 transitions. [2024-11-08 10:28:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:09,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-08 10:28:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:09,808 INFO L225 Difference]: With dead ends: 596 [2024-11-08 10:28:09,809 INFO L226 Difference]: Without dead ends: 305 [2024-11-08 10:28:09,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:09,814 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 146 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:09,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 89 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:28:09,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-08 10:28:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-08 10:28:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions. [2024-11-08 10:28:09,862 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 98 [2024-11-08 10:28:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:09,863 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 464 transitions. [2024-11-08 10:28:09,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2024-11-08 10:28:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 10:28:09,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:09,868 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:09,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:28:09,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:09,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:09,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1204746313, now seen corresponding path program 1 times [2024-11-08 10:28:09,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:09,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991640196] [2024-11-08 10:28:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:09,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:09,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991640196] [2024-11-08 10:28:09,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991640196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:09,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:09,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:09,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571405975] [2024-11-08 10:28:09,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:09,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:09,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:09,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:09,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:09,992 INFO L87 Difference]: Start difference. First operand 305 states and 464 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:10,361 INFO L93 Difference]: Finished difference Result 902 states and 1375 transitions. [2024-11-08 10:28:10,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:10,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-08 10:28:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:10,364 INFO L225 Difference]: With dead ends: 902 [2024-11-08 10:28:10,364 INFO L226 Difference]: Without dead ends: 599 [2024-11-08 10:28:10,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:10,366 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 193 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:10,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 71 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:28:10,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-08 10:28:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2024-11-08 10:28:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.477310924369748) internal successors, (879), 595 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 879 transitions. [2024-11-08 10:28:10,394 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 879 transitions. Word has length 109 [2024-11-08 10:28:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:10,394 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 879 transitions. [2024-11-08 10:28:10,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 879 transitions. [2024-11-08 10:28:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 10:28:10,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:10,398 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:10,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:28:10,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:10,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:10,399 INFO L85 PathProgramCache]: Analyzing trace with hash 187337406, now seen corresponding path program 1 times [2024-11-08 10:28:10,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:10,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973667950] [2024-11-08 10:28:10,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:10,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:28:10,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:10,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973667950] [2024-11-08 10:28:10,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973667950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:10,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:10,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:10,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716261650] [2024-11-08 10:28:10,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:10,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:10,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:10,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:10,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:10,512 INFO L87 Difference]: Start difference. First operand 596 states and 879 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:10,682 INFO L93 Difference]: Finished difference Result 1040 states and 1541 transitions. [2024-11-08 10:28:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:10,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 113 [2024-11-08 10:28:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:10,684 INFO L225 Difference]: With dead ends: 1040 [2024-11-08 10:28:10,684 INFO L226 Difference]: Without dead ends: 446 [2024-11-08 10:28:10,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:10,686 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:10,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 23 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:28:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-08 10:28:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2024-11-08 10:28:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.4247191011235956) internal successors, (634), 445 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 634 transitions. [2024-11-08 10:28:10,699 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 634 transitions. Word has length 113 [2024-11-08 10:28:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:10,699 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 634 transitions. [2024-11-08 10:28:10,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 634 transitions. [2024-11-08 10:28:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 10:28:10,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:10,701 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:10,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:28:10,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:10,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:10,702 INFO L85 PathProgramCache]: Analyzing trace with hash 255747534, now seen corresponding path program 1 times [2024-11-08 10:28:10,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:10,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722894792] [2024-11-08 10:28:10,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:10,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:10,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:10,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722894792] [2024-11-08 10:28:10,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722894792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:10,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:10,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:10,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389032696] [2024-11-08 10:28:10,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:10,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:10,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:10,795 INFO L87 Difference]: Start difference. First operand 446 states and 634 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:11,091 INFO L93 Difference]: Finished difference Result 1326 states and 1888 transitions. [2024-11-08 10:28:11,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:11,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-08 10:28:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:11,094 INFO L225 Difference]: With dead ends: 1326 [2024-11-08 10:28:11,094 INFO L226 Difference]: Without dead ends: 882 [2024-11-08 10:28:11,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:11,096 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 148 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:11,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 82 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:28:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-08 10:28:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 875. [2024-11-08 10:28:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 1.3729977116704806) internal successors, (1200), 874 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1200 transitions. [2024-11-08 10:28:11,113 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1200 transitions. Word has length 116 [2024-11-08 10:28:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:11,113 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1200 transitions. [2024-11-08 10:28:11,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:11,114 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1200 transitions. [2024-11-08 10:28:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 10:28:11,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:11,115 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:11,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:28:11,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:11,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:11,117 INFO L85 PathProgramCache]: Analyzing trace with hash -989588039, now seen corresponding path program 1 times [2024-11-08 10:28:11,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:11,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492395305] [2024-11-08 10:28:11,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:11,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:11,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492395305] [2024-11-08 10:28:11,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492395305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:11,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:11,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39004130] [2024-11-08 10:28:11,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:11,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:11,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:11,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:11,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:11,217 INFO L87 Difference]: Start difference. First operand 875 states and 1200 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:11,541 INFO L93 Difference]: Finished difference Result 2310 states and 3170 transitions. [2024-11-08 10:28:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:11,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-11-08 10:28:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:11,545 INFO L225 Difference]: With dead ends: 2310 [2024-11-08 10:28:11,545 INFO L226 Difference]: Without dead ends: 1437 [2024-11-08 10:28:11,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:11,547 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 142 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:11,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 58 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:28:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2024-11-08 10:28:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1437. [2024-11-08 10:28:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1436 states have (on average 1.2987465181058495) internal successors, (1865), 1436 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1865 transitions. [2024-11-08 10:28:11,571 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1865 transitions. Word has length 120 [2024-11-08 10:28:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:11,572 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1865 transitions. [2024-11-08 10:28:11,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1865 transitions. [2024-11-08 10:28:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 10:28:11,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:11,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:11,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:28:11,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:11,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash -260349180, now seen corresponding path program 1 times [2024-11-08 10:28:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764099153] [2024-11-08 10:28:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:11,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:11,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764099153] [2024-11-08 10:28:11,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764099153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:11,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:11,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:11,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519495040] [2024-11-08 10:28:11,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:11,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:11,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:11,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:11,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:11,641 INFO L87 Difference]: Start difference. First operand 1437 states and 1865 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:11,968 INFO L93 Difference]: Finished difference Result 3992 states and 5180 transitions. [2024-11-08 10:28:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:11,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-11-08 10:28:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:11,975 INFO L225 Difference]: With dead ends: 3992 [2024-11-08 10:28:11,975 INFO L226 Difference]: Without dead ends: 2557 [2024-11-08 10:28:11,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:11,977 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 157 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:11,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 61 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:28:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2024-11-08 10:28:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2277. [2024-11-08 10:28:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2276 states have (on average 1.2324253075571177) internal successors, (2805), 2276 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 2805 transitions. [2024-11-08 10:28:12,014 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 2805 transitions. Word has length 120 [2024-11-08 10:28:12,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:12,015 INFO L471 AbstractCegarLoop]: Abstraction has 2277 states and 2805 transitions. [2024-11-08 10:28:12,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2805 transitions. [2024-11-08 10:28:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 10:28:12,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:12,017 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:12,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:28:12,018 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:12,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1779451982, now seen corresponding path program 1 times [2024-11-08 10:28:12,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:12,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437542547] [2024-11-08 10:28:12,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:12,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:28:12,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:12,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437542547] [2024-11-08 10:28:12,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437542547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:12,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:12,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:12,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103237173] [2024-11-08 10:28:12,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:12,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:12,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:12,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:12,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:12,068 INFO L87 Difference]: Start difference. First operand 2277 states and 2805 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:12,358 INFO L93 Difference]: Finished difference Result 4411 states and 5432 transitions. [2024-11-08 10:28:12,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:12,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 10:28:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:12,364 INFO L225 Difference]: With dead ends: 4411 [2024-11-08 10:28:12,364 INFO L226 Difference]: Without dead ends: 2136 [2024-11-08 10:28:12,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:12,368 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 156 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:12,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 247 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:28:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2024-11-08 10:28:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1990. [2024-11-08 10:28:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1989 states have (on average 1.1759678230266466) internal successors, (2339), 1989 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2339 transitions. [2024-11-08 10:28:12,391 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2339 transitions. Word has length 125 [2024-11-08 10:28:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:12,391 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 2339 transitions. [2024-11-08 10:28:12,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2339 transitions. [2024-11-08 10:28:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 10:28:12,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:12,394 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:12,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:28:12,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:12,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:12,394 INFO L85 PathProgramCache]: Analyzing trace with hash -503040049, now seen corresponding path program 1 times [2024-11-08 10:28:12,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:12,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139062207] [2024-11-08 10:28:12,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:12,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 10:28:12,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:12,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139062207] [2024-11-08 10:28:12,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139062207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:12,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:12,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152924992] [2024-11-08 10:28:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:12,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:12,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:12,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:12,497 INFO L87 Difference]: Start difference. First operand 1990 states and 2339 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:12,821 INFO L93 Difference]: Finished difference Result 3976 states and 4675 transitions. [2024-11-08 10:28:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 10:28:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:12,824 INFO L225 Difference]: With dead ends: 3976 [2024-11-08 10:28:12,824 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:28:12,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:12,828 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 63 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:12,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 207 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:28:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:28:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:28:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:28:12,831 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2024-11-08 10:28:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:12,832 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:28:12,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:28:12,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:28:12,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:28:12,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:28:12,838 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:12,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:28:12,933 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:28:12,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:28:12 BoogieIcfgContainer [2024-11-08 10:28:12,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:28:12,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:28:12,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:28:12,947 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:28:12,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:08" (3/4) ... [2024-11-08 10:28:12,949 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:28:12,965 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:28:12,966 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:28:12,966 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:28:12,967 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:28:13,088 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:28:13,088 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:28:13,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:28:13,089 INFO L158 Benchmark]: Toolchain (without parser) took 5832.12ms. Allocated memory was 176.2MB in the beginning and 287.3MB in the end (delta: 111.1MB). Free memory was 141.5MB in the beginning and 176.2MB in the end (delta: -34.7MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. [2024-11-08 10:28:13,091 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:28:13,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.30ms. Allocated memory is still 176.2MB. Free memory was 141.5MB in the beginning and 112.7MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 10:28:13,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.08ms. Allocated memory is still 176.2MB. Free memory was 112.7MB in the beginning and 106.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:28:13,092 INFO L158 Benchmark]: Boogie Preprocessor took 86.03ms. Allocated memory is still 176.2MB. Free memory was 106.9MB in the beginning and 102.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 10:28:13,092 INFO L158 Benchmark]: RCFGBuilder took 818.26ms. Allocated memory is still 176.2MB. Free memory was 101.6MB in the beginning and 85.4MB in the end (delta: 16.2MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-11-08 10:28:13,092 INFO L158 Benchmark]: TraceAbstraction took 4301.22ms. Allocated memory was 176.2MB in the beginning and 287.3MB in the end (delta: 111.1MB). Free memory was 84.6MB in the beginning and 188.8MB in the end (delta: -104.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-08 10:28:13,092 INFO L158 Benchmark]: Witness Printer took 142.34ms. Allocated memory is still 287.3MB. Free memory was 188.8MB in the beginning and 176.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:28:13,093 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.16ms. Allocated memory is still 176.2MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.30ms. Allocated memory is still 176.2MB. Free memory was 141.5MB in the beginning and 112.7MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.08ms. Allocated memory is still 176.2MB. Free memory was 112.7MB in the beginning and 106.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.03ms. Allocated memory is still 176.2MB. Free memory was 106.9MB in the beginning and 102.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 818.26ms. Allocated memory is still 176.2MB. Free memory was 101.6MB in the beginning and 85.4MB in the end (delta: 16.2MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4301.22ms. Allocated memory was 176.2MB in the beginning and 287.3MB in the end (delta: 111.1MB). Free memory was 84.6MB in the beginning and 188.8MB in the end (delta: -104.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Witness Printer took 142.34ms. Allocated memory is still 287.3MB. Free memory was 188.8MB in the beginning and 176.2MB in the end (delta: 12.6MB). 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: 476]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1205 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1205 mSDsluCounter, 838 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 473 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2713 IncrementalHoareTripleChecker+Invalid, 3186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 473 mSolverCounterUnsat, 732 mSDtfsCounter, 2713 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2277occurred in iteration=6, InterpolantAutomatonStates: 24, 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, 8 MinimizatonAttempts, 436 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 926 NumberOfCodeBlocks, 926 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 918 ConstructedInterpolants, 0 QuantifiedInterpolants, 1480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 160/160 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: 616]: Loop Invariant Derived loop invariant: (((((a17 == 8) && (a25 == 1)) || ((a17 == 8) && (a25 <= 0))) || (((10 <= a28) && (a17 <= 8)) && (a25 <= 0))) || (((a25 == 1) && (a28 <= 9)) && (a17 <= 8))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:28:13,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE