./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label54.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f137b4cfcf2c394c1a64ac698bc08e2e305ac6959ca2787cbc9ca23749e2553 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:29:40,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:29:40,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:29:40,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:29:40,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:29:40,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:29:40,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:29:40,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:29:40,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:29:40,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:29:40,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:29:40,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:29:40,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:29:40,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:29:40,905 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:29:40,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:29:40,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:29:40,905 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:29:40,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:29:40,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:29:40,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:29:40,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:29:40,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:29:40,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:29:40,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:29:40,909 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:29:40,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:29:40,910 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:29:40,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:29:40,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:29:40,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:29:40,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:29:40,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:29:40,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:29:40,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:29:40,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:29:40,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:29:40,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:29:40,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:29:40,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:29:40,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:29:40,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:29:40,913 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f137b4cfcf2c394c1a64ac698bc08e2e305ac6959ca2787cbc9ca23749e2553 [2024-11-09 19:29:41,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:29:41,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:29:41,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:29:41,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:29:41,139 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:29:41,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label54.c [2024-11-09 19:29:42,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:29:42,805 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:29:42,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label54.c [2024-11-09 19:29:42,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f2fac25/4916bf87a3734eb58eb0ca7cc07f2565/FLAGcdbe28d3e [2024-11-09 19:29:42,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f2fac25/4916bf87a3734eb58eb0ca7cc07f2565 [2024-11-09 19:29:42,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:29:42,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:29:42,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:29:42,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:29:42,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:29:42,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:29:42" (1/1) ... [2024-11-09 19:29:42,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c27956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:42, skipping insertion in model container [2024-11-09 19:29:42,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:29:42" (1/1) ... [2024-11-09 19:29:42,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:29:43,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label54.c[4370,4383] [2024-11-09 19:29:43,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:29:43,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:29:43,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label54.c[4370,4383] [2024-11-09 19:29:44,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:29:44,132 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:29:44,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44 WrapperNode [2024-11-09 19:29:44,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:29:44,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:29:44,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:29:44,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:29:44,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (1/1) ... [2024-11-09 19:29:44,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (1/1) ... [2024-11-09 19:29:44,463 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4760 [2024-11-09 19:29:44,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:29:44,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:29:44,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:29:44,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:29:44,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (1/1) ... [2024-11-09 19:29:44,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (1/1) ... [2024-11-09 19:29:44,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (1/1) ... [2024-11-09 19:29:44,627 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:29:44,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (1/1) ... [2024-11-09 19:29:44,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (1/1) ... [2024-11-09 19:29:44,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (1/1) ... [2024-11-09 19:29:44,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (1/1) ... [2024-11-09 19:29:44,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (1/1) ... [2024-11-09 19:29:44,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (1/1) ... [2024-11-09 19:29:44,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:29:44,886 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:29:44,887 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:29:44,887 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:29:44,888 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (1/1) ... [2024-11-09 19:29:44,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:29:44,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:29:44,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:29:44,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:29:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:29:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:29:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:29:44,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:29:45,001 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:29:45,003 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:29:48,858 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:29:48,859 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2024-11-09 19:29:48,859 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:29:49,199 INFO L? ?]: Removed 2039 outVars from TransFormulas that were not future-live. [2024-11-09 19:29:49,199 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:29:49,226 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:29:49,226 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:29:49,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:29:49 BoogieIcfgContainer [2024-11-09 19:29:49,227 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:29:49,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:29:49,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:29:49,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:29:49,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:29:42" (1/3) ... [2024-11-09 19:29:49,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a29c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:29:49, skipping insertion in model container [2024-11-09 19:29:49,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:44" (2/3) ... [2024-11-09 19:29:49,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a29c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:29:49, skipping insertion in model container [2024-11-09 19:29:49,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:29:49" (3/3) ... [2024-11-09 19:29:49,233 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label54.c [2024-11-09 19:29:49,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:29:49,246 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:29:49,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:29:49,321 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;@55b3c6e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:29:49,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:29:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 19:29:49,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:49,334 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] [2024-11-09 19:29:49,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:49,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:49,339 INFO L85 PathProgramCache]: Analyzing trace with hash -89930413, now seen corresponding path program 1 times [2024-11-09 19:29:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:49,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862800168] [2024-11-09 19:29:49,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:49,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:29:49,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:49,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862800168] [2024-11-09 19:29:49,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862800168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:49,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:49,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:29:49,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804515573] [2024-11-09 19:29:49,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:49,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:29:49,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:49,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:29:49,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:29:49,719 INFO L87 Difference]: Start difference. First operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 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 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:56,733 INFO L93 Difference]: Finished difference Result 3163 states and 8878 transitions. [2024-11-09 19:29:56,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 19:29:56,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2024-11-09 19:29:56,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:56,758 INFO L225 Difference]: With dead ends: 3163 [2024-11-09 19:29:56,759 INFO L226 Difference]: Without dead ends: 2270 [2024-11-09 19:29:56,764 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-11-09 19:29:56,767 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 4472 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5774 mSolverCounterSat, 1719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4472 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 7493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1719 IncrementalHoareTripleChecker+Valid, 5774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:56,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4472 Valid, 241 Invalid, 7493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1719 Valid, 5774 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-09 19:29:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2024-11-09 19:29:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2261. [2024-11-09 19:29:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 2.436725663716814) internal successors, (5507), 2260 states have internal predecessors, (5507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 5507 transitions. [2024-11-09 19:29:56,873 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 5507 transitions. Word has length 35 [2024-11-09 19:29:56,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:56,874 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 5507 transitions. [2024-11-09 19:29:56,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 5507 transitions. [2024-11-09 19:29:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 19:29:56,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:56,878 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:56,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:29:56,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:56,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1879324567, now seen corresponding path program 1 times [2024-11-09 19:29:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:56,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572833956] [2024-11-09 19:29:56,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:56,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:29:57,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:57,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572833956] [2024-11-09 19:29:57,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572833956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:57,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:57,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:29:57,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140315631] [2024-11-09 19:29:57,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:57,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:29:57,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:57,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:29:57,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:29:57,286 INFO L87 Difference]: Start difference. First operand 2261 states and 5507 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:01,886 INFO L93 Difference]: Finished difference Result 6062 states and 15115 transitions. [2024-11-09 19:30:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:30:01,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 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-11-09 19:30:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:01,899 INFO L225 Difference]: With dead ends: 6062 [2024-11-09 19:30:01,899 INFO L226 Difference]: Without dead ends: 3765 [2024-11-09 19:30:01,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:01,902 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 1368 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5844 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 6508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 5844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:01,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 719 Invalid, 6508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 5844 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 19:30:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2024-11-09 19:30:01,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3765. [2024-11-09 19:30:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 3764 states have (on average 2.2436238044633368) internal successors, (8445), 3764 states have internal predecessors, (8445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 8445 transitions. [2024-11-09 19:30:01,953 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 8445 transitions. Word has length 177 [2024-11-09 19:30:01,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:01,954 INFO L471 AbstractCegarLoop]: Abstraction has 3765 states and 8445 transitions. [2024-11-09 19:30:01,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 8445 transitions. [2024-11-09 19:30:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-09 19:30:01,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:01,958 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:01,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:30:01,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:01,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash -687652823, now seen corresponding path program 1 times [2024-11-09 19:30:01,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:01,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443562960] [2024-11-09 19:30:01,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:01,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 63 proven. 55 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 19:30:02,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:02,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443562960] [2024-11-09 19:30:02,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443562960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:30:02,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269882841] [2024-11-09 19:30:02,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:02,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:30:02,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:30:02,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:30:02,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:30:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:02,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:30:02,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:30:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 19:30:02,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:30:02,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269882841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:02,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:30:02,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 19:30:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963597119] [2024-11-09 19:30:02,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:02,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:02,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:02,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:02,800 INFO L87 Difference]: Start difference. First operand 3765 states and 8445 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:05,803 INFO L93 Difference]: Finished difference Result 10536 states and 23892 transitions. [2024-11-09 19:30:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:05,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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 247 [2024-11-09 19:30:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:05,850 INFO L225 Difference]: With dead ends: 10536 [2024-11-09 19:30:05,853 INFO L226 Difference]: Without dead ends: 6773 [2024-11-09 19:30:05,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:05,866 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1350 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3349 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 4194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 3349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:05,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 489 Invalid, 4194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 3349 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 19:30:05,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2024-11-09 19:30:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6021. [2024-11-09 19:30:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6021 states, 6020 states have (on average 2.184717607973422) internal successors, (13152), 6020 states have internal predecessors, (13152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6021 states to 6021 states and 13152 transitions. [2024-11-09 19:30:06,001 INFO L78 Accepts]: Start accepts. Automaton has 6021 states and 13152 transitions. Word has length 247 [2024-11-09 19:30:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:06,002 INFO L471 AbstractCegarLoop]: Abstraction has 6021 states and 13152 transitions. [2024-11-09 19:30:06,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 6021 states and 13152 transitions. [2024-11-09 19:30:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-09 19:30:06,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:06,007 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:06,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:30:06,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:30:06,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:06,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:06,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1608634205, now seen corresponding path program 1 times [2024-11-09 19:30:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:06,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257975153] [2024-11-09 19:30:06,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:06,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 63 proven. 55 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 19:30:06,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:06,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257975153] [2024-11-09 19:30:06,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257975153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:30:06,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18940682] [2024-11-09 19:30:06,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:06,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:30:06,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:30:06,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:30:06,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:30:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:06,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:30:06,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:30:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:07,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:30:07,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18940682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:07,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:30:07,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-09 19:30:07,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104028805] [2024-11-09 19:30:07,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:07,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:07,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:07,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:07,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:07,107 INFO L87 Difference]: Start difference. First operand 6021 states and 13152 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:10,532 INFO L93 Difference]: Finished difference Result 15048 states and 33556 transitions. [2024-11-09 19:30:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:10,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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 260 [2024-11-09 19:30:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:10,567 INFO L225 Difference]: With dead ends: 15048 [2024-11-09 19:30:10,567 INFO L226 Difference]: Without dead ends: 9029 [2024-11-09 19:30:10,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:10,577 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1589 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3432 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 4135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 3432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:10,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 312 Invalid, 4135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 3432 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:30:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9029 states. [2024-11-09 19:30:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9029 to 9029. [2024-11-09 19:30:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9029 states, 9028 states have (on average 2.1692512184315462) internal successors, (19584), 9028 states have internal predecessors, (19584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9029 states to 9029 states and 19584 transitions. [2024-11-09 19:30:10,757 INFO L78 Accepts]: Start accepts. Automaton has 9029 states and 19584 transitions. Word has length 260 [2024-11-09 19:30:10,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:10,759 INFO L471 AbstractCegarLoop]: Abstraction has 9029 states and 19584 transitions. [2024-11-09 19:30:10,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:10,759 INFO L276 IsEmpty]: Start isEmpty. Operand 9029 states and 19584 transitions. [2024-11-09 19:30:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-09 19:30:10,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:10,762 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:30:10,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:30:10,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 19:30:10,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:10,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1869588611, now seen corresponding path program 1 times [2024-11-09 19:30:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:10,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972801628] [2024-11-09 19:30:10,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 19:30:11,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:11,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972801628] [2024-11-09 19:30:11,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972801628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:11,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:11,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:11,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710935820] [2024-11-09 19:30:11,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:11,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:11,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:11,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:11,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:11,132 INFO L87 Difference]: Start difference. First operand 9029 states and 19584 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:14,745 INFO L93 Difference]: Finished difference Result 25576 states and 55869 transitions. [2024-11-09 19:30:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:14,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 277 [2024-11-09 19:30:14,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:14,773 INFO L225 Difference]: With dead ends: 25576 [2024-11-09 19:30:14,774 INFO L226 Difference]: Without dead ends: 16549 [2024-11-09 19:30:14,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:14,785 INFO L432 NwaCegarLoop]: 2000 mSDtfsCounter, 1405 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 4046 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 4419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 4046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:14,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 2010 Invalid, 4419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 4046 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:30:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16549 states. [2024-11-09 19:30:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16549 to 15797. [2024-11-09 19:30:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15797 states, 15796 states have (on average 2.15605216510509) internal successors, (34057), 15796 states have internal predecessors, (34057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15797 states to 15797 states and 34057 transitions. [2024-11-09 19:30:15,002 INFO L78 Accepts]: Start accepts. Automaton has 15797 states and 34057 transitions. Word has length 277 [2024-11-09 19:30:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:15,002 INFO L471 AbstractCegarLoop]: Abstraction has 15797 states and 34057 transitions. [2024-11-09 19:30:15,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 15797 states and 34057 transitions. [2024-11-09 19:30:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-09 19:30:15,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:15,009 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:15,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:30:15,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:15,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1243759974, now seen corresponding path program 1 times [2024-11-09 19:30:15,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:15,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399852201] [2024-11-09 19:30:15,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:15,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 95 proven. 110 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-09 19:30:15,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:15,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399852201] [2024-11-09 19:30:15,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399852201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:30:15,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9814197] [2024-11-09 19:30:15,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:15,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:30:15,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:30:15,424 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:30:15,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:30:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:15,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:30:15,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:30:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-09 19:30:15,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:30:15,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9814197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:15,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:30:15,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-09 19:30:15,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293115622] [2024-11-09 19:30:15,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:15,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:15,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:15,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:15,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:15,622 INFO L87 Difference]: Start difference. First operand 15797 states and 34057 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:19,422 INFO L93 Difference]: Finished difference Result 38360 states and 83021 transitions. [2024-11-09 19:30:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:19,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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 327 [2024-11-09 19:30:19,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:19,469 INFO L225 Difference]: With dead ends: 38360 [2024-11-09 19:30:19,469 INFO L226 Difference]: Without dead ends: 22565 [2024-11-09 19:30:19,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:19,485 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1473 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3435 mSolverCounterSat, 843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 4278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 3435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:19,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 241 Invalid, 4278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [843 Valid, 3435 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:30:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22565 states. [2024-11-09 19:30:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22565 to 22565. [2024-11-09 19:30:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22565 states, 22564 states have (on average 2.108801630916504) internal successors, (47583), 22564 states have internal predecessors, (47583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22565 states to 22565 states and 47583 transitions. [2024-11-09 19:30:19,856 INFO L78 Accepts]: Start accepts. Automaton has 22565 states and 47583 transitions. Word has length 327 [2024-11-09 19:30:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:19,856 INFO L471 AbstractCegarLoop]: Abstraction has 22565 states and 47583 transitions. [2024-11-09 19:30:19,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 22565 states and 47583 transitions. [2024-11-09 19:30:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-09 19:30:19,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:19,860 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:19,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 19:30:20,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:30:20,062 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:20,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:20,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1562420520, now seen corresponding path program 1 times [2024-11-09 19:30:20,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:20,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343952234] [2024-11-09 19:30:20,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:20,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-09 19:30:20,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:20,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343952234] [2024-11-09 19:30:20,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343952234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:20,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:20,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:20,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299865425] [2024-11-09 19:30:20,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:20,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:20,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:20,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:20,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:20,210 INFO L87 Difference]: Start difference. First operand 22565 states and 47583 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:24,353 INFO L93 Difference]: Finished difference Result 45128 states and 95164 transitions. [2024-11-09 19:30:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:24,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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 332 [2024-11-09 19:30:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:24,388 INFO L225 Difference]: With dead ends: 45128 [2024-11-09 19:30:24,389 INFO L226 Difference]: Without dead ends: 22565 [2024-11-09 19:30:24,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:24,407 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1418 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3638 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 4273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 3638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:24,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 250 Invalid, 4273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 3638 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 19:30:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22565 states. [2024-11-09 19:30:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22565 to 22565. [2024-11-09 19:30:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22565 states, 22564 states have (on average 2.095772026236483) internal successors, (47289), 22564 states have internal predecessors, (47289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22565 states to 22565 states and 47289 transitions. [2024-11-09 19:30:24,823 INFO L78 Accepts]: Start accepts. Automaton has 22565 states and 47289 transitions. Word has length 332 [2024-11-09 19:30:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:24,823 INFO L471 AbstractCegarLoop]: Abstraction has 22565 states and 47289 transitions. [2024-11-09 19:30:24,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 22565 states and 47289 transitions. [2024-11-09 19:30:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-11-09 19:30:24,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:24,828 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:24,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:30:24,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:24,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash -966143022, now seen corresponding path program 1 times [2024-11-09 19:30:24,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:24,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123214317] [2024-11-09 19:30:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 19:30:25,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:25,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123214317] [2024-11-09 19:30:25,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123214317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:25,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:25,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:25,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767144486] [2024-11-09 19:30:25,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:25,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:25,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:25,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:25,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:25,174 INFO L87 Difference]: Start difference. First operand 22565 states and 47289 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:29,139 INFO L93 Difference]: Finished difference Result 60920 states and 128636 transitions. [2024-11-09 19:30:29,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:29,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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 343 [2024-11-09 19:30:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:29,197 INFO L225 Difference]: With dead ends: 60920 [2024-11-09 19:30:29,197 INFO L226 Difference]: Without dead ends: 38357 [2024-11-09 19:30:29,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:29,215 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 1379 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3660 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 4294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 3660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:29,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 569 Invalid, 4294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [634 Valid, 3660 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:30:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38357 states. [2024-11-09 19:30:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38357 to 37605. [2024-11-09 19:30:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37605 states, 37604 states have (on average 2.083608126795022) internal successors, (78352), 37604 states have internal predecessors, (78352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37605 states to 37605 states and 78352 transitions. [2024-11-09 19:30:30,026 INFO L78 Accepts]: Start accepts. Automaton has 37605 states and 78352 transitions. Word has length 343 [2024-11-09 19:30:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:30,027 INFO L471 AbstractCegarLoop]: Abstraction has 37605 states and 78352 transitions. [2024-11-09 19:30:30,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 37605 states and 78352 transitions. [2024-11-09 19:30:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-09 19:30:30,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:30,033 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:30,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:30:30,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:30,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1481618972, now seen corresponding path program 1 times [2024-11-09 19:30:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:30,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152135761] [2024-11-09 19:30:30,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-09 19:30:30,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:30,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152135761] [2024-11-09 19:30:30,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152135761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:30,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:30,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:30,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901790386] [2024-11-09 19:30:30,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:30,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:30,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:30,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:30,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:30,598 INFO L87 Difference]: Start difference. First operand 37605 states and 78352 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:34,206 INFO L93 Difference]: Finished difference Result 84984 states and 176519 transitions. [2024-11-09 19:30:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:34,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 369 [2024-11-09 19:30:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:34,272 INFO L225 Difference]: With dead ends: 84984 [2024-11-09 19:30:34,272 INFO L226 Difference]: Without dead ends: 47381 [2024-11-09 19:30:34,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:34,448 INFO L432 NwaCegarLoop]: 1584 mSDtfsCounter, 1515 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3497 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 4092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 3497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:34,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1594 Invalid, 4092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 3497 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:30:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47381 states. [2024-11-09 19:30:35,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47381 to 44373. [2024-11-09 19:30:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44373 states, 44372 states have (on average 2.041399981970612) internal successors, (90581), 44372 states have internal predecessors, (90581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44373 states to 44373 states and 90581 transitions. [2024-11-09 19:30:35,493 INFO L78 Accepts]: Start accepts. Automaton has 44373 states and 90581 transitions. Word has length 369 [2024-11-09 19:30:35,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:35,494 INFO L471 AbstractCegarLoop]: Abstraction has 44373 states and 90581 transitions. [2024-11-09 19:30:35,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 44373 states and 90581 transitions. [2024-11-09 19:30:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2024-11-09 19:30:35,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:35,520 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:35,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:30:35,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:35,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:35,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1392688291, now seen corresponding path program 1 times [2024-11-09 19:30:35,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:35,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598648006] [2024-11-09 19:30:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-09 19:30:36,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:36,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598648006] [2024-11-09 19:30:36,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598648006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:36,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:36,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:36,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783703695] [2024-11-09 19:30:36,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:36,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:36,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:36,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:36,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:36,452 INFO L87 Difference]: Start difference. First operand 44373 states and 90581 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:40,587 INFO L93 Difference]: Finished difference Result 103784 states and 212213 transitions. [2024-11-09 19:30:40,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:40,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 555 [2024-11-09 19:30:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:40,656 INFO L225 Difference]: With dead ends: 103784 [2024-11-09 19:30:40,656 INFO L226 Difference]: Without dead ends: 59413 [2024-11-09 19:30:40,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:40,677 INFO L432 NwaCegarLoop]: 1972 mSDtfsCounter, 1260 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 4216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:40,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 1982 Invalid, 4216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:30:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59413 states. [2024-11-09 19:30:41,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59413 to 57157. [2024-11-09 19:30:41,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57157 states, 57156 states have (on average 2.022517321016166) internal successors, (115599), 57156 states have internal predecessors, (115599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57157 states to 57157 states and 115599 transitions. [2024-11-09 19:30:41,512 INFO L78 Accepts]: Start accepts. Automaton has 57157 states and 115599 transitions. Word has length 555 [2024-11-09 19:30:41,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:41,513 INFO L471 AbstractCegarLoop]: Abstraction has 57157 states and 115599 transitions. [2024-11-09 19:30:41,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 57157 states and 115599 transitions. [2024-11-09 19:30:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2024-11-09 19:30:41,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:41,571 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:41,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:30:41,571 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:41,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:41,572 INFO L85 PathProgramCache]: Analyzing trace with hash -25249088, now seen corresponding path program 1 times [2024-11-09 19:30:41,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:41,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765063189] [2024-11-09 19:30:41,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:41,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2024-11-09 19:30:42,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765063189] [2024-11-09 19:30:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765063189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:42,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:42,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:42,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415883516] [2024-11-09 19:30:42,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:42,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:42,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:42,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:42,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:42,179 INFO L87 Difference]: Start difference. First operand 57157 states and 115599 transitions. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:46,393 INFO L93 Difference]: Finished difference Result 115813 states and 234385 transitions. [2024-11-09 19:30:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:46,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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 983 [2024-11-09 19:30:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:46,395 INFO L225 Difference]: With dead ends: 115813 [2024-11-09 19:30:46,396 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:30:46,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:46,419 INFO L432 NwaCegarLoop]: 1811 mSDtfsCounter, 1508 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3568 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 4007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 3568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:46,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1819 Invalid, 4007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 3568 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:30:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:30:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:30:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:30:46,421 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 983 [2024-11-09 19:30:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:46,421 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:30:46,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:30:46,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:30:46,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:30:46,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:30:46,427 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:46,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:30:47,290 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:30:47,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:30:47 BoogieIcfgContainer [2024-11-09 19:30:47,300 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:30:47,301 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:30:47,301 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:30:47,301 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:30:47,301 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:29:49" (3/4) ... [2024-11-09 19:30:47,303 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:30:47,358 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-09 19:30:47,366 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:30:47,373 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:30:47,376 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:30:47,699 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:30:47,700 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:30:47,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:30:47,700 INFO L158 Benchmark]: Toolchain (without parser) took 64847.92ms. Allocated memory was 178.3MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 96.0MB in the beginning and 7.0GB in the end (delta: -6.9GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-09 19:30:47,701 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:30:47,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1279.00ms. Allocated memory is still 178.3MB. Free memory was 95.5MB in the beginning and 85.9MB in the end (delta: 9.6MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. [2024-11-09 19:30:47,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 332.65ms. Allocated memory was 178.3MB in the beginning and 316.7MB in the end (delta: 138.4MB). Free memory was 85.9MB in the beginning and 219.0MB in the end (delta: -133.2MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2024-11-09 19:30:47,701 INFO L158 Benchmark]: Boogie Preprocessor took 419.03ms. Allocated memory is still 316.7MB. Free memory was 219.0MB in the beginning and 189.5MB in the end (delta: 29.6MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2024-11-09 19:30:47,702 INFO L158 Benchmark]: IcfgBuilder took 4340.31ms. Allocated memory was 316.7MB in the beginning and 633.3MB in the end (delta: 316.7MB). Free memory was 189.5MB in the beginning and 463.0MB in the end (delta: -273.5MB). Peak memory consumption was 288.3MB. Max. memory is 16.1GB. [2024-11-09 19:30:47,702 INFO L158 Benchmark]: TraceAbstraction took 58072.04ms. Allocated memory was 633.3MB in the beginning and 8.3GB in the end (delta: 7.6GB). Free memory was 461.9MB in the beginning and 7.1GB in the end (delta: -6.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-09 19:30:47,702 INFO L158 Benchmark]: Witness Printer took 399.28ms. Allocated memory is still 8.3GB. Free memory was 7.1GB in the beginning and 7.0GB in the end (delta: 109.0MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. [2024-11-09 19:30:47,703 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.14ms. Allocated memory is still 130.0MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1279.00ms. Allocated memory is still 178.3MB. Free memory was 95.5MB in the beginning and 85.9MB in the end (delta: 9.6MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 332.65ms. Allocated memory was 178.3MB in the beginning and 316.7MB in the end (delta: 138.4MB). Free memory was 85.9MB in the beginning and 219.0MB in the end (delta: -133.2MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 419.03ms. Allocated memory is still 316.7MB. Free memory was 219.0MB in the beginning and 189.5MB in the end (delta: 29.6MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * IcfgBuilder took 4340.31ms. Allocated memory was 316.7MB in the beginning and 633.3MB in the end (delta: 316.7MB). Free memory was 189.5MB in the beginning and 463.0MB in the end (delta: -273.5MB). Peak memory consumption was 288.3MB. Max. memory is 16.1GB. * TraceAbstraction took 58072.04ms. Allocated memory was 633.3MB in the beginning and 8.3GB in the end (delta: 7.6GB). Free memory was 461.9MB in the beginning and 7.1GB in the end (delta: -6.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 399.28ms. Allocated memory is still 8.3GB. Free memory was 7.1GB in the beginning and 7.0GB in the end (delta: 109.0MB). Peak memory consumption was 107.0MB. 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: 121]: 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, 821 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.1s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 46.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18737 SdHoareTripleChecker+Valid, 43.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18737 mSDsluCounter, 10226 SdHoareTripleChecker+Invalid, 36.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 7969 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43940 IncrementalHoareTripleChecker+Invalid, 51909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7969 mSolverCounterUnsat, 10098 mSDtfsCounter, 43940 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 868 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57157occurred in iteration=10, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 7529 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 4739 NumberOfCodeBlocks, 4739 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4725 ConstructedInterpolants, 0 QuantifiedInterpolants, 11904 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1174 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 3704/3924 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: 4828]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:30:47,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE