./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/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-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:19:56,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:19:56,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:19:56,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:19:56,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:19:56,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:19:56,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:19:56,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:19:56,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:19:56,720 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:19:56,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:19:56,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:19:56,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:19:56,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:19:56,722 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:19:56,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:19:56,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:19:56,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:19:56,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:19:56,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:19:56,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:19:56,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:19:56,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:19:56,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:19:56,724 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:19:56,725 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:19:56,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:19:56,725 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:19:56,725 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:19:56,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:19:56,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:19:56,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:19:56,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:19:56,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:19:56,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:19:56,727 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:19:56,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:19:56,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:19:56,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:19:56,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:19:56,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:19:56,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:19:56,729 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-21 21:19:56,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:19:56,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:19:56,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:19:56,992 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:19:56,992 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:19:56,993 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-21 21:19:58,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:19:58,437 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:19:58,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label34.c [2024-11-21 21:19:58,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da8aeb5b5/61afd3ffe13c45a69ad8511fce3ab7e3/FLAG7fe3f0ee5 [2024-11-21 21:19:58,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da8aeb5b5/61afd3ffe13c45a69ad8511fce3ab7e3 [2024-11-21 21:19:58,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:19:58,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:19:58,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:19:58,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:19:58,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:19:58,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:19:58" (1/1) ... [2024-11-21 21:19:58,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a738e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:58, skipping insertion in model container [2024-11-21 21:19:58,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:19:58" (1/1) ... [2024-11-21 21:19:58,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:19:59,056 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-21 21:19:59,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:19:59,100 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:19:59,158 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-21 21:19:59,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:19:59,183 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:19:59,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59 WrapperNode [2024-11-21 21:19:59,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:19:59,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:19:59,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:19:59,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:19:59,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (1/1) ... [2024-11-21 21:19:59,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (1/1) ... [2024-11-21 21:19:59,251 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-21 21:19:59,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:19:59,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:19:59,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:19:59,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:19:59,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (1/1) ... [2024-11-21 21:19:59,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (1/1) ... [2024-11-21 21:19:59,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (1/1) ... [2024-11-21 21:19:59,295 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-21 21:19:59,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (1/1) ... [2024-11-21 21:19:59,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (1/1) ... [2024-11-21 21:19:59,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (1/1) ... [2024-11-21 21:19:59,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (1/1) ... [2024-11-21 21:19:59,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (1/1) ... [2024-11-21 21:19:59,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (1/1) ... [2024-11-21 21:19:59,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:19:59,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:19:59,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:19:59,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:19:59,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (1/1) ... [2024-11-21 21:19:59,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:19:59,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:19:59,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 21:19:59,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 21:19:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:19:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:19:59,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:19:59,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:19:59,510 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:19:59,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:20:00,124 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-21 21:20:00,124 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:20:00,146 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:20:00,146 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 21:20:00,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:20:00 BoogieIcfgContainer [2024-11-21 21:20:00,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:20:00,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:20:00,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:20:00,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:20:00,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:19:58" (1/3) ... [2024-11-21 21:20:00,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274905e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:20:00, skipping insertion in model container [2024-11-21 21:20:00,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:59" (2/3) ... [2024-11-21 21:20:00,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274905e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:20:00, skipping insertion in model container [2024-11-21 21:20:00,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:20:00" (3/3) ... [2024-11-21 21:20:00,155 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label34.c [2024-11-21 21:20:00,168 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:20:00,168 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:20:00,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:20:00,220 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;@5d396173, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:20:00,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:20:00,225 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-21 21:20:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-21 21:20:00,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:00,235 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-21 21:20:00,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:00,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1560294413, now seen corresponding path program 1 times [2024-11-21 21:20:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:00,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183839959] [2024-11-21 21:20:00,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:20:00,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:00,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183839959] [2024-11-21 21:20:00,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183839959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:00,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:00,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:20:00,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439680143] [2024-11-21 21:20:00,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:00,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:00,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:00,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:00,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:00,704 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-21 21:20:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:01,350 INFO L93 Difference]: Finished difference Result 596 states and 1030 transitions. [2024-11-21 21:20:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:01,353 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-21 21:20:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:01,362 INFO L225 Difference]: With dead ends: 596 [2024-11-21 21:20:01,362 INFO L226 Difference]: Without dead ends: 305 [2024-11-21 21:20:01,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-21 21:20:01,368 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 146 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-21 21:20:01,368 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-21 21:20:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-21 21:20:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-21 21:20:01,418 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-21 21:20:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions. [2024-11-21 21:20:01,420 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 98 [2024-11-21 21:20:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:01,421 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 464 transitions. [2024-11-21 21:20:01,421 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-21 21:20:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2024-11-21 21:20:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-21 21:20:01,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:01,425 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-21 21:20:01,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 21:20:01,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:01,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1204746313, now seen corresponding path program 1 times [2024-11-21 21:20:01,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:01,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472115124] [2024-11-21 21:20:01,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:01,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:01,636 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-21 21:20:01,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:01,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472115124] [2024-11-21 21:20:01,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472115124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:01,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:01,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:20:01,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414138940] [2024-11-21 21:20:01,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:01,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:01,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:01,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:01,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:01,642 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-21 21:20:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:02,174 INFO L93 Difference]: Finished difference Result 902 states and 1375 transitions. [2024-11-21 21:20:02,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:02,174 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-21 21:20:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:02,177 INFO L225 Difference]: With dead ends: 902 [2024-11-21 21:20:02,177 INFO L226 Difference]: Without dead ends: 599 [2024-11-21 21:20:02,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:02,179 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 193 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:02,179 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.5s Time] [2024-11-21 21:20:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-21 21:20:02,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2024-11-21 21:20:02,202 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-21 21:20:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 879 transitions. [2024-11-21 21:20:02,204 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 879 transitions. Word has length 109 [2024-11-21 21:20:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:02,204 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 879 transitions. [2024-11-21 21:20:02,204 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-21 21:20:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 879 transitions. [2024-11-21 21:20:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-21 21:20:02,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:02,209 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-21 21:20:02,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:20:02,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:02,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:02,210 INFO L85 PathProgramCache]: Analyzing trace with hash 187337406, now seen corresponding path program 1 times [2024-11-21 21:20:02,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:02,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180527787] [2024-11-21 21:20:02,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:02,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:02,365 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-21 21:20:02,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:02,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180527787] [2024-11-21 21:20:02,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180527787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:02,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:02,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:20:02,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977200025] [2024-11-21 21:20:02,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:02,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:02,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:02,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:02,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:02,367 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-21 21:20:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:02,646 INFO L93 Difference]: Finished difference Result 1040 states and 1541 transitions. [2024-11-21 21:20:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:02,650 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-21 21:20:02,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:02,652 INFO L225 Difference]: With dead ends: 1040 [2024-11-21 21:20:02,652 INFO L226 Difference]: Without dead ends: 446 [2024-11-21 21:20:02,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:02,654 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:02,654 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.3s Time] [2024-11-21 21:20:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-21 21:20:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2024-11-21 21:20:02,664 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-21 21:20:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 634 transitions. [2024-11-21 21:20:02,665 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 634 transitions. Word has length 113 [2024-11-21 21:20:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:02,665 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 634 transitions. [2024-11-21 21:20:02,665 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-21 21:20:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 634 transitions. [2024-11-21 21:20:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-21 21:20:02,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:02,669 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-21 21:20:02,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:20:02,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:02,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:02,670 INFO L85 PathProgramCache]: Analyzing trace with hash 255747534, now seen corresponding path program 1 times [2024-11-21 21:20:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:02,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502879049] [2024-11-21 21:20:02,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:02,743 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-21 21:20:02,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502879049] [2024-11-21 21:20:02,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502879049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:02,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:02,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:20:02,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348402008] [2024-11-21 21:20:02,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:02,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:02,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:02,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:02,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:02,746 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-21 21:20:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:03,165 INFO L93 Difference]: Finished difference Result 1326 states and 1888 transitions. [2024-11-21 21:20:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:03,166 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-21 21:20:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:03,170 INFO L225 Difference]: With dead ends: 1326 [2024-11-21 21:20:03,170 INFO L226 Difference]: Without dead ends: 882 [2024-11-21 21:20:03,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:03,173 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 148 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:03,175 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.4s Time] [2024-11-21 21:20:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-21 21:20:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 875. [2024-11-21 21:20:03,191 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-21 21:20:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1200 transitions. [2024-11-21 21:20:03,193 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1200 transitions. Word has length 116 [2024-11-21 21:20:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:03,194 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1200 transitions. [2024-11-21 21:20:03,195 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-21 21:20:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1200 transitions. [2024-11-21 21:20:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-21 21:20:03,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:03,200 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-21 21:20:03,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 21:20:03,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:03,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash -989588039, now seen corresponding path program 1 times [2024-11-21 21:20:03,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:03,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496604399] [2024-11-21 21:20:03,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:03,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:03,311 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-21 21:20:03,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:03,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496604399] [2024-11-21 21:20:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496604399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:03,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:03,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:03,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140327272] [2024-11-21 21:20:03,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:03,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:03,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:03,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:03,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:03,314 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-21 21:20:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:03,872 INFO L93 Difference]: Finished difference Result 2310 states and 3170 transitions. [2024-11-21 21:20:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:03,873 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-21 21:20:03,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:03,876 INFO L225 Difference]: With dead ends: 2310 [2024-11-21 21:20:03,876 INFO L226 Difference]: Without dead ends: 1437 [2024-11-21 21:20:03,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:03,879 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 142 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:03,879 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.5s Time] [2024-11-21 21:20:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2024-11-21 21:20:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1437. [2024-11-21 21:20:03,894 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-21 21:20:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1865 transitions. [2024-11-21 21:20:03,896 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1865 transitions. Word has length 120 [2024-11-21 21:20:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:03,897 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1865 transitions. [2024-11-21 21:20:03,897 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-21 21:20:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1865 transitions. [2024-11-21 21:20:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-21 21:20:03,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:03,899 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-21 21:20:03,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 21:20:03,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:03,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash -260349180, now seen corresponding path program 1 times [2024-11-21 21:20:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991129025] [2024-11-21 21:20:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:03,954 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-21 21:20:03,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:03,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991129025] [2024-11-21 21:20:03,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991129025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:03,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:20:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222747573] [2024-11-21 21:20:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:03,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:03,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:03,956 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-21 21:20:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:04,298 INFO L93 Difference]: Finished difference Result 3992 states and 5180 transitions. [2024-11-21 21:20:04,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:04,298 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-21 21:20:04,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:04,304 INFO L225 Difference]: With dead ends: 3992 [2024-11-21 21:20:04,304 INFO L226 Difference]: Without dead ends: 2557 [2024-11-21 21:20:04,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:04,306 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-21 21:20:04,306 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-21 21:20:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2024-11-21 21:20:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2277. [2024-11-21 21:20:04,331 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-21 21:20:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 2805 transitions. [2024-11-21 21:20:04,356 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 2805 transitions. Word has length 120 [2024-11-21 21:20:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:04,356 INFO L471 AbstractCegarLoop]: Abstraction has 2277 states and 2805 transitions. [2024-11-21 21:20:04,356 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-21 21:20:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2805 transitions. [2024-11-21 21:20:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-21 21:20:04,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:04,358 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-21 21:20:04,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 21:20:04,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:04,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:04,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1779451982, now seen corresponding path program 1 times [2024-11-21 21:20:04,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:04,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452474160] [2024-11-21 21:20:04,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:04,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:04,407 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-21 21:20:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:04,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452474160] [2024-11-21 21:20:04,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452474160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:04,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:04,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523076804] [2024-11-21 21:20:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:04,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:04,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:04,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:04,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:04,409 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-21 21:20:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:04,718 INFO L93 Difference]: Finished difference Result 4411 states and 5432 transitions. [2024-11-21 21:20:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:04,718 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-21 21:20:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:04,723 INFO L225 Difference]: With dead ends: 4411 [2024-11-21 21:20:04,723 INFO L226 Difference]: Without dead ends: 2136 [2024-11-21 21:20:04,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:04,726 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-21 21:20:04,726 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-21 21:20:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2024-11-21 21:20:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1990. [2024-11-21 21:20:04,746 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-21 21:20:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2339 transitions. [2024-11-21 21:20:04,748 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2339 transitions. Word has length 125 [2024-11-21 21:20:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:04,748 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 2339 transitions. [2024-11-21 21:20:04,749 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-21 21:20:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2339 transitions. [2024-11-21 21:20:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-21 21:20:04,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:04,751 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-21 21:20:04,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 21:20:04,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:04,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -503040049, now seen corresponding path program 1 times [2024-11-21 21:20:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:04,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884545243] [2024-11-21 21:20:04,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:04,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:04,845 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-21 21:20:04,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884545243] [2024-11-21 21:20:04,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884545243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:04,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:04,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:04,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469952341] [2024-11-21 21:20:04,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:04,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:04,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:04,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:04,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:04,848 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-21 21:20:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:05,213 INFO L93 Difference]: Finished difference Result 3976 states and 4675 transitions. [2024-11-21 21:20:05,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:05,214 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-21 21:20:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:05,215 INFO L225 Difference]: With dead ends: 3976 [2024-11-21 21:20:05,215 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 21:20:05,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:05,218 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 63 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-21 21:20:05,219 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-21 21:20:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 21:20:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 21:20:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:20:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 21:20:05,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2024-11-21 21:20:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:05,220 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 21:20:05,220 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-21 21:20:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 21:20:05,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 21:20:05,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 21:20:05,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 21:20:05,226 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:05,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 21:20:05,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 21:20:05,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:20:05 BoogieIcfgContainer [2024-11-21 21:20:05,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 21:20:05,338 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 21:20:05,338 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 21:20:05,338 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 21:20:05,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:20:00" (3/4) ... [2024-11-21 21:20:05,340 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 21:20:05,350 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 21:20:05,351 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 21:20:05,352 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 21:20:05,352 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 21:20:05,447 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 21:20:05,447 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 21:20:05,447 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 21:20:05,448 INFO L158 Benchmark]: Toolchain (without parser) took 6648.83ms. Allocated memory was 146.8MB in the beginning and 276.8MB in the end (delta: 130.0MB). Free memory was 95.0MB in the beginning and 163.9MB in the end (delta: -68.8MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-11-21 21:20:05,448 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 111.1MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:20:05,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.59ms. Allocated memory is still 146.8MB. Free memory was 95.0MB in the beginning and 66.3MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-21 21:20:05,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.49ms. Allocated memory is still 146.8MB. Free memory was 66.3MB in the beginning and 61.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 21:20:05,448 INFO L158 Benchmark]: Boogie Preprocessor took 120.43ms. Allocated memory is still 146.8MB. Free memory was 61.2MB in the beginning and 113.5MB in the end (delta: -52.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-21 21:20:05,449 INFO L158 Benchmark]: RCFGBuilder took 769.94ms. Allocated memory is still 146.8MB. Free memory was 113.5MB in the beginning and 94.2MB in the end (delta: 19.3MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2024-11-21 21:20:05,449 INFO L158 Benchmark]: TraceAbstraction took 5189.43ms. Allocated memory was 146.8MB in the beginning and 276.8MB in the end (delta: 130.0MB). Free memory was 93.2MB in the beginning and 176.4MB in the end (delta: -83.2MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-11-21 21:20:05,449 INFO L158 Benchmark]: Witness Printer took 109.40ms. Allocated memory is still 276.8MB. Free memory was 176.4MB in the beginning and 163.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 21:20:05,450 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.13ms. Allocated memory is still 111.1MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.59ms. Allocated memory is still 146.8MB. Free memory was 95.0MB in the beginning and 66.3MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.49ms. Allocated memory is still 146.8MB. Free memory was 66.3MB in the beginning and 61.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.43ms. Allocated memory is still 146.8MB. Free memory was 61.2MB in the beginning and 113.5MB in the end (delta: -52.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * RCFGBuilder took 769.94ms. Allocated memory is still 146.8MB. Free memory was 113.5MB in the beginning and 94.2MB in the end (delta: 19.3MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5189.43ms. Allocated memory was 146.8MB in the beginning and 276.8MB in the end (delta: 130.0MB). Free memory was 93.2MB in the beginning and 176.4MB in the end (delta: -83.2MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Witness Printer took 109.40ms. Allocated memory is still 276.8MB. Free memory was 176.4MB in the beginning and 163.9MB in the end (delta: 12.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: 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: 5.0s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1205 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1205 mSDsluCounter, 838 SdHoareTripleChecker+Invalid, 2.6s 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.8s 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-21 21:20:05,465 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