./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-10 22:33:25,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:33:25,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:33:25,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:33:25,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:33:26,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:33:26,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:33:26,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:33:26,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:33:26,013 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:33:26,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:33:26,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:33:26,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:33:26,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:33:26,015 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:33:26,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:33:26,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:33:26,015 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:33:26,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:33:26,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:33:26,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:33:26,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:33:26,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:33:26,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:33:26,020 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:33:26,020 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:33:26,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:33:26,021 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:33:26,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:33:26,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:33:26,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:33:26,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:33:26,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:33:26,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:33:26,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:33:26,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:33:26,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:33:26,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:33:26,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:33:26,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:33:26,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:33:26,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:33:26,026 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-clean/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-clean/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-10 22:33:26,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:33:26,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:33:26,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:33:26,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:33:26,324 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:33:26,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label10.c [2024-10-10 22:33:27,800 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:33:28,062 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:33:28,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label10.c [2024-10-10 22:33:28,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3b1c3ad57/2dadfd7a264c47168a7835e13136cce4/FLAG3641470cc [2024-10-10 22:33:28,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3b1c3ad57/2dadfd7a264c47168a7835e13136cce4 [2024-10-10 22:33:28,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:33:28,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:33:28,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:33:28,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:33:28,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:33:28,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ef9d5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28, skipping insertion in model container [2024-10-10 22:33:28,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:33:28,549 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-10 22:33:28,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:33:28,584 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:33:28,650 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-10 22:33:28,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:33:28,684 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:33:28,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28 WrapperNode [2024-10-10 22:33:28,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:33:28,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:33:28,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:33:28,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:33:28,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,773 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-10-10 22:33:28,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:33:28,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:33:28,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:33:28,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:33:28,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,845 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-10 22:33:28,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:33:28,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:33:28,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:33:28,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:33:28,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (1/1) ... [2024-10-10 22:33:28,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:33:28,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:33:28,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:33:28,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:33:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:33:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:33:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:33:29,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:33:29,071 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:33:29,074 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:33:30,132 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-10 22:33:30,132 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:33:30,201 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:33:30,202 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:33:30,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:33:30 BoogieIcfgContainer [2024-10-10 22:33:30,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:33:30,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:33:30,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:33:30,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:33:30,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:33:28" (1/3) ... [2024-10-10 22:33:30,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d7a958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:33:30, skipping insertion in model container [2024-10-10 22:33:30,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:28" (2/3) ... [2024-10-10 22:33:30,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d7a958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:33:30, skipping insertion in model container [2024-10-10 22:33:30,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:33:30" (3/3) ... [2024-10-10 22:33:30,214 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label10.c [2024-10-10 22:33:30,235 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:33:30,236 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:33:30,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:33:30,315 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;@5671b0fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:33:30,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:33:30,320 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-10 22:33:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-10 22:33:30,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:30,330 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-10 22:33:30,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:30,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1499488826, now seen corresponding path program 1 times [2024-10-10 22:33:30,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:30,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662771215] [2024-10-10 22:33:30,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:30,737 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-10 22:33:30,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:30,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662771215] [2024-10-10 22:33:30,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662771215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:30,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:33:30,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:33:30,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938846330] [2024-10-10 22:33:30,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:30,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:33:30,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:30,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:33:30,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:33:30,778 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-10 22:33:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:30,820 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2024-10-10 22:33:30,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:33:30,823 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-10 22:33:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:30,832 INFO L225 Difference]: With dead ends: 271 [2024-10-10 22:33:30,832 INFO L226 Difference]: Without dead ends: 134 [2024-10-10 22:33:30,836 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-10 22:33:30,840 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-10 22:33:30,841 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-10 22:33:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-10 22:33:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-10 22:33:30,884 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-10 22:33:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-10-10 22:33:30,887 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 109 [2024-10-10 22:33:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:30,888 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-10-10 22:33:30,889 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-10 22:33:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-10-10 22:33:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-10 22:33:30,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:30,891 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-10 22:33:30,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:33:30,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:30,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:30,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1827766489, now seen corresponding path program 1 times [2024-10-10 22:33:30,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:30,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466326755] [2024-10-10 22:33:30,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:30,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:31,468 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-10 22:33:31,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:31,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466326755] [2024-10-10 22:33:31,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466326755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:31,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:33:31,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:33:31,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613754970] [2024-10-10 22:33:31,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:31,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:33:31,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:31,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:33:31,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:33:31,476 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-10 22:33:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:32,369 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2024-10-10 22:33:32,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:33:32,370 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-10 22:33:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:32,375 INFO L225 Difference]: With dead ends: 529 [2024-10-10 22:33:32,375 INFO L226 Difference]: Without dead ends: 396 [2024-10-10 22:33:32,376 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-10 22:33:32,377 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 300 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:33:32,380 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.8s Time] [2024-10-10 22:33:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-10 22:33:32,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-10-10 22:33:32,415 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-10 22:33:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 516 transitions. [2024-10-10 22:33:32,417 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 516 transitions. Word has length 109 [2024-10-10 22:33:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:32,417 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 516 transitions. [2024-10-10 22:33:32,418 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-10 22:33:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 516 transitions. [2024-10-10 22:33:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-10 22:33:32,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:32,421 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-10 22:33:32,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:33:32,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:32,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1147579718, now seen corresponding path program 1 times [2024-10-10 22:33:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:32,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198974431] [2024-10-10 22:33:32,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:32,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:32,831 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-10 22:33:32,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:32,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198974431] [2024-10-10 22:33:32,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198974431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:32,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:33:32,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:33:32,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179180772] [2024-10-10 22:33:32,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:32,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:33:32,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:32,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:33:32,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:33:32,835 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-10 22:33:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:33,491 INFO L93 Difference]: Finished difference Result 886 states and 1234 transitions. [2024-10-10 22:33:33,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:33:33,494 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-10 22:33:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:33,497 INFO L225 Difference]: With dead ends: 886 [2024-10-10 22:33:33,497 INFO L226 Difference]: Without dead ends: 527 [2024-10-10 22:33:33,499 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-10 22:33:33,501 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 126 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:33:33,503 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.6s Time] [2024-10-10 22:33:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-10 22:33:33,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 396. [2024-10-10 22:33:33,520 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-10 22:33:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 473 transitions. [2024-10-10 22:33:33,521 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 473 transitions. Word has length 116 [2024-10-10 22:33:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:33,522 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 473 transitions. [2024-10-10 22:33:33,522 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-10 22:33:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 473 transitions. [2024-10-10 22:33:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-10 22:33:33,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:33,525 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-10 22:33:33,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:33:33,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:33,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash -509698440, now seen corresponding path program 1 times [2024-10-10 22:33:33,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:33,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867983889] [2024-10-10 22:33:33,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:33,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:33,760 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-10 22:33:33,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:33,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867983889] [2024-10-10 22:33:33,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867983889] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:33:33,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718171391] [2024-10-10 22:33:33,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:33,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:33:33,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:33:33,765 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:33:33,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:33:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:33,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:33:33,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:33:34,128 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-10 22:33:34,131 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:33:34,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718171391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:34,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:33:34,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:33:34,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286357899] [2024-10-10 22:33:34,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:34,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:33:34,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:34,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:33:34,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:33:34,137 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-10 22:33:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:34,559 INFO L93 Difference]: Finished difference Result 1184 states and 1416 transitions. [2024-10-10 22:33:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:33:34,560 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-10 22:33:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:34,565 INFO L225 Difference]: With dead ends: 1184 [2024-10-10 22:33:34,565 INFO L226 Difference]: Without dead ends: 789 [2024-10-10 22:33:34,567 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-10 22:33:34,568 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 33 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:33:34,568 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.4s Time] [2024-10-10 22:33:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-10-10 22:33:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 658. [2024-10-10 22:33:34,603 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-10 22:33:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 807 transitions. [2024-10-10 22:33:34,606 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 807 transitions. Word has length 124 [2024-10-10 22:33:34,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:34,606 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 807 transitions. [2024-10-10 22:33:34,607 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-10 22:33:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 807 transitions. [2024-10-10 22:33:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-10 22:33:34,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:34,615 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-10 22:33:34,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:33:34,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:33:34,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:34,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:34,817 INFO L85 PathProgramCache]: Analyzing trace with hash 476577963, now seen corresponding path program 1 times [2024-10-10 22:33:34,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:34,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630094291] [2024-10-10 22:33:34,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:34,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:35,084 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-10 22:33:35,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:35,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630094291] [2024-10-10 22:33:35,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630094291] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:33:35,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162998509] [2024-10-10 22:33:35,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:35,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:33:35,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:33:35,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:33:35,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:33:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:35,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:33:35,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:33:35,364 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-10 22:33:35,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:33:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162998509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:35,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:33:35,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:33:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605093127] [2024-10-10 22:33:35,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:35,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:33:35,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:35,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:33:35,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:33:35,367 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-10 22:33:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:35,742 INFO L93 Difference]: Finished difference Result 1577 states and 1967 transitions. [2024-10-10 22:33:35,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:33:35,742 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-10 22:33:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:35,746 INFO L225 Difference]: With dead ends: 1577 [2024-10-10 22:33:35,747 INFO L226 Difference]: Without dead ends: 920 [2024-10-10 22:33:35,748 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-10 22:33:35,749 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-10 22:33:35,749 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-10 22:33:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-10 22:33:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 789. [2024-10-10 22:33:35,766 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-10 22:33:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 962 transitions. [2024-10-10 22:33:35,769 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 962 transitions. Word has length 143 [2024-10-10 22:33:35,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:35,769 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 962 transitions. [2024-10-10 22:33:35,770 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-10 22:33:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 962 transitions. [2024-10-10 22:33:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-10 22:33:35,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:35,773 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-10 22:33:35,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 22:33:35,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:33:35,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:35,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1455077487, now seen corresponding path program 1 times [2024-10-10 22:33:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:35,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463987302] [2024-10-10 22:33:35,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:36,281 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-10 22:33:36,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:36,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463987302] [2024-10-10 22:33:36,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463987302] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:33:36,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758777331] [2024-10-10 22:33:36,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:36,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:33:36,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:33:36,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:33:36,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:33:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:36,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:33:36,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:33:36,428 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-10 22:33:36,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:33:36,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758777331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:36,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:33:36,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:33:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769372688] [2024-10-10 22:33:36,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:36,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:33:36,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:36,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:33:36,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:33:36,432 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-10 22:33:36,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:36,833 INFO L93 Difference]: Finished difference Result 1970 states and 2391 transitions. [2024-10-10 22:33:36,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:33:36,833 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-10 22:33:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:36,838 INFO L225 Difference]: With dead ends: 1970 [2024-10-10 22:33:36,838 INFO L226 Difference]: Without dead ends: 1182 [2024-10-10 22:33:36,839 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-10 22:33:36,842 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:33:36,844 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.4s Time] [2024-10-10 22:33:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-10-10 22:33:36,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 789. [2024-10-10 22:33:36,864 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-10 22:33:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 962 transitions. [2024-10-10 22:33:36,867 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 962 transitions. Word has length 159 [2024-10-10 22:33:36,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:36,867 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 962 transitions. [2024-10-10 22:33:36,868 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-10 22:33:36,868 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 962 transitions. [2024-10-10 22:33:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-10 22:33:36,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:36,870 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-10 22:33:36,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:33:37,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:33:37,071 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:37,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:37,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1768678547, now seen corresponding path program 1 times [2024-10-10 22:33:37,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:37,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161053417] [2024-10-10 22:33:37,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:37,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:37,234 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-10 22:33:37,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:37,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161053417] [2024-10-10 22:33:37,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161053417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:37,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:33:37,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:33:37,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461640051] [2024-10-10 22:33:37,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:37,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:33:37,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:37,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:33:37,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:33:37,237 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-10 22:33:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:37,618 INFO L93 Difference]: Finished difference Result 1839 states and 2240 transitions. [2024-10-10 22:33:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:33:37,618 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-10 22:33:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:37,622 INFO L225 Difference]: With dead ends: 1839 [2024-10-10 22:33:37,622 INFO L226 Difference]: Without dead ends: 1051 [2024-10-10 22:33:37,623 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-10 22:33:37,625 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:33:37,625 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.4s Time] [2024-10-10 22:33:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-10 22:33:37,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2024-10-10 22:33:37,641 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-10 22:33:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1247 transitions. [2024-10-10 22:33:37,644 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1247 transitions. Word has length 162 [2024-10-10 22:33:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:37,645 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1247 transitions. [2024-10-10 22:33:37,645 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-10 22:33:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1247 transitions. [2024-10-10 22:33:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-10 22:33:37,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:37,648 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-10 22:33:37,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:33:37,648 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:37,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:37,649 INFO L85 PathProgramCache]: Analyzing trace with hash 470003006, now seen corresponding path program 1 times [2024-10-10 22:33:37,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:37,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966118458] [2024-10-10 22:33:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:37,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:37,856 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-10 22:33:37,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966118458] [2024-10-10 22:33:37,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966118458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:37,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:33:37,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:33:37,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007502192] [2024-10-10 22:33:37,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:37,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:33:37,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:37,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:33:37,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:33:37,859 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-10 22:33:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:38,442 INFO L93 Difference]: Finished difference Result 2756 states and 3255 transitions. [2024-10-10 22:33:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:33:38,442 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-10 22:33:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:38,448 INFO L225 Difference]: With dead ends: 2756 [2024-10-10 22:33:38,448 INFO L226 Difference]: Without dead ends: 1706 [2024-10-10 22:33:38,450 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-10 22:33:38,451 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 371 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:33:38,451 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.5s Time] [2024-10-10 22:33:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-10-10 22:33:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1444. [2024-10-10 22:33:38,476 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-10 22:33:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1690 transitions. [2024-10-10 22:33:38,481 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1690 transitions. Word has length 177 [2024-10-10 22:33:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:38,481 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1690 transitions. [2024-10-10 22:33:38,481 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-10 22:33:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1690 transitions. [2024-10-10 22:33:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-10 22:33:38,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:38,485 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-10 22:33:38,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:33:38,486 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:38,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:38,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1533740579, now seen corresponding path program 1 times [2024-10-10 22:33:38,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:38,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510628307] [2024-10-10 22:33:38,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:38,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:38,750 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-10 22:33:38,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510628307] [2024-10-10 22:33:38,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510628307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:33:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798941264] [2024-10-10 22:33:38,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:38,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:33:38,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:33:38,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:33:38,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:33:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:38,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:33:38,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:33:38,902 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-10 22:33:38,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:33:38,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798941264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:38,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:33:38,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:33:38,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626358407] [2024-10-10 22:33:38,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:38,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:33:38,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:38,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:33:38,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:33:38,905 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-10 22:33:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:39,311 INFO L93 Difference]: Finished difference Result 2885 states and 3326 transitions. [2024-10-10 22:33:39,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:33:39,312 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-10 22:33:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:39,313 INFO L225 Difference]: With dead ends: 2885 [2024-10-10 22:33:39,313 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:33:39,316 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-10 22:33:39,317 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:33:39,317 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.4s Time] [2024-10-10 22:33:39,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:33:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:33:39,318 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-10 22:33:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:33:39,318 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2024-10-10 22:33:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:39,318 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:33:39,318 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-10 22:33:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:33:39,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:33:39,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:33:39,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 22:33:39,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-10 22:33:39,527 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:33:39,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:33:39,834 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:33:39,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:33:39 BoogieIcfgContainer [2024-10-10 22:33:39,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:33:39,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:33:39,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:33:39,854 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:33:39,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:33:30" (3/4) ... [2024-10-10 22:33:39,857 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:33:39,881 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 22:33:39,882 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:33:39,883 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:33:39,884 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:33:40,022 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:33:40,023 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:33:40,023 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:33:40,024 INFO L158 Benchmark]: Toolchain (without parser) took 11917.20ms. Allocated memory was 178.3MB in the beginning and 276.8MB in the end (delta: 98.6MB). Free memory was 107.9MB in the beginning and 195.3MB in the end (delta: -87.4MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-10 22:33:40,025 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 113.2MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:33:40,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.46ms. Allocated memory is still 178.3MB. Free memory was 107.7MB in the beginning and 132.4MB in the end (delta: -24.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 22:33:40,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.02ms. Allocated memory is still 178.3MB. Free memory was 132.4MB in the beginning and 126.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:33:40,025 INFO L158 Benchmark]: Boogie Preprocessor took 132.89ms. Allocated memory is still 178.3MB. Free memory was 126.1MB in the beginning and 121.2MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:33:40,026 INFO L158 Benchmark]: RCFGBuilder took 1295.40ms. Allocated memory is still 178.3MB. Free memory was 121.2MB in the beginning and 95.6MB in the end (delta: 25.6MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2024-10-10 22:33:40,026 INFO L158 Benchmark]: TraceAbstraction took 9647.71ms. Allocated memory was 178.3MB in the beginning and 276.8MB in the end (delta: 98.6MB). Free memory was 95.6MB in the beginning and 207.9MB in the end (delta: -112.3MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. [2024-10-10 22:33:40,027 INFO L158 Benchmark]: Witness Printer took 169.21ms. Allocated memory is still 276.8MB. Free memory was 207.9MB in the beginning and 195.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:33:40,029 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.23ms. Allocated memory is still 113.2MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 578.46ms. Allocated memory is still 178.3MB. Free memory was 107.7MB in the beginning and 132.4MB in the end (delta: -24.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.02ms. Allocated memory is still 178.3MB. Free memory was 132.4MB in the beginning and 126.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.89ms. Allocated memory is still 178.3MB. Free memory was 126.1MB in the beginning and 121.2MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1295.40ms. Allocated memory is still 178.3MB. Free memory was 121.2MB in the beginning and 95.6MB in the end (delta: 25.6MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9647.71ms. Allocated memory was 178.3MB in the beginning and 276.8MB in the end (delta: 98.6MB). Free memory was 95.6MB in the beginning and 207.9MB in the end (delta: -112.3MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. * Witness Printer took 169.21ms. Allocated memory is still 276.8MB. Free memory was 207.9MB in the beginning and 195.3MB 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: 9.2s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1232 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1232 mSDsluCounter, 640 SdHoareTripleChecker+Invalid, 3.2s 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.4s SatisfiabilityAnalysisTime, 2.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-10 22:33:40,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE