./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label13.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 29c272f94fc98eecb70c8e165b01acafdc9b1cf1c8d08d69100d178e45ed1c97 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:47:02,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:47:02,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:47:02,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:47:02,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:47:02,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:47:02,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:47:02,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:47:02,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:47:02,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:47:02,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:47:02,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:47:02,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:47:02,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:47:02,184 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:47:02,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:47:02,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:47:02,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:47:02,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:47:02,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:47:02,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:47:02,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:47:02,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:47:02,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:47:02,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:47:02,188 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:47:02,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:47:02,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:47:02,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:47:02,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:47:02,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:47:02,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:47:02,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:47:02,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:47:02,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:47:02,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:47:02,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:47:02,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:47:02,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:47:02,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:47:02,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:47:02,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:47:02,193 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 -> 29c272f94fc98eecb70c8e165b01acafdc9b1cf1c8d08d69100d178e45ed1c97 [2024-11-11 16:47:02,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:47:02,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:47:02,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:47:02,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:47:02,486 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:47:02,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label13.c [2024-11-11 16:47:03,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:47:04,226 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:47:04,227 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label13.c [2024-11-11 16:47:04,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1a0ccef/e29de0812fb3461f8dc40cb8c5bc79b8/FLAG4ca4e4336 [2024-11-11 16:47:04,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1a0ccef/e29de0812fb3461f8dc40cb8c5bc79b8 [2024-11-11 16:47:04,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:47:04,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:47:04,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:47:04,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:47:04,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:47:04,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:04,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf7f011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04, skipping insertion in model container [2024-11-11 16:47:04,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:04,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:47:04,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label13.c[6334,6347] [2024-11-11 16:47:04,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:47:04,758 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:47:04,787 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label13.c[6334,6347] [2024-11-11 16:47:04,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:47:04,859 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:47:04,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04 WrapperNode [2024-11-11 16:47:04,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:47:04,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:47:04,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:47:04,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:47:04,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:04,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:04,940 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-11 16:47:04,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:47:04,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:47:04,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:47:04,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:47:04,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:04,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:04,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:04,992 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:47:04,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:04,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:05,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:05,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:05,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:05,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:05,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:47:05,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:47:05,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:47:05,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:47:05,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (1/1) ... [2024-11-11 16:47:05,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:47:05,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:05,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:47:05,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:47:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:47:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:47:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:47:05,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:47:05,211 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:47:05,213 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:47:06,317 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-11 16:47:06,320 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:47:06,344 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:47:06,345 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:47:06,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:47:06 BoogieIcfgContainer [2024-11-11 16:47:06,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:47:06,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:47:06,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:47:06,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:47:06,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:47:04" (1/3) ... [2024-11-11 16:47:06,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfcd25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:47:06, skipping insertion in model container [2024-11-11 16:47:06,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:04" (2/3) ... [2024-11-11 16:47:06,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfcd25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:47:06, skipping insertion in model container [2024-11-11 16:47:06,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:47:06" (3/3) ... [2024-11-11 16:47:06,355 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label13.c [2024-11-11 16:47:06,372 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:47:06,372 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:47:06,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:47:06,440 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;@45038d67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:47:06,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:47:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 16:47:06,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:06,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:06,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:06,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:06,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2024-11-11 16:47:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:06,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183790536] [2024-11-11 16:47:06,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:06,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183790536] [2024-11-11 16:47:06,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183790536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:06,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:06,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:47:06,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056927496] [2024-11-11 16:47:06,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:06,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:06,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:06,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:06,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:06,944 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:07,702 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-11 16:47:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:07,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 55 [2024-11-11 16:47:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:07,719 INFO L225 Difference]: With dead ends: 552 [2024-11-11 16:47:07,719 INFO L226 Difference]: Without dead ends: 282 [2024-11-11 16:47:07,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:07,729 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 108 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:07,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:47:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-11 16:47:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-11 16:47:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2024-11-11 16:47:07,794 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 55 [2024-11-11 16:47:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:07,795 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2024-11-11 16:47:07,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2024-11-11 16:47:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-11 16:47:07,799 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:07,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:07,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:47:07,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:07,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:07,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2042555292, now seen corresponding path program 1 times [2024-11-11 16:47:07,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:07,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721959373] [2024-11-11 16:47:07,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:07,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:08,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721959373] [2024-11-11 16:47:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721959373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:08,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:47:08,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511061765] [2024-11-11 16:47:08,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:08,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:08,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:08,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:08,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:08,094 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:08,592 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2024-11-11 16:47:08,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:08,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121 [2024-11-11 16:47:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:08,599 INFO L225 Difference]: With dead ends: 701 [2024-11-11 16:47:08,599 INFO L226 Difference]: Without dead ends: 421 [2024-11-11 16:47:08,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:08,601 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 91 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:08,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-11 16:47:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-11 16:47:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2024-11-11 16:47:08,638 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 121 [2024-11-11 16:47:08,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:08,639 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2024-11-11 16:47:08,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2024-11-11 16:47:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 16:47:08,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:08,644 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:08,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:47:08,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:08,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:08,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1371951955, now seen corresponding path program 1 times [2024-11-11 16:47:08,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:08,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144344144] [2024-11-11 16:47:08,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:08,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:08,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:08,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144344144] [2024-11-11 16:47:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144344144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:08,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:08,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:47:08,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592636551] [2024-11-11 16:47:08,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:08,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:08,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:08,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:08,938 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:09,350 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2024-11-11 16:47:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:09,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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 128 [2024-11-11 16:47:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:09,353 INFO L225 Difference]: With dead ends: 979 [2024-11-11 16:47:09,353 INFO L226 Difference]: Without dead ends: 560 [2024-11-11 16:47:09,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:09,358 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:09,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-11 16:47:09,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-11 16:47:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2024-11-11 16:47:09,374 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 128 [2024-11-11 16:47:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:09,375 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2024-11-11 16:47:09,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2024-11-11 16:47:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 16:47:09,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:09,378 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:09,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:47:09,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:09,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:09,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1762411064, now seen corresponding path program 1 times [2024-11-11 16:47:09,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:09,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182560318] [2024-11-11 16:47:09,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:09,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 38 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:09,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:09,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182560318] [2024-11-11 16:47:09,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182560318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:47:09,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222250995] [2024-11-11 16:47:09,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:09,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:09,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:09,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:47:09,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:47:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:09,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:47:09,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:47:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:10,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:47:10,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222250995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:10,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:47:10,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-11 16:47:10,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440129242] [2024-11-11 16:47:10,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:10,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:10,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:10,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:10,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:47:10,077 INFO L87 Difference]: Start difference. First operand 560 states and 675 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:10,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:10,560 INFO L93 Difference]: Finished difference Result 979 states and 1199 transitions. [2024-11-11 16:47:10,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:10,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 130 [2024-11-11 16:47:10,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:10,565 INFO L225 Difference]: With dead ends: 979 [2024-11-11 16:47:10,565 INFO L226 Difference]: Without dead ends: 977 [2024-11-11 16:47:10,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:47:10,567 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:10,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 11 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-11 16:47:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 699. [2024-11-11 16:47:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2736389684813754) internal successors, (889), 698 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 889 transitions. [2024-11-11 16:47:10,584 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 889 transitions. Word has length 130 [2024-11-11 16:47:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:10,585 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 889 transitions. [2024-11-11 16:47:10,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 889 transitions. [2024-11-11 16:47:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-11 16:47:10,589 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:10,589 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:10,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:47:10,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:10,790 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:10,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1726354278, now seen corresponding path program 1 times [2024-11-11 16:47:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:10,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226558236] [2024-11-11 16:47:10,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:11,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:11,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226558236] [2024-11-11 16:47:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226558236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:11,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:11,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:47:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744742229] [2024-11-11 16:47:11,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:11,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:47:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:11,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:47:11,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:47:11,181 INFO L87 Difference]: Start difference. First operand 699 states and 889 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:11,737 INFO L93 Difference]: Finished difference Result 1257 states and 1627 transitions. [2024-11-11 16:47:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:47:11,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 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 173 [2024-11-11 16:47:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:11,741 INFO L225 Difference]: With dead ends: 1257 [2024-11-11 16:47:11,741 INFO L226 Difference]: Without dead ends: 699 [2024-11-11 16:47:11,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:47:11,743 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:11,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-11 16:47:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-11 16:47:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2664756446991403) internal successors, (884), 698 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 884 transitions. [2024-11-11 16:47:11,762 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 884 transitions. Word has length 173 [2024-11-11 16:47:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:11,763 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 884 transitions. [2024-11-11 16:47:11,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 884 transitions. [2024-11-11 16:47:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-11 16:47:11,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:11,768 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:47:11,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:47:11,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:11,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1617583127, now seen corresponding path program 1 times [2024-11-11 16:47:11,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:11,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973127312] [2024-11-11 16:47:11,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:12,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:12,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973127312] [2024-11-11 16:47:12,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973127312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:12,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:12,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 16:47:12,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852339079] [2024-11-11 16:47:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:12,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 16:47:12,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:12,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 16:47:12,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:47:12,233 INFO L87 Difference]: Start difference. First operand 699 states and 884 transitions. Second operand has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:12,774 INFO L93 Difference]: Finished difference Result 1312 states and 1677 transitions. [2024-11-11 16:47:12,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 16:47:12,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2024-11-11 16:47:12,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:12,781 INFO L225 Difference]: With dead ends: 1312 [2024-11-11 16:47:12,781 INFO L226 Difference]: Without dead ends: 699 [2024-11-11 16:47:12,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:47:12,782 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:12,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-11 16:47:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-11 16:47:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2607449856733524) internal successors, (880), 698 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 880 transitions. [2024-11-11 16:47:12,794 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 880 transitions. Word has length 208 [2024-11-11 16:47:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:12,795 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 880 transitions. [2024-11-11 16:47:12,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 880 transitions. [2024-11-11 16:47:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-11 16:47:12,798 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:12,798 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-11 16:47:12,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:47:12,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:12,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:12,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1784057475, now seen corresponding path program 1 times [2024-11-11 16:47:12,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:12,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669526182] [2024-11-11 16:47:12,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:13,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669526182] [2024-11-11 16:47:13,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669526182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:13,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:13,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:47:13,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113146246] [2024-11-11 16:47:13,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:13,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:13,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:13,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:13,010 INFO L87 Difference]: Start difference. First operand 699 states and 880 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:13,485 INFO L93 Difference]: Finished difference Result 1535 states and 2042 transitions. [2024-11-11 16:47:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:13,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 244 [2024-11-11 16:47:13,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:13,489 INFO L225 Difference]: With dead ends: 1535 [2024-11-11 16:47:13,489 INFO L226 Difference]: Without dead ends: 977 [2024-11-11 16:47:13,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:13,491 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 75 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:13,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 190 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-11 16:47:13,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2024-11-11 16:47:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2592592592592593) internal successors, (1054), 837 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1054 transitions. [2024-11-11 16:47:13,527 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1054 transitions. Word has length 244 [2024-11-11 16:47:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:13,528 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1054 transitions. [2024-11-11 16:47:13,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1054 transitions. [2024-11-11 16:47:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-11 16:47:13,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:13,533 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:47:13,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:47:13,533 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:13,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash -724262486, now seen corresponding path program 1 times [2024-11-11 16:47:13,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:13,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835608225] [2024-11-11 16:47:13,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:13,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 120 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:14,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:14,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835608225] [2024-11-11 16:47:14,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835608225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:47:14,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178370335] [2024-11-11 16:47:14,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:14,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:14,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:14,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:47:14,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:47:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:14,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:47:14,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:47:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-11 16:47:14,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:47:14,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178370335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:14,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:47:14,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-11 16:47:14,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258580157] [2024-11-11 16:47:14,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:14,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:14,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:14,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:14,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:47:14,493 INFO L87 Difference]: Start difference. First operand 838 states and 1054 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:14,933 INFO L93 Difference]: Finished difference Result 1813 states and 2295 transitions. [2024-11-11 16:47:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:14,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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 287 [2024-11-11 16:47:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:14,938 INFO L225 Difference]: With dead ends: 1813 [2024-11-11 16:47:14,938 INFO L226 Difference]: Without dead ends: 1116 [2024-11-11 16:47:14,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:47:14,940 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:14,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-11 16:47:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2024-11-11 16:47:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1713004484304932) internal successors, (1306), 1115 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1306 transitions. [2024-11-11 16:47:14,959 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1306 transitions. Word has length 287 [2024-11-11 16:47:14,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:14,960 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1306 transitions. [2024-11-11 16:47:14,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1306 transitions. [2024-11-11 16:47:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-11 16:47:14,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:14,965 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:14,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 16:47:15,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-11 16:47:15,166 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:15,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:15,167 INFO L85 PathProgramCache]: Analyzing trace with hash -524971941, now seen corresponding path program 1 times [2024-11-11 16:47:15,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:15,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958387500] [2024-11-11 16:47:15,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:15,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-11 16:47:15,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:15,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958387500] [2024-11-11 16:47:15,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958387500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:15,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:15,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:47:15,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434596143] [2024-11-11 16:47:15,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:15,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:15,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:15,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:15,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:15,508 INFO L87 Difference]: Start difference. First operand 1116 states and 1306 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:15,983 INFO L93 Difference]: Finished difference Result 2923 states and 3437 transitions. [2024-11-11 16:47:15,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:15,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 354 [2024-11-11 16:47:15,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:15,984 INFO L225 Difference]: With dead ends: 2923 [2024-11-11 16:47:15,984 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:47:15,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:15,988 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 89 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:15,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 48 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:16,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:47:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:47:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:47:16,006 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 354 [2024-11-11 16:47:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:16,007 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:47:16,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:47:16,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:47:16,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:47:16,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:47:16,015 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:16,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:47:16,153 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:47:16,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:47:16 BoogieIcfgContainer [2024-11-11 16:47:16,174 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:47:16,174 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:47:16,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:47:16,175 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:47:16,175 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:47:06" (3/4) ... [2024-11-11 16:47:16,177 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:47:16,195 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:47:16,196 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:47:16,197 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:47:16,198 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:47:16,321 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:47:16,321 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:47:16,321 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:47:16,322 INFO L158 Benchmark]: Toolchain (without parser) took 12052.75ms. Allocated memory was 157.3MB in the beginning and 249.6MB in the end (delta: 92.3MB). Free memory was 88.7MB in the beginning and 177.3MB in the end (delta: -88.6MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-11 16:47:16,322 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:47:16,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.84ms. Allocated memory is still 157.3MB. Free memory was 88.4MB in the beginning and 107.9MB in the end (delta: -19.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 16:47:16,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.56ms. Allocated memory is still 157.3MB. Free memory was 107.9MB in the beginning and 99.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 16:47:16,323 INFO L158 Benchmark]: Boogie Preprocessor took 111.78ms. Allocated memory is still 157.3MB. Free memory was 99.6MB in the beginning and 89.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 16:47:16,323 INFO L158 Benchmark]: RCFGBuilder took 1292.82ms. Allocated memory is still 157.3MB. Free memory was 89.7MB in the beginning and 72.2MB in the end (delta: 17.5MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2024-11-11 16:47:16,324 INFO L158 Benchmark]: TraceAbstraction took 9826.26ms. Allocated memory was 157.3MB in the beginning and 249.6MB in the end (delta: 92.3MB). Free memory was 71.9MB in the beginning and 188.9MB in the end (delta: -116.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:47:16,324 INFO L158 Benchmark]: Witness Printer took 147.23ms. Allocated memory is still 249.6MB. Free memory was 188.9MB in the beginning and 177.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 16:47:16,325 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 113.2MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 587.84ms. Allocated memory is still 157.3MB. Free memory was 88.4MB in the beginning and 107.9MB in the end (delta: -19.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.56ms. Allocated memory is still 157.3MB. Free memory was 107.9MB in the beginning and 99.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.78ms. Allocated memory is still 157.3MB. Free memory was 99.6MB in the beginning and 89.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1292.82ms. Allocated memory is still 157.3MB. Free memory was 89.7MB in the beginning and 72.2MB in the end (delta: 17.5MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9826.26ms. Allocated memory was 157.3MB in the beginning and 249.6MB in the end (delta: 92.3MB). Free memory was 71.9MB in the beginning and 188.9MB in the end (delta: -116.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 147.23ms. Allocated memory is still 249.6MB. Free memory was 188.9MB in the beginning and 177.3MB in the end (delta: 11.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: 179]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 844 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 844 mSDsluCounter, 807 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 509 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3839 IncrementalHoareTripleChecker+Invalid, 4348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 509 mSolverCounterUnsat, 751 mSDtfsCounter, 3839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1116occurred in iteration=8, 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 417 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2117 NumberOfCodeBlocks, 2117 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2106 ConstructedInterpolants, 0 QuantifiedInterpolants, 8554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 1355/1464 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: ((((((((a19 <= 9) && (8 <= a19)) && (14 == a4)) && (a12 == 0)) || ((((a19 <= 9) && (14 == a4)) && (a12 == 0)) && (a1 <= 33))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:47:16,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE