./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_label03.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 1418b02b8b2f5990b796a4d39288b2acbdc5bc3cef26e1456ee8caff9c24da11 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:37:58,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:37:58,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 09:37:58,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:37:58,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:37:58,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:37:58,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:37:58,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:37:58,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:37:58,200 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:37:58,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:37:58,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:37:58,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:37:58,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:37:58,202 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:37:58,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:37:58,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:37:58,204 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:37:58,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 09:37:58,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:37:58,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:37:58,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:37:58,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:37:58,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:37:58,210 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:37:58,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:37:58,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:37:58,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:37:58,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:37:58,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:37:58,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:37:58,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:37:58,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:37:58,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:37:58,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:37:58,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:37:58,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 09:37:58,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 09:37:58,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:37:58,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:37:58,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:37:58,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:37:58,219 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 -> 1418b02b8b2f5990b796a4d39288b2acbdc5bc3cef26e1456ee8caff9c24da11 [2024-11-18 09:37:58,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:37:58,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:37:58,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:37:58,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:37:58,483 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:37:58,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label03.c [2024-11-18 09:37:59,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:38:00,258 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:38:00,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label03.c [2024-11-18 09:38:00,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14cfcb937/3e6632cbec1144178181bd672397bac5/FLAG10357240d [2024-11-18 09:38:00,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14cfcb937/3e6632cbec1144178181bd672397bac5 [2024-11-18 09:38:00,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:38:00,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:38:00,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:38:00,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:38:00,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:38:00,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:00,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3205fe03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00, skipping insertion in model container [2024-11-18 09:38:00,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:00,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:38:00,689 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_label03.c[20079,20092] [2024-11-18 09:38:00,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:38:00,738 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:38:00,834 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_label03.c[20079,20092] [2024-11-18 09:38:00,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:38:00,866 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:38:00,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00 WrapperNode [2024-11-18 09:38:00,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:38:00,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:38:00,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:38:00,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:38:00,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:00,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:00,935 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-18 09:38:00,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:38:00,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:38:00,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:38:00,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:38:00,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:00,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:00,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:00,979 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-18 09:38:00,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:00,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:00,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:01,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:01,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:01,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:01,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:38:01,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:38:01,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:38:01,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:38:01,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (1/1) ... [2024-11-18 09:38:01,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:38:01,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:38:01,070 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-18 09:38:01,077 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-18 09:38:01,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:38:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 09:38:01,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:38:01,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:38:01,204 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:38:01,206 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:38:02,166 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-18 09:38:02,166 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:38:02,190 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:38:02,192 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 09:38:02,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:38:02 BoogieIcfgContainer [2024-11-18 09:38:02,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:38:02,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:38:02,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:38:02,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:38:02,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:38:00" (1/3) ... [2024-11-18 09:38:02,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2735f17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:38:02, skipping insertion in model container [2024-11-18 09:38:02,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:00" (2/3) ... [2024-11-18 09:38:02,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2735f17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:38:02, skipping insertion in model container [2024-11-18 09:38:02,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:38:02" (3/3) ... [2024-11-18 09:38:02,202 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label03.c [2024-11-18 09:38:02,218 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:38:02,219 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:38:02,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:38:02,290 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;@47555086, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:38:02,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:38:02,295 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-18 09:38:02,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-18 09:38:02,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:02,309 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, 1, 1, 1, 1, 1, 1, 1, 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-18 09:38:02,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:02,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2099114005, now seen corresponding path program 1 times [2024-11-18 09:38:02,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:02,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595509412] [2024-11-18 09:38:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:02,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:02,976 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-18 09:38:02,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:02,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595509412] [2024-11-18 09:38:02,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595509412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:02,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:02,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:38:02,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104245725] [2024-11-18 09:38:02,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:02,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:02,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:03,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:03,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:03,018 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 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-18 09:38:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:03,774 INFO L93 Difference]: Finished difference Result 600 states and 1037 transitions. [2024-11-18 09:38:03,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:03,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 129 [2024-11-18 09:38:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:03,786 INFO L225 Difference]: With dead ends: 600 [2024-11-18 09:38:03,787 INFO L226 Difference]: Without dead ends: 309 [2024-11-18 09:38:03,790 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-18 09:38:03,792 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 37 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:03,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 09:38:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-18 09:38:03,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-18 09:38:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 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-18 09:38:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2024-11-18 09:38:03,835 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 129 [2024-11-18 09:38:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:03,836 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2024-11-18 09:38:03,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-18 09:38:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2024-11-18 09:38:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-18 09:38:03,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:03,840 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:38:03,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 09:38:03,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:03,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash -875261376, now seen corresponding path program 1 times [2024-11-18 09:38:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:03,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366805319] [2024-11-18 09:38:03,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:04,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:04,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366805319] [2024-11-18 09:38:04,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366805319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:04,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:04,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:04,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740848422] [2024-11-18 09:38:04,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:04,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:04,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:04,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:04,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:04,125 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-18 09:38:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:04,549 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2024-11-18 09:38:04,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:04,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 134 [2024-11-18 09:38:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:04,553 INFO L225 Difference]: With dead ends: 758 [2024-11-18 09:38:04,554 INFO L226 Difference]: Without dead ends: 453 [2024-11-18 09:38:04,555 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-18 09:38:04,556 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 35 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:04,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 248 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:04,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-18 09:38:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2024-11-18 09:38:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 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-18 09:38:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions. [2024-11-18 09:38:04,592 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 134 [2024-11-18 09:38:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:04,594 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 578 transitions. [2024-11-18 09:38:04,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-18 09:38:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2024-11-18 09:38:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 09:38:04,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:04,602 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:38:04,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 09:38:04,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:04,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1717580827, now seen corresponding path program 1 times [2024-11-18 09:38:04,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:04,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065529140] [2024-11-18 09:38:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:04,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065529140] [2024-11-18 09:38:04,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065529140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:04,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:38:04,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835500605] [2024-11-18 09:38:04,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:04,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:04,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:04,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:04,722 INFO L87 Difference]: Start difference. First operand 453 states and 578 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-18 09:38:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:05,157 INFO L93 Difference]: Finished difference Result 1325 states and 1691 transitions. [2024-11-18 09:38:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:05,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 146 [2024-11-18 09:38:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:05,167 INFO L225 Difference]: With dead ends: 1325 [2024-11-18 09:38:05,167 INFO L226 Difference]: Without dead ends: 874 [2024-11-18 09:38:05,170 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-18 09:38:05,171 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 185 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:05,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-18 09:38:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-18 09:38:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.2302405498281788) internal successors, (1074), 873 states have internal predecessors, (1074), 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-18 09:38:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1074 transitions. [2024-11-18 09:38:05,214 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1074 transitions. Word has length 146 [2024-11-18 09:38:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:05,215 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1074 transitions. [2024-11-18 09:38:05,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-18 09:38:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1074 transitions. [2024-11-18 09:38:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-18 09:38:05,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:05,218 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:38:05,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 09:38:05,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:05,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1257335336, now seen corresponding path program 1 times [2024-11-18 09:38:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:05,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885119406] [2024-11-18 09:38:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:05,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:05,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:05,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885119406] [2024-11-18 09:38:05,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885119406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:05,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:05,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524524695] [2024-11-18 09:38:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:05,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:05,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:05,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:05,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:05,390 INFO L87 Difference]: Start difference. First operand 874 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-18 09:38:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:05,856 INFO L93 Difference]: Finished difference Result 2584 states and 3176 transitions. [2024-11-18 09:38:05,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:05,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 159 [2024-11-18 09:38:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:05,863 INFO L225 Difference]: With dead ends: 2584 [2024-11-18 09:38:05,864 INFO L226 Difference]: Without dead ends: 1712 [2024-11-18 09:38:05,865 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-18 09:38:05,866 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:05,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 75 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2024-11-18 09:38:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1432. [2024-11-18 09:38:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.2159329140461217) internal successors, (1740), 1431 states have internal predecessors, (1740), 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-18 09:38:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1740 transitions. [2024-11-18 09:38:05,901 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1740 transitions. Word has length 159 [2024-11-18 09:38:05,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:05,901 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1740 transitions. [2024-11-18 09:38:05,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-18 09:38:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1740 transitions. [2024-11-18 09:38:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-18 09:38:05,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:05,906 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:38:05,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 09:38:05,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:05,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash 685164957, now seen corresponding path program 1 times [2024-11-18 09:38:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:05,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876266498] [2024-11-18 09:38:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 09:38:06,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:06,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876266498] [2024-11-18 09:38:06,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876266498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:06,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:06,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:06,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230026371] [2024-11-18 09:38:06,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:06,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:38:06,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:06,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:38:06,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:38:06,249 INFO L87 Difference]: Start difference. First operand 1432 states and 1740 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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-18 09:38:06,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:06,912 INFO L93 Difference]: Finished difference Result 3365 states and 4132 transitions. [2024-11-18 09:38:06,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:38:06,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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 163 [2024-11-18 09:38:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:06,919 INFO L225 Difference]: With dead ends: 3365 [2024-11-18 09:38:06,919 INFO L226 Difference]: Without dead ends: 1852 [2024-11-18 09:38:06,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:38:06,924 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 142 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:06,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 101 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 09:38:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2024-11-18 09:38:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1432. [2024-11-18 09:38:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.2117400419287212) internal successors, (1734), 1431 states have internal predecessors, (1734), 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-18 09:38:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1734 transitions. [2024-11-18 09:38:06,953 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1734 transitions. Word has length 163 [2024-11-18 09:38:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:06,954 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1734 transitions. [2024-11-18 09:38:06,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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-18 09:38:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1734 transitions. [2024-11-18 09:38:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-18 09:38:06,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:06,958 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:06,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 09:38:06,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:06,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1702186773, now seen corresponding path program 1 times [2024-11-18 09:38:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:06,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622758254] [2024-11-18 09:38:06,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-18 09:38:07,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:07,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622758254] [2024-11-18 09:38:07,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622758254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:07,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:07,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55033912] [2024-11-18 09:38:07,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:07,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:07,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:07,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:07,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:07,130 INFO L87 Difference]: Start difference. First operand 1432 states and 1734 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-18 09:38:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:07,542 INFO L93 Difference]: Finished difference Result 3144 states and 3790 transitions. [2024-11-18 09:38:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:07,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 201 [2024-11-18 09:38:07,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:07,548 INFO L225 Difference]: With dead ends: 3144 [2024-11-18 09:38:07,548 INFO L226 Difference]: Without dead ends: 1572 [2024-11-18 09:38:07,550 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-18 09:38:07,551 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:07,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 49 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-11-18 09:38:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1570. [2024-11-18 09:38:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1569 states have (on average 1.1281070745697896) internal successors, (1770), 1569 states have internal predecessors, (1770), 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-18 09:38:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1770 transitions. [2024-11-18 09:38:07,577 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1770 transitions. Word has length 201 [2024-11-18 09:38:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:07,578 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 1770 transitions. [2024-11-18 09:38:07,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-18 09:38:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1770 transitions. [2024-11-18 09:38:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-18 09:38:07,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:07,582 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:07,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 09:38:07,583 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:07,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:07,583 INFO L85 PathProgramCache]: Analyzing trace with hash -270872735, now seen corresponding path program 1 times [2024-11-18 09:38:07,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:07,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178426948] [2024-11-18 09:38:07,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:07,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-18 09:38:07,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:07,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178426948] [2024-11-18 09:38:07,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178426948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:07,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:07,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:07,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411856301] [2024-11-18 09:38:07,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:07,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:07,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:07,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:07,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:07,709 INFO L87 Difference]: Start difference. First operand 1570 states and 1770 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-18 09:38:08,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:08,118 INFO L93 Difference]: Finished difference Result 3846 states and 4293 transitions. [2024-11-18 09:38:08,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:08,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 205 [2024-11-18 09:38:08,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:08,126 INFO L225 Difference]: With dead ends: 3846 [2024-11-18 09:38:08,126 INFO L226 Difference]: Without dead ends: 2138 [2024-11-18 09:38:08,129 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-18 09:38:08,129 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 138 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:08,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 244 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2024-11-18 09:38:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2132. [2024-11-18 09:38:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2132 states, 2131 states have (on average 1.0910370717972784) internal successors, (2325), 2131 states have internal predecessors, (2325), 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-18 09:38:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2325 transitions. [2024-11-18 09:38:08,167 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2325 transitions. Word has length 205 [2024-11-18 09:38:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:08,168 INFO L471 AbstractCegarLoop]: Abstraction has 2132 states and 2325 transitions. [2024-11-18 09:38:08,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-18 09:38:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2325 transitions. [2024-11-18 09:38:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-18 09:38:08,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:08,173 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:38:08,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 09:38:08,173 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:08,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:08,174 INFO L85 PathProgramCache]: Analyzing trace with hash -960693472, now seen corresponding path program 1 times [2024-11-18 09:38:08,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:08,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281278703] [2024-11-18 09:38:08,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:08,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-18 09:38:08,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:08,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281278703] [2024-11-18 09:38:08,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281278703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:08,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:08,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:08,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455416900] [2024-11-18 09:38:08,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:08,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:38:08,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:08,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:38:08,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:38:08,578 INFO L87 Difference]: Start difference. First operand 2132 states and 2325 transitions. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 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-18 09:38:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:09,002 INFO L93 Difference]: Finished difference Result 4346 states and 4763 transitions. [2024-11-18 09:38:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:38:09,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 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 227 [2024-11-18 09:38:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:09,010 INFO L225 Difference]: With dead ends: 4346 [2024-11-18 09:38:09,010 INFO L226 Difference]: Without dead ends: 2132 [2024-11-18 09:38:09,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:38:09,014 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 151 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:09,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 51 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:09,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2024-11-18 09:38:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2132. [2024-11-18 09:38:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2132 states, 2131 states have (on average 1.0886907555138432) internal successors, (2320), 2131 states have internal predecessors, (2320), 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-18 09:38:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2320 transitions. [2024-11-18 09:38:09,057 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2320 transitions. Word has length 227 [2024-11-18 09:38:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:09,058 INFO L471 AbstractCegarLoop]: Abstraction has 2132 states and 2320 transitions. [2024-11-18 09:38:09,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 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-18 09:38:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2320 transitions. [2024-11-18 09:38:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-18 09:38:09,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:09,064 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:38:09,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 09:38:09,064 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:09,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1337408135, now seen corresponding path program 1 times [2024-11-18 09:38:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:09,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957570606] [2024-11-18 09:38:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-18 09:38:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:09,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957570606] [2024-11-18 09:38:09,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957570606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:09,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:09,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:09,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406047692] [2024-11-18 09:38:09,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:09,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:09,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:09,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:09,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:09,234 INFO L87 Difference]: Start difference. First operand 2132 states and 2320 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-18 09:38:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:09,622 INFO L93 Difference]: Finished difference Result 4536 states and 4919 transitions. [2024-11-18 09:38:09,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:09,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 248 [2024-11-18 09:38:09,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:09,633 INFO L225 Difference]: With dead ends: 4536 [2024-11-18 09:38:09,633 INFO L226 Difference]: Without dead ends: 1842 [2024-11-18 09:38:09,637 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-18 09:38:09,638 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 81 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:09,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 226 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2024-11-18 09:38:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1842. [2024-11-18 09:38:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.053231939163498) internal successors, (1939), 1841 states have internal predecessors, (1939), 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-18 09:38:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 1939 transitions. [2024-11-18 09:38:09,674 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 1939 transitions. Word has length 248 [2024-11-18 09:38:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:09,674 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 1939 transitions. [2024-11-18 09:38:09,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-18 09:38:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 1939 transitions. [2024-11-18 09:38:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-18 09:38:09,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:09,680 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:38:09,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 09:38:09,681 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:09,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:09,682 INFO L85 PathProgramCache]: Analyzing trace with hash 704456689, now seen corresponding path program 1 times [2024-11-18 09:38:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:09,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689910483] [2024-11-18 09:38:09,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:09,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-18 09:38:09,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:09,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689910483] [2024-11-18 09:38:09,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689910483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:09,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:09,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:09,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573541975] [2024-11-18 09:38:09,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:09,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:09,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:09,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:09,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:09,868 INFO L87 Difference]: Start difference. First operand 1842 states and 1939 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-18 09:38:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:10,221 INFO L93 Difference]: Finished difference Result 3540 states and 3735 transitions. [2024-11-18 09:38:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:10,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 292 [2024-11-18 09:38:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:10,222 INFO L225 Difference]: With dead ends: 3540 [2024-11-18 09:38:10,222 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 09:38:10,225 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-18 09:38:10,226 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 122 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:10,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 51 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:38:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 09:38:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 09:38:10,227 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-18 09:38:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 09:38:10,228 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 292 [2024-11-18 09:38:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:10,228 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 09:38:10,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-18 09:38:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 09:38:10,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 09:38:10,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 09:38:10,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 09:38:10,236 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:10,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 09:38:10,475 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 09:38:10,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:38:10 BoogieIcfgContainer [2024-11-18 09:38:10,493 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 09:38:10,494 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 09:38:10,494 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 09:38:10,494 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 09:38:10,495 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:38:02" (3/4) ... [2024-11-18 09:38:10,497 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 09:38:10,518 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-18 09:38:10,519 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 09:38:10,520 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 09:38:10,521 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 09:38:10,659 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 09:38:10,659 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 09:38:10,659 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 09:38:10,660 INFO L158 Benchmark]: Toolchain (without parser) took 10364.74ms. Allocated memory was 167.8MB in the beginning and 262.1MB in the end (delta: 94.4MB). Free memory was 136.4MB in the beginning and 71.6MB in the end (delta: 64.8MB). Peak memory consumption was 159.9MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,660 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:38:10,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.94ms. Allocated memory is still 167.8MB. Free memory was 136.2MB in the beginning and 110.1MB in the end (delta: 26.1MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.17ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 104.4MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,661 INFO L158 Benchmark]: Boogie Preprocessor took 94.87ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 98.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,661 INFO L158 Benchmark]: RCFGBuilder took 1159.45ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 73.3MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,661 INFO L158 Benchmark]: TraceAbstraction took 8298.62ms. Allocated memory was 167.8MB in the beginning and 262.1MB in the end (delta: 94.4MB). Free memory was 72.2MB in the beginning and 84.1MB in the end (delta: -11.9MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,661 INFO L158 Benchmark]: Witness Printer took 165.53ms. Allocated memory is still 262.1MB. Free memory was 84.1MB in the beginning and 71.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,663 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 130.0MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 570.94ms. Allocated memory is still 167.8MB. Free memory was 136.2MB in the beginning and 110.1MB in the end (delta: 26.1MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.17ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 104.4MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.87ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 98.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1159.45ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 73.3MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8298.62ms. Allocated memory was 167.8MB in the beginning and 262.1MB in the end (delta: 94.4MB). Free memory was 72.2MB in the beginning and 84.1MB in the end (delta: -11.9MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. * Witness Printer took 165.53ms. Allocated memory is still 262.1MB. Free memory was 84.1MB in the beginning and 71.6MB 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: 569]: 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: 8.0s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1116 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1116 mSDsluCounter, 1295 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 752 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3876 IncrementalHoareTripleChecker+Invalid, 4628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 752 mSolverCounterUnsat, 1135 mSDtfsCounter, 3876 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2132occurred in iteration=7, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 710 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1904 NumberOfCodeBlocks, 1904 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1894 ConstructedInterpolants, 0 QuantifiedInterpolants, 6599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 998/998 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: ((((((((10 <= a28) && (a21 == 1)) || (((a28 <= 8) && (a21 == 1)) && (a11 != 1))) || ((a21 == 1) && (a28 <= 7))) || ((a28 == 10) && (a19 == 1))) || ((a21 == 1) && (((a19 == 1) && (a11 != 1)) || ((a17 == 8) && (a19 == 1))))) || (((a17 <= 7) && (a21 == 1)) && (a11 != 1))) || (((((a19 == 0) && (a25 == 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) RESULT: Ultimate proved your program to be correct! [2024-11-18 09:38:10,706 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