./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label26.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/Problem02_label26.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 18aad4ca7dabbbf78ef10474b35f6cac486a6e59d41545af1bcfdc261bf8f717 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:37:46,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:37:46,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:37:46,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:37:46,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:37:46,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:37:46,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:37:46,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:37:46,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:37:46,966 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:37:46,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:37:46,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:37:46,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:37:46,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:37:46,974 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:37:46,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:37:46,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:37:46,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:37:46,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:37:46,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:37:46,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:37:46,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:37:46,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:37:46,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:37:46,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:37:46,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:37:46,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:37:46,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:37:46,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:37:46,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:37:46,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:37:46,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:37:46,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:37:46,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:37:46,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:37:46,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:37:46,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:37:46,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:37:46,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:37:46,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:37:46,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:37:46,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:37:46,984 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 -> 18aad4ca7dabbbf78ef10474b35f6cac486a6e59d41545af1bcfdc261bf8f717 [2024-11-09 18:37:47,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:37:47,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:37:47,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:37:47,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:37:47,303 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:37:47,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label26.c [2024-11-09 18:37:48,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:37:49,104 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:37:49,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label26.c [2024-11-09 18:37:49,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7797c672d/4e4b6db2a7804900b647016a7331babc/FLAG53414f48e [2024-11-09 18:37:49,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7797c672d/4e4b6db2a7804900b647016a7331babc [2024-11-09 18:37:49,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:37:49,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:37:49,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:37:49,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:37:49,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:37:49,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:49,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6125ac31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49, skipping insertion in model container [2024-11-09 18:37:49,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:49,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:37:49,560 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label26.c[20881,20894] [2024-11-09 18:37:49,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:37:49,603 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:37:49,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label26.c[20881,20894] [2024-11-09 18:37:49,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:37:49,741 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:37:49,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49 WrapperNode [2024-11-09 18:37:49,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:37:49,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:37:49,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:37:49,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:37:49,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:49,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:49,884 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-09 18:37:49,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:37:49,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:37:49,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:37:49,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:37:49,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:49,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:49,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:49,963 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 18:37:49,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:49,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:49,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:49,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:49,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:49,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:50,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:37:50,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:37:50,004 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:37:50,004 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:37:50,005 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (1/1) ... [2024-11-09 18:37:50,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:37:50,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:37:50,042 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 18:37:50,045 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 18:37:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:37:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:37:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:37:50,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:37:50,181 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:37:50,183 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:37:51,313 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-09 18:37:51,314 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:37:51,341 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:37:51,341 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:37:51,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:51 BoogieIcfgContainer [2024-11-09 18:37:51,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:37:51,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:37:51,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:37:51,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:37:51,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:37:49" (1/3) ... [2024-11-09 18:37:51,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3bb32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:37:51, skipping insertion in model container [2024-11-09 18:37:51,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:49" (2/3) ... [2024-11-09 18:37:51,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3bb32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:37:51, skipping insertion in model container [2024-11-09 18:37:51,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:51" (3/3) ... [2024-11-09 18:37:51,354 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label26.c [2024-11-09 18:37:51,372 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:37:51,373 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:37:51,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:37:51,462 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;@45f6b26e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:37:51,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:37:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 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 18:37:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 18:37:51,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:51,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:51,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:51,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:51,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1446783962, now seen corresponding path program 1 times [2024-11-09 18:37:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:51,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315750562] [2024-11-09 18:37:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:51,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:52,213 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 18:37:52,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:52,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315750562] [2024-11-09 18:37:52,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315750562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:52,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:52,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018119661] [2024-11-09 18:37:52,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:52,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:52,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:52,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:52,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:52,259 INFO L87 Difference]: Start difference. First operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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 18:37:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:53,037 INFO L93 Difference]: Finished difference Result 602 states and 1036 transitions. [2024-11-09 18:37:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:53,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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 138 [2024-11-09 18:37:53,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:53,053 INFO L225 Difference]: With dead ends: 602 [2024-11-09 18:37:53,053 INFO L226 Difference]: Without dead ends: 308 [2024-11-09 18:37:53,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:53,064 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 108 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:53,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 93 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 18:37:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-09 18:37:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-11-09 18:37:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.521172638436482) internal successors, (467), 307 states have internal predecessors, (467), 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 18:37:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 467 transitions. [2024-11-09 18:37:53,144 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 467 transitions. Word has length 138 [2024-11-09 18:37:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:53,148 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 467 transitions. [2024-11-09 18:37:53,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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 18:37:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 467 transitions. [2024-11-09 18:37:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 18:37:53,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:53,155 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 18:37:53,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:37:53,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:53,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:53,156 INFO L85 PathProgramCache]: Analyzing trace with hash -961524827, now seen corresponding path program 1 times [2024-11-09 18:37:53,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:53,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377233767] [2024-11-09 18:37:53,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:53,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:53,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:53,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377233767] [2024-11-09 18:37:53,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377233767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:53,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:53,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:53,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349786440] [2024-11-09 18:37:53,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:53,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:53,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:53,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:53,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:53,376 INFO L87 Difference]: Start difference. First operand 308 states and 467 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 18:37:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:53,869 INFO L93 Difference]: Finished difference Result 911 states and 1384 transitions. [2024-11-09 18:37:53,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:53,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 150 [2024-11-09 18:37:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:53,873 INFO L225 Difference]: With dead ends: 911 [2024-11-09 18:37:53,873 INFO L226 Difference]: Without dead ends: 605 [2024-11-09 18:37:53,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:53,876 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 194 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:53,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 75 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 18:37:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-09 18:37:53,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 601. [2024-11-09 18:37:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.4733333333333334) internal successors, (884), 600 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 884 transitions. [2024-11-09 18:37:53,905 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 884 transitions. Word has length 150 [2024-11-09 18:37:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:53,906 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 884 transitions. [2024-11-09 18:37:53,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 18:37:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 884 transitions. [2024-11-09 18:37:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 18:37:53,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:53,910 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:37:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:37:53,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:53,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:53,912 INFO L85 PathProgramCache]: Analyzing trace with hash 117070697, now seen corresponding path program 1 times [2024-11-09 18:37:53,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:53,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065860571] [2024-11-09 18:37:53,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:53,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 18:37:54,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:54,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065860571] [2024-11-09 18:37:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065860571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:54,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:54,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:54,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907061303] [2024-11-09 18:37:54,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:54,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:54,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:54,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:54,086 INFO L87 Difference]: Start difference. First operand 601 states and 884 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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 18:37:54,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:54,342 INFO L93 Difference]: Finished difference Result 1049 states and 1550 transitions. [2024-11-09 18:37:54,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:54,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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 155 [2024-11-09 18:37:54,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:54,345 INFO L225 Difference]: With dead ends: 1049 [2024-11-09 18:37:54,345 INFO L226 Difference]: Without dead ends: 450 [2024-11-09 18:37:54,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:54,348 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:54,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 25 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:37:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-09 18:37:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2024-11-09 18:37:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.4209354120267261) internal successors, (638), 449 states have internal predecessors, (638), 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 18:37:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 638 transitions. [2024-11-09 18:37:54,367 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 638 transitions. Word has length 155 [2024-11-09 18:37:54,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:54,367 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 638 transitions. [2024-11-09 18:37:54,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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 18:37:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 638 transitions. [2024-11-09 18:37:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 18:37:54,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:54,373 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 18:37:54,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:37:54,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:54,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash -500289418, now seen corresponding path program 1 times [2024-11-09 18:37:54,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:54,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929813147] [2024-11-09 18:37:54,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:54,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:54,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:54,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929813147] [2024-11-09 18:37:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929813147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:54,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124381969] [2024-11-09 18:37:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:54,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:54,616 INFO L87 Difference]: Start difference. First operand 450 states and 638 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 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 18:37:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:55,014 INFO L93 Difference]: Finished difference Result 1338 states and 1900 transitions. [2024-11-09 18:37:55,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:55,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 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 157 [2024-11-09 18:37:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:55,018 INFO L225 Difference]: With dead ends: 1338 [2024-11-09 18:37:55,018 INFO L226 Difference]: Without dead ends: 890 [2024-11-09 18:37:55,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:55,024 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 149 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:55,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 89 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-11-09 18:37:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 882. [2024-11-09 18:37:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.3700340522133938) internal successors, (1207), 881 states have internal predecessors, (1207), 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 18:37:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1207 transitions. [2024-11-09 18:37:55,050 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1207 transitions. Word has length 157 [2024-11-09 18:37:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:55,050 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1207 transitions. [2024-11-09 18:37:55,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 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 18:37:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1207 transitions. [2024-11-09 18:37:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 18:37:55,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:55,055 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:37:55,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:37:55,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:55,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:55,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1530031596, now seen corresponding path program 1 times [2024-11-09 18:37:55,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:55,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061783846] [2024-11-09 18:37:55,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:55,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:55,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061783846] [2024-11-09 18:37:55,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061783846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:55,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:55,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:55,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174601721] [2024-11-09 18:37:55,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:55,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:55,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:55,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:55,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:55,180 INFO L87 Difference]: Start difference. First operand 882 states and 1207 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:55,580 INFO L93 Difference]: Finished difference Result 2611 states and 3578 transitions. [2024-11-09 18:37:55,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:55,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-11-09 18:37:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:55,587 INFO L225 Difference]: With dead ends: 2611 [2024-11-09 18:37:55,588 INFO L226 Difference]: Without dead ends: 1731 [2024-11-09 18:37:55,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:55,591 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 159 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:55,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 65 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2024-11-09 18:37:55,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1731. [2024-11-09 18:37:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1730 states have (on average 1.2936416184971098) internal successors, (2238), 1730 states have internal predecessors, (2238), 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 18:37:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2238 transitions. [2024-11-09 18:37:55,628 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2238 transitions. Word has length 161 [2024-11-09 18:37:55,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:55,628 INFO L471 AbstractCegarLoop]: Abstraction has 1731 states and 2238 transitions. [2024-11-09 18:37:55,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2238 transitions. [2024-11-09 18:37:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 18:37:55,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:55,633 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-09 18:37:55,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 18:37:55,633 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:55,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1420532786, now seen corresponding path program 1 times [2024-11-09 18:37:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:55,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075709938] [2024-11-09 18:37:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:55,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:55,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:55,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075709938] [2024-11-09 18:37:55,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075709938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:55,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:55,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:55,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272427099] [2024-11-09 18:37:55,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:55,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:55,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:55,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:55,807 INFO L87 Difference]: Start difference. First operand 1731 states and 2238 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:56,227 INFO L93 Difference]: Finished difference Result 4305 states and 5559 transitions. [2024-11-09 18:37:56,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:56,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2024-11-09 18:37:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:56,237 INFO L225 Difference]: With dead ends: 4305 [2024-11-09 18:37:56,238 INFO L226 Difference]: Without dead ends: 2576 [2024-11-09 18:37:56,240 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 18:37:56,242 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 136 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:56,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 78 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2024-11-09 18:37:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2294. [2024-11-09 18:37:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2293 states have (on average 1.2263410379415614) internal successors, (2812), 2293 states have internal predecessors, (2812), 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 18:37:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 2812 transitions. [2024-11-09 18:37:56,317 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 2812 transitions. Word has length 162 [2024-11-09 18:37:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:56,317 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 2812 transitions. [2024-11-09 18:37:56,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 2812 transitions. [2024-11-09 18:37:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 18:37:56,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:56,324 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:37:56,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:37:56,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:56,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:56,325 INFO L85 PathProgramCache]: Analyzing trace with hash 639833414, now seen corresponding path program 1 times [2024-11-09 18:37:56,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:56,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746932922] [2024-11-09 18:37:56,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:56,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:56,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:56,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746932922] [2024-11-09 18:37:56,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746932922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:37:56,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989090238] [2024-11-09 18:37:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:56,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:37:56,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:37:56,782 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 18:37:56,783 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 18:37:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:56,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:37:56,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:37:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:37:57,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:37:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989090238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:57,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:37:57,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 18:37:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660975049] [2024-11-09 18:37:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:57,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:57,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:57,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:57,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:37:57,172 INFO L87 Difference]: Start difference. First operand 2294 states and 2812 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:57,595 INFO L93 Difference]: Finished difference Result 4584 states and 5620 transitions. [2024-11-09 18:37:57,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:57,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-11-09 18:37:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:57,605 INFO L225 Difference]: With dead ends: 4584 [2024-11-09 18:37:57,605 INFO L226 Difference]: Without dead ends: 2292 [2024-11-09 18:37:57,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:37:57,611 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 24 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:57,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 217 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2024-11-09 18:37:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2292. [2024-11-09 18:37:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2292 states, 2291 states have (on average 1.1532082060235704) internal successors, (2642), 2291 states have internal predecessors, (2642), 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 18:37:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 2642 transitions. [2024-11-09 18:37:57,652 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 2642 transitions. Word has length 167 [2024-11-09 18:37:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:57,652 INFO L471 AbstractCegarLoop]: Abstraction has 2292 states and 2642 transitions. [2024-11-09 18:37:57,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 2642 transitions. [2024-11-09 18:37:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 18:37:57,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:57,658 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:37:57,679 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 18:37:57,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:37:57,862 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:57,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1611776058, now seen corresponding path program 1 times [2024-11-09 18:37:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:57,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614104407] [2024-11-09 18:37:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:57,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:37:58,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614104407] [2024-11-09 18:37:58,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614104407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:58,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:58,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:58,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200938541] [2024-11-09 18:37:58,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:58,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:58,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:58,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:58,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:58,026 INFO L87 Difference]: Start difference. First operand 2292 states and 2642 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 18:37:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:58,473 INFO L93 Difference]: Finished difference Result 3864 states and 4448 transitions. [2024-11-09 18:37:58,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:58,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 234 [2024-11-09 18:37:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:58,481 INFO L225 Difference]: With dead ends: 3864 [2024-11-09 18:37:58,482 INFO L226 Difference]: Without dead ends: 2150 [2024-11-09 18:37:58,484 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 18:37:58,486 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 81 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:58,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 244 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2024-11-09 18:37:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2150. [2024-11-09 18:37:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2150 states, 2149 states have (on average 1.1265704979060027) internal successors, (2421), 2149 states have internal predecessors, (2421), 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 18:37:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 2421 transitions. [2024-11-09 18:37:58,527 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 2421 transitions. Word has length 234 [2024-11-09 18:37:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:58,528 INFO L471 AbstractCegarLoop]: Abstraction has 2150 states and 2421 transitions. [2024-11-09 18:37:58,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 18:37:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 2421 transitions. [2024-11-09 18:37:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-09 18:37:58,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:58,533 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 18:37:58,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 18:37:58,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:58,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:58,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1543798929, now seen corresponding path program 1 times [2024-11-09 18:37:58,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:58,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295434738] [2024-11-09 18:37:58,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:58,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 18:37:58,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:58,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295434738] [2024-11-09 18:37:58,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295434738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:58,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:58,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5577804] [2024-11-09 18:37:58,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:58,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:58,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:58,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:58,651 INFO L87 Difference]: Start difference. First operand 2150 states and 2421 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 18:37:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:59,043 INFO L93 Difference]: Finished difference Result 2999 states and 3360 transitions. [2024-11-09 18:37:59,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:59,044 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 243 [2024-11-09 18:37:59,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:59,045 INFO L225 Difference]: With dead ends: 2999 [2024-11-09 18:37:59,045 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:37:59,048 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 18:37:59,048 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 111 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:59,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 227 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:37:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:37:59,049 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 18:37:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:37:59,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2024-11-09 18:37:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:59,050 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:37:59,050 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 18:37:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:37:59,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:37:59,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:37:59,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:37:59,057 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:59,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:37:59,212 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:37:59,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:37:59 BoogieIcfgContainer [2024-11-09 18:37:59,225 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:37:59,225 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:37:59,225 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:37:59,226 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:37:59,226 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:51" (3/4) ... [2024-11-09 18:37:59,229 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:37:59,253 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 18:37:59,254 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 18:37:59,255 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:37:59,256 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:37:59,398 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:37:59,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:37:59,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:37:59,400 INFO L158 Benchmark]: Toolchain (without parser) took 10258.51ms. Allocated memory was 176.2MB in the beginning and 316.7MB in the end (delta: 140.5MB). Free memory was 120.3MB in the beginning and 120.4MB in the end (delta: -103.1kB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. [2024-11-09 18:37:59,400 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 176.2MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:37:59,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.35ms. Allocated memory is still 176.2MB. Free memory was 119.9MB in the beginning and 91.7MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 18:37:59,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 141.83ms. Allocated memory is still 176.2MB. Free memory was 91.3MB in the beginning and 143.6MB in the end (delta: -52.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-09 18:37:59,401 INFO L158 Benchmark]: Boogie Preprocessor took 117.43ms. Allocated memory is still 176.2MB. Free memory was 143.6MB in the beginning and 139.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:37:59,401 INFO L158 Benchmark]: IcfgBuilder took 1339.76ms. Allocated memory is still 176.2MB. Free memory was 139.4MB in the beginning and 57.6MB in the end (delta: 81.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-09 18:37:59,402 INFO L158 Benchmark]: TraceAbstraction took 7879.59ms. Allocated memory was 176.2MB in the beginning and 316.7MB in the end (delta: 140.5MB). Free memory was 56.7MB in the beginning and 134.1MB in the end (delta: -77.4MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2024-11-09 18:37:59,402 INFO L158 Benchmark]: Witness Printer took 173.83ms. Allocated memory is still 316.7MB. Free memory was 134.1MB in the beginning and 120.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 18:37:59,403 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.26ms. Allocated memory is still 176.2MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.35ms. Allocated memory is still 176.2MB. Free memory was 119.9MB in the beginning and 91.7MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 141.83ms. Allocated memory is still 176.2MB. Free memory was 91.3MB in the beginning and 143.6MB in the end (delta: -52.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.43ms. Allocated memory is still 176.2MB. Free memory was 143.6MB in the beginning and 139.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1339.76ms. Allocated memory is still 176.2MB. Free memory was 139.4MB in the beginning and 57.6MB in the end (delta: 81.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7879.59ms. Allocated memory was 176.2MB in the beginning and 316.7MB in the end (delta: 140.5MB). Free memory was 56.7MB in the beginning and 134.1MB in the end (delta: -77.4MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * Witness Printer took 173.83ms. Allocated memory is still 316.7MB. Free memory was 134.1MB in the beginning and 120.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 590]: 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, 230 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1163 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1163 mSDsluCounter, 1113 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 523 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3042 IncrementalHoareTripleChecker+Invalid, 3565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 523 mSolverCounterUnsat, 981 mSDtfsCounter, 3042 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2294occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 294 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1734 NumberOfCodeBlocks, 1734 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1724 ConstructedInterpolants, 0 QuantifiedInterpolants, 4458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 427/445 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:37:59,432 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