./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label10.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 5f4b32ab55ef7da7a1c45381b7a9ca93704fa76788ea88b9dbed6ebccc0ba509 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:43:01,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:43:02,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:43:02,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:43:02,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:43:02,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:43:02,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:43:02,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:43:02,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:43:02,049 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:43:02,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:43:02,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:43:02,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:43:02,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:43:02,052 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:43:02,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:43:02,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:43:02,055 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:43:02,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:43:02,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:43:02,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:43:02,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:43:02,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:43:02,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:43:02,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:43:02,057 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:43:02,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:43:02,057 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:43:02,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:43:02,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:43:02,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:43:02,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:43:02,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:43:02,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:43:02,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:43:02,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:43:02,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:43:02,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:43:02,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:43:02,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:43:02,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:43:02,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:43:02,062 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 -> 5f4b32ab55ef7da7a1c45381b7a9ca93704fa76788ea88b9dbed6ebccc0ba509 [2024-10-13 22:43:02,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:43:02,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:43:02,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:43:02,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:43:02,311 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:43:02,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label10.c [2024-10-13 22:43:03,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:43:03,737 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:43:03,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label10.c [2024-10-13 22:43:03,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89aa1d794/8bf1dde24935416ab694c64345f6cffc/FLAG516130164 [2024-10-13 22:43:03,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89aa1d794/8bf1dde24935416ab694c64345f6cffc [2024-10-13 22:43:03,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:43:03,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:43:03,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:43:03,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:43:03,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:43:03,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:43:03" (1/1) ... [2024-10-13 22:43:03,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf37852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:03, skipping insertion in model container [2024-10-13 22:43:03,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:43:03" (1/1) ... [2024-10-13 22:43:03,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:43:04,020 WARN L248 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/Problem01_label10.c[19224,19237] [2024-10-13 22:43:04,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:43:04,049 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:43:04,112 WARN L248 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/Problem01_label10.c[19224,19237] [2024-10-13 22:43:04,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:43:04,136 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:43:04,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04 WrapperNode [2024-10-13 22:43:04,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:43:04,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:43:04,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:43:04,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:43:04,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (1/1) ... [2024-10-13 22:43:04,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (1/1) ... [2024-10-13 22:43:04,205 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-10-13 22:43:04,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:43:04,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:43:04,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:43:04,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:43:04,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (1/1) ... [2024-10-13 22:43:04,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (1/1) ... [2024-10-13 22:43:04,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (1/1) ... [2024-10-13 22:43:04,245 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-10-13 22:43:04,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (1/1) ... [2024-10-13 22:43:04,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (1/1) ... [2024-10-13 22:43:04,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (1/1) ... [2024-10-13 22:43:04,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (1/1) ... [2024-10-13 22:43:04,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (1/1) ... [2024-10-13 22:43:04,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (1/1) ... [2024-10-13 22:43:04,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:43:04,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:43:04,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:43:04,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:43:04,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (1/1) ... [2024-10-13 22:43:04,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:43:04,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:43:04,326 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-10-13 22:43:04,328 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-10-13 22:43:04,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:43:04,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:43:04,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:43:04,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:43:04,454 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:43:04,455 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:43:05,117 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-13 22:43:05,117 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:43:05,155 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:43:05,156 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 22:43:05,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:43:05 BoogieIcfgContainer [2024-10-13 22:43:05,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:43:05,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:43:05,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:43:05,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:43:05,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:43:03" (1/3) ... [2024-10-13 22:43:05,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f77b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:43:05, skipping insertion in model container [2024-10-13 22:43:05,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:04" (2/3) ... [2024-10-13 22:43:05,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f77b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:43:05, skipping insertion in model container [2024-10-13 22:43:05,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:43:05" (3/3) ... [2024-10-13 22:43:05,164 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label10.c [2024-10-13 22:43:05,176 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:43:05,176 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:43:05,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:43:05,246 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;@2361765d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:43:05,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:43:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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-10-13 22:43:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 22:43:05,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:05,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:43:05,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:05,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:05,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1499488826, now seen corresponding path program 1 times [2024-10-13 22:43:05,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:05,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269996104] [2024-10-13 22:43:05,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:05,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:43:05,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:05,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269996104] [2024-10-13 22:43:05,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269996104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:05,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:43:05,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:43:05,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497082917] [2024-10-13 22:43:05,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:05,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 22:43:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:05,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 22:43:05,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:43:05,603 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:43:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:05,626 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2024-10-13 22:43:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 22:43:05,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-10-13 22:43:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:05,637 INFO L225 Difference]: With dead ends: 271 [2024-10-13 22:43:05,637 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 22:43:05,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:43:05,641 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:05,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:43:05,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 22:43:05,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-13 22:43:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 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-10-13 22:43:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-10-13 22:43:05,668 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 109 [2024-10-13 22:43:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:05,669 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-10-13 22:43:05,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:43:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-10-13 22:43:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 22:43:05,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:05,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:43:05,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:43:05,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:05,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:05,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1827766489, now seen corresponding path program 1 times [2024-10-13 22:43:05,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:05,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173413237] [2024-10-13 22:43:05,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:05,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:43:06,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:06,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173413237] [2024-10-13 22:43:06,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173413237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:06,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:43:06,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:43:06,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027265792] [2024-10-13 22:43:06,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:06,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:43:06,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:06,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:43:06,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:43:06,124 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:43:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:06,758 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2024-10-13 22:43:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:43:06,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-10-13 22:43:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:06,763 INFO L225 Difference]: With dead ends: 529 [2024-10-13 22:43:06,765 INFO L226 Difference]: Without dead ends: 396 [2024-10-13 22:43:06,766 INFO L431 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-10-13 22:43:06,767 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 300 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:06,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 35 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 22:43:06,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-13 22:43:06,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-10-13 22:43:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.3063291139240507) internal successors, (516), 395 states have internal predecessors, (516), 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-10-13 22:43:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 516 transitions. [2024-10-13 22:43:06,798 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 516 transitions. Word has length 109 [2024-10-13 22:43:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:06,799 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 516 transitions. [2024-10-13 22:43:06,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:43:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 516 transitions. [2024-10-13 22:43:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 22:43:06,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:06,804 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:43:06,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:43:06,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:06,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:06,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1147579718, now seen corresponding path program 1 times [2024-10-13 22:43:06,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:06,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817332139] [2024-10-13 22:43:06,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:43:07,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:07,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817332139] [2024-10-13 22:43:07,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817332139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:07,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:43:07,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:43:07,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241387742] [2024-10-13 22:43:07,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:07,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:43:07,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:07,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:43:07,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:43:07,076 INFO L87 Difference]: Start difference. First operand 396 states and 516 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:43:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:07,608 INFO L93 Difference]: Finished difference Result 886 states and 1234 transitions. [2024-10-13 22:43:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:43:07,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-10-13 22:43:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:07,610 INFO L225 Difference]: With dead ends: 886 [2024-10-13 22:43:07,610 INFO L226 Difference]: Without dead ends: 527 [2024-10-13 22:43:07,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:43:07,613 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 126 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:07,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 80 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 22:43:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-13 22:43:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 396. [2024-10-13 22:43:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.1974683544303797) internal successors, (473), 395 states have internal predecessors, (473), 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-10-13 22:43:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 473 transitions. [2024-10-13 22:43:07,627 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 473 transitions. Word has length 116 [2024-10-13 22:43:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:07,631 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 473 transitions. [2024-10-13 22:43:07,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:43:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 473 transitions. [2024-10-13 22:43:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 22:43:07,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:07,633 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:43:07,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:43:07,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:07,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash -509698440, now seen corresponding path program 1 times [2024-10-13 22:43:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:07,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119767517] [2024-10-13 22:43:07,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:43:07,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:07,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119767517] [2024-10-13 22:43:07,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119767517] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:43:07,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953289710] [2024-10-13 22:43:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:07,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:43:07,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:43:07,780 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-10-13 22:43:07,781 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-10-13 22:43:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:07,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:43:07,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:43:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 22:43:07,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:43:07,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953289710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:07,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:43:07,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-13 22:43:07,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240795680] [2024-10-13 22:43:07,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:07,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:43:07,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:07,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:43:07,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:43:07,987 INFO L87 Difference]: Start difference. First operand 396 states and 473 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-10-13 22:43:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:08,295 INFO L93 Difference]: Finished difference Result 1184 states and 1416 transitions. [2024-10-13 22:43:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:43:08,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 124 [2024-10-13 22:43:08,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:08,298 INFO L225 Difference]: With dead ends: 1184 [2024-10-13 22:43:08,298 INFO L226 Difference]: Without dead ends: 789 [2024-10-13 22:43:08,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:43:08,301 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 33 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:08,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 12 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:43:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-10-13 22:43:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 658. [2024-10-13 22:43:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 1.2283105022831051) internal successors, (807), 657 states have internal predecessors, (807), 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-10-13 22:43:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 807 transitions. [2024-10-13 22:43:08,319 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 807 transitions. Word has length 124 [2024-10-13 22:43:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:08,320 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 807 transitions. [2024-10-13 22:43:08,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-10-13 22:43:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 807 transitions. [2024-10-13 22:43:08,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 22:43:08,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:08,322 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:43:08,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 22:43:08,527 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-10-13 22:43:08,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:08,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash 476577963, now seen corresponding path program 1 times [2024-10-13 22:43:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:08,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701477661] [2024-10-13 22:43:08,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:08,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 22:43:08,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:08,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701477661] [2024-10-13 22:43:08,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701477661] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:43:08,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942582415] [2024-10-13 22:43:08,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:08,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:43:08,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:43:08,661 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-10-13 22:43:08,662 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-10-13 22:43:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:08,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:43:08,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:43:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-13 22:43:08,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:43:08,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942582415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:08,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:43:08,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-13 22:43:08,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554162126] [2024-10-13 22:43:08,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:08,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:43:08,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:08,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:43:08,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:43:08,880 INFO L87 Difference]: Start difference. First operand 658 states and 807 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-10-13 22:43:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:09,206 INFO L93 Difference]: Finished difference Result 1577 states and 1967 transitions. [2024-10-13 22:43:09,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:43:09,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 143 [2024-10-13 22:43:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:09,209 INFO L225 Difference]: With dead ends: 1577 [2024-10-13 22:43:09,209 INFO L226 Difference]: Without dead ends: 920 [2024-10-13 22:43:09,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:43:09,212 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:09,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 170 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:43:09,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-13 22:43:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 789. [2024-10-13 22:43:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.2208121827411167) internal successors, (962), 788 states have internal predecessors, (962), 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-10-13 22:43:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 962 transitions. [2024-10-13 22:43:09,227 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 962 transitions. Word has length 143 [2024-10-13 22:43:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:09,227 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 962 transitions. [2024-10-13 22:43:09,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-10-13 22:43:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 962 transitions. [2024-10-13 22:43:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 22:43:09,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:09,228 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:43:09,243 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-10-13 22:43:09,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:43:09,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:09,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:09,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1455077487, now seen corresponding path program 1 times [2024-10-13 22:43:09,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:09,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784167181] [2024-10-13 22:43:09,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-13 22:43:09,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:09,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784167181] [2024-10-13 22:43:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784167181] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:43:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40115989] [2024-10-13 22:43:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:09,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:43:09,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:43:09,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:43:09,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 22:43:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:09,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:43:09,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:43:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 22:43:09,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:43:09,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40115989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:09,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:43:09,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-13 22:43:09,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527163393] [2024-10-13 22:43:09,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:09,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:43:09,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:09,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:43:09,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:43:09,724 INFO L87 Difference]: Start difference. First operand 789 states and 962 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-10-13 22:43:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:10,000 INFO L93 Difference]: Finished difference Result 1970 states and 2391 transitions. [2024-10-13 22:43:10,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:43:10,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2024-10-13 22:43:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:10,004 INFO L225 Difference]: With dead ends: 1970 [2024-10-13 22:43:10,004 INFO L226 Difference]: Without dead ends: 1182 [2024-10-13 22:43:10,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:43:10,006 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:10,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 29 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:43:10,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-10-13 22:43:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 789. [2024-10-13 22:43:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.2208121827411167) internal successors, (962), 788 states have internal predecessors, (962), 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-10-13 22:43:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 962 transitions. [2024-10-13 22:43:10,017 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 962 transitions. Word has length 159 [2024-10-13 22:43:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:10,017 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 962 transitions. [2024-10-13 22:43:10,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-10-13 22:43:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 962 transitions. [2024-10-13 22:43:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 22:43:10,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:10,019 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 22:43:10,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 22:43:10,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:43:10,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:10,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1768678547, now seen corresponding path program 1 times [2024-10-13 22:43:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130859804] [2024-10-13 22:43:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-13 22:43:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:10,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130859804] [2024-10-13 22:43:10,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130859804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:10,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:43:10,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:43:10,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823081480] [2024-10-13 22:43:10,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:10,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:43:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:10,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:43:10,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:43:10,310 INFO L87 Difference]: Start difference. First operand 789 states and 962 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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-10-13 22:43:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:10,579 INFO L93 Difference]: Finished difference Result 1839 states and 2240 transitions. [2024-10-13 22:43:10,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:43:10,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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 162 [2024-10-13 22:43:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:10,582 INFO L225 Difference]: With dead ends: 1839 [2024-10-13 22:43:10,582 INFO L226 Difference]: Without dead ends: 1051 [2024-10-13 22:43:10,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:43:10,583 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:10,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 46 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:43:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-13 22:43:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2024-10-13 22:43:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.1876190476190476) internal successors, (1247), 1050 states have internal predecessors, (1247), 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-10-13 22:43:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1247 transitions. [2024-10-13 22:43:10,594 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1247 transitions. Word has length 162 [2024-10-13 22:43:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:10,595 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1247 transitions. [2024-10-13 22:43:10,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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-10-13 22:43:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1247 transitions. [2024-10-13 22:43:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-13 22:43:10,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:10,597 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:43:10,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 22:43:10,597 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:10,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:10,597 INFO L85 PathProgramCache]: Analyzing trace with hash 470003006, now seen corresponding path program 1 times [2024-10-13 22:43:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:10,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761466572] [2024-10-13 22:43:10,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:10,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-13 22:43:10,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:10,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761466572] [2024-10-13 22:43:10,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761466572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:10,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:43:10,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:43:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897281394] [2024-10-13 22:43:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:10,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:43:10,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:10,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:43:10,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:43:10,729 INFO L87 Difference]: Start difference. First operand 1051 states and 1247 transitions. Second operand has 4 states, 4 states have (on average 32.5) 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-10-13 22:43:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:11,146 INFO L93 Difference]: Finished difference Result 2756 states and 3255 transitions. [2024-10-13 22:43:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:43:11,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) 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 177 [2024-10-13 22:43:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:11,150 INFO L225 Difference]: With dead ends: 2756 [2024-10-13 22:43:11,150 INFO L226 Difference]: Without dead ends: 1706 [2024-10-13 22:43:11,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:43:11,152 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 371 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:11,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 42 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:43:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-10-13 22:43:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1444. [2024-10-13 22:43:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.1711711711711712) internal successors, (1690), 1443 states have internal predecessors, (1690), 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-10-13 22:43:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1690 transitions. [2024-10-13 22:43:11,169 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1690 transitions. Word has length 177 [2024-10-13 22:43:11,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:11,169 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1690 transitions. [2024-10-13 22:43:11,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) 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-10-13 22:43:11,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1690 transitions. [2024-10-13 22:43:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-13 22:43:11,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:11,171 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:43:11,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 22:43:11,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:11,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1533740579, now seen corresponding path program 1 times [2024-10-13 22:43:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:11,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765052816] [2024-10-13 22:43:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:11,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 103 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 22:43:11,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:11,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765052816] [2024-10-13 22:43:11,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765052816] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:43:11,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068302729] [2024-10-13 22:43:11,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:11,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:43:11,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:43:11,323 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:43:11,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 22:43:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:11,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:43:11,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:43:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-13 22:43:11,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:43:11,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068302729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:11,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:43:11,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-13 22:43:11,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361332213] [2024-10-13 22:43:11,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:11,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:43:11,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:11,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:43:11,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:43:11,429 INFO L87 Difference]: Start difference. First operand 1444 states and 1690 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-10-13 22:43:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:11,701 INFO L93 Difference]: Finished difference Result 2885 states and 3326 transitions. [2024-10-13 22:43:11,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:43:11,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 195 [2024-10-13 22:43:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:11,702 INFO L225 Difference]: With dead ends: 2885 [2024-10-13 22:43:11,702 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 22:43:11,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:43:11,704 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:11,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 26 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:43:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 22:43:11,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 22:43:11,706 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-10-13 22:43:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 22:43:11,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2024-10-13 22:43:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:11,733 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 22:43:11,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-10-13 22:43:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 22:43:11,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 22:43:11,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 22:43:11,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 22:43:11,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:43:11,939 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:43:11,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 22:43:12,176 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 22:43:12,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:43:12 BoogieIcfgContainer [2024-10-13 22:43:12,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 22:43:12,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 22:43:12,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 22:43:12,189 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 22:43:12,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:43:05" (3/4) ... [2024-10-13 22:43:12,190 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 22:43:12,200 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 22:43:12,201 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 22:43:12,202 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 22:43:12,202 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 22:43:12,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 22:43:12,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 22:43:12,313 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 22:43:12,314 INFO L158 Benchmark]: Toolchain (without parser) took 8546.61ms. Allocated memory was 195.0MB in the beginning and 371.2MB in the end (delta: 176.2MB). Free memory was 146.6MB in the beginning and 263.6MB in the end (delta: -117.0MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2024-10-13 22:43:12,314 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:43:12,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.12ms. Allocated memory is still 195.0MB. Free memory was 146.6MB in the beginning and 117.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 22:43:12,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.13ms. Allocated memory is still 195.0MB. Free memory was 117.2MB in the beginning and 111.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 22:43:12,315 INFO L158 Benchmark]: Boogie Preprocessor took 89.76ms. Allocated memory is still 195.0MB. Free memory was 111.0MB in the beginning and 106.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 22:43:12,315 INFO L158 Benchmark]: RCFGBuilder took 860.30ms. Allocated memory is still 195.0MB. Free memory was 106.2MB in the beginning and 70.6MB in the end (delta: 35.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-13 22:43:12,315 INFO L158 Benchmark]: TraceAbstraction took 7029.14ms. Allocated memory was 195.0MB in the beginning and 371.2MB in the end (delta: 176.2MB). Free memory was 69.6MB in the beginning and 276.1MB in the end (delta: -206.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:43:12,315 INFO L158 Benchmark]: Witness Printer took 124.87ms. Allocated memory is still 371.2MB. Free memory was 276.1MB in the beginning and 263.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 22:43:12,317 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.12ms. Allocated memory is still 109.1MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.12ms. Allocated memory is still 195.0MB. Free memory was 146.6MB in the beginning and 117.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.13ms. Allocated memory is still 195.0MB. Free memory was 117.2MB in the beginning and 111.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.76ms. Allocated memory is still 195.0MB. Free memory was 111.0MB in the beginning and 106.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 860.30ms. Allocated memory is still 195.0MB. Free memory was 106.2MB in the beginning and 70.6MB in the end (delta: 35.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7029.14ms. Allocated memory was 195.0MB in the beginning and 371.2MB in the end (delta: 176.2MB). Free memory was 69.6MB in the beginning and 276.1MB in the end (delta: -206.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 124.87ms. Allocated memory is still 371.2MB. Free memory was 276.1MB in the beginning and 263.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 516]: 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1232 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1232 mSDsluCounter, 640 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 524 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3111 IncrementalHoareTripleChecker+Invalid, 3635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 524 mSolverCounterUnsat, 586 mSDtfsCounter, 3111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 643 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1444occurred in iteration=8, InterpolantAutomatonStates: 29, 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, 1048 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1915 NumberOfCodeBlocks, 1915 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1902 ConstructedInterpolants, 0 QuantifiedInterpolants, 7266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1236 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 798/836 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: 593]: Loop Invariant Derived loop invariant: ((((((a21 < 1) || ((a7 != 1) && (a16 <= 5))) || ((((((a12 == 8) && (a8 == 13)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || ((a7 != 1) && (15 <= a8))) || ((14 <= a8) && (a16 <= 5))) RESULT: Ultimate proved your program to be correct! [2024-10-13 22:43:12,336 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