./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/Problem16_label56.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 1bf9c9ed0ac3089dd8a3bb2d319db37780f9f29fcee029bedf598db4408580eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 04:15:34,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 04:15:34,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 04:15:34,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 04:15:34,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 04:15:34,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 04:15:34,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 04:15:34,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 04:15:34,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 04:15:34,392 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 04:15:34,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 04:15:34,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 04:15:34,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 04:15:34,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 04:15:34,393 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 04:15:34,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 04:15:34,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 04:15:34,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 04:15:34,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 04:15:34,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 04:15:34,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 04:15:34,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 04:15:34,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 04:15:34,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 04:15:34,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 04:15:34,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 04:15:34,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 04:15:34,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 04:15:34,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 04:15:34,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 04:15:34,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 04:15:34,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 04:15:34,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:15:34,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 04:15:34,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 04:15:34,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 04:15:34,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 04:15:34,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 04:15:34,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 04:15:34,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 04:15:34,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 04:15:34,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 04:15:34,399 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 -> 1bf9c9ed0ac3089dd8a3bb2d319db37780f9f29fcee029bedf598db4408580eb [2024-11-16 04:15:34,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 04:15:34,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 04:15:34,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 04:15:34,626 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 04:15:34,627 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 04:15:34,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label56.c [2024-11-16 04:15:35,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 04:15:36,087 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 04:15:36,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label56.c [2024-11-16 04:15:36,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fccc780fd/4e45edadd67c4f44956c5eb6050794a8/FLAG18724ba68 [2024-11-16 04:15:36,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fccc780fd/4e45edadd67c4f44956c5eb6050794a8 [2024-11-16 04:15:36,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 04:15:36,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 04:15:36,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 04:15:36,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 04:15:36,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 04:15:36,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:15:36" (1/1) ... [2024-11-16 04:15:36,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5072ba0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:36, skipping insertion in model container [2024-11-16 04:15:36,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:15:36" (1/1) ... [2024-11-16 04:15:36,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 04:15:36,592 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/Problem16_label56.c[3626,3639] [2024-11-16 04:15:36,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:15:36,865 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 04:15:36,881 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/Problem16_label56.c[3626,3639] [2024-11-16 04:15:37,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:15:37,079 INFO L204 MainTranslator]: Completed translation [2024-11-16 04:15:37,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37 WrapperNode [2024-11-16 04:15:37,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 04:15:37,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 04:15:37,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 04:15:37,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 04:15:37,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (1/1) ... [2024-11-16 04:15:37,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (1/1) ... [2024-11-16 04:15:37,188 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1769 [2024-11-16 04:15:37,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 04:15:37,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 04:15:37,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 04:15:37,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 04:15:37,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (1/1) ... [2024-11-16 04:15:37,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (1/1) ... [2024-11-16 04:15:37,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (1/1) ... [2024-11-16 04:15:37,254 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-16 04:15:37,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (1/1) ... [2024-11-16 04:15:37,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (1/1) ... [2024-11-16 04:15:37,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (1/1) ... [2024-11-16 04:15:37,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (1/1) ... [2024-11-16 04:15:37,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (1/1) ... [2024-11-16 04:15:37,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (1/1) ... [2024-11-16 04:15:37,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 04:15:37,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 04:15:37,334 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 04:15:37,334 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 04:15:37,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (1/1) ... [2024-11-16 04:15:37,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:15:37,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:15:37,361 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-16 04:15:37,363 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-16 04:15:37,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 04:15:37,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 04:15:37,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 04:15:37,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 04:15:37,450 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 04:15:37,451 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 04:15:38,839 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2024-11-16 04:15:38,916 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-11-16 04:15:38,917 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 04:15:38,940 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 04:15:38,940 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 04:15:38,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:15:38 BoogieIcfgContainer [2024-11-16 04:15:38,940 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 04:15:38,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 04:15:38,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 04:15:38,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 04:15:38,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:15:36" (1/3) ... [2024-11-16 04:15:38,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d0db93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:15:38, skipping insertion in model container [2024-11-16 04:15:38,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:15:37" (2/3) ... [2024-11-16 04:15:38,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d0db93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:15:38, skipping insertion in model container [2024-11-16 04:15:38,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:15:38" (3/3) ... [2024-11-16 04:15:38,949 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label56.c [2024-11-16 04:15:38,963 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 04:15:38,963 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 04:15:39,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 04:15:39,032 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;@1e580248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 04:15:39,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 04:15:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 397 states have (on average 1.8287153652392947) internal successors, (726), 398 states have internal predecessors, (726), 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-16 04:15:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 04:15:39,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:15:39,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:15:39,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:15:39,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:15:39,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1989571957, now seen corresponding path program 1 times [2024-11-16 04:15:39,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:15:39,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545277080] [2024-11-16 04:15:39,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:15:39,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:15:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:15:39,298 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-16 04:15:39,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:15:39,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545277080] [2024-11-16 04:15:39,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545277080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:15:39,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:15:39,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:15:39,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597405752] [2024-11-16 04:15:39,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:15:39,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:15:39,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:15:39,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:15:39,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:15:39,323 INFO L87 Difference]: Start difference. First operand has 399 states, 397 states have (on average 1.8287153652392947) internal successors, (726), 398 states have internal predecessors, (726), 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 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:15:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:15:40,615 INFO L93 Difference]: Finished difference Result 1128 states and 2109 transitions. [2024-11-16 04:15:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:15:40,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-16 04:15:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:15:40,630 INFO L225 Difference]: With dead ends: 1128 [2024-11-16 04:15:40,630 INFO L226 Difference]: Without dead ends: 665 [2024-11-16 04:15:40,633 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-16 04:15:40,635 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 354 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:15:40,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 258 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 04:15:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-16 04:15:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2024-11-16 04:15:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.516566265060241) internal successors, (1007), 664 states have internal predecessors, (1007), 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-16 04:15:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1007 transitions. [2024-11-16 04:15:40,699 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1007 transitions. Word has length 35 [2024-11-16 04:15:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:15:40,699 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1007 transitions. [2024-11-16 04:15:40,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:15:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1007 transitions. [2024-11-16 04:15:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 04:15:40,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:15:40,702 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, 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] [2024-11-16 04:15:40,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 04:15:40,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:15:40,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:15:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1799194874, now seen corresponding path program 1 times [2024-11-16 04:15:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:15:40,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154116211] [2024-11-16 04:15:40,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:15:40,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:15:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:15:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:15:40,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:15:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154116211] [2024-11-16 04:15:40,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154116211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:15:40,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:15:40,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:15:40,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176437544] [2024-11-16 04:15:40,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:15:40,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 04:15:40,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:15:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 04:15:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 04:15:40,995 INFO L87 Difference]: Start difference. First operand 665 states and 1007 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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-16 04:15:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:15:42,652 INFO L93 Difference]: Finished difference Result 2318 states and 3423 transitions. [2024-11-16 04:15:42,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 04:15:42,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2024-11-16 04:15:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:15:42,657 INFO L225 Difference]: With dead ends: 2318 [2024-11-16 04:15:42,657 INFO L226 Difference]: Without dead ends: 1655 [2024-11-16 04:15:42,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 04:15:42,659 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1008 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 04:15:42,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 50 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 04:15:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2024-11-16 04:15:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1655. [2024-11-16 04:15:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1654 states have (on average 1.3996372430471584) internal successors, (2315), 1654 states have internal predecessors, (2315), 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-16 04:15:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2315 transitions. [2024-11-16 04:15:42,703 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2315 transitions. Word has length 104 [2024-11-16 04:15:42,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:15:42,704 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2315 transitions. [2024-11-16 04:15:42,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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-16 04:15:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2315 transitions. [2024-11-16 04:15:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-16 04:15:42,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:15:42,710 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:15:42,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 04:15:42,710 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:15:42,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:15:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash 936881706, now seen corresponding path program 1 times [2024-11-16 04:15:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:15:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358545665] [2024-11-16 04:15:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:15:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:15:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:15:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-16 04:15:42,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:15:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358545665] [2024-11-16 04:15:42,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358545665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:15:42,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:15:42,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:15:42,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417811868] [2024-11-16 04:15:42,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:15:42,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:15:42,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:15:42,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:15:42,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:15:42,949 INFO L87 Difference]: Start difference. First operand 1655 states and 2315 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 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-16 04:15:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:15:44,009 INFO L93 Difference]: Finished difference Result 3638 states and 5252 transitions. [2024-11-16 04:15:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:15:44,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 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 265 [2024-11-16 04:15:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:15:44,016 INFO L225 Difference]: With dead ends: 3638 [2024-11-16 04:15:44,016 INFO L226 Difference]: Without dead ends: 2315 [2024-11-16 04:15:44,018 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-16 04:15:44,023 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 279 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 04:15:44,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 80 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 04:15:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2024-11-16 04:15:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2315. [2024-11-16 04:15:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2314 states have (on average 1.3478824546240276) internal successors, (3119), 2314 states have internal predecessors, (3119), 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-16 04:15:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3119 transitions. [2024-11-16 04:15:44,057 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3119 transitions. Word has length 265 [2024-11-16 04:15:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:15:44,059 INFO L471 AbstractCegarLoop]: Abstraction has 2315 states and 3119 transitions. [2024-11-16 04:15:44,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 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-16 04:15:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3119 transitions. [2024-11-16 04:15:44,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-16 04:15:44,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:15:44,066 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:15:44,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 04:15:44,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:15:44,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:15:44,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1772068593, now seen corresponding path program 1 times [2024-11-16 04:15:44,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:15:44,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132887906] [2024-11-16 04:15:44,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:15:44,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:15:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:15:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-16 04:15:44,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:15:44,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132887906] [2024-11-16 04:15:44,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132887906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:15:44,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:15:44,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:15:44,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564383477] [2024-11-16 04:15:44,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:15:44,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:15:44,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:15:44,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:15:44,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:15:44,283 INFO L87 Difference]: Start difference. First operand 2315 states and 3119 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 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-16 04:15:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:15:45,224 INFO L93 Difference]: Finished difference Result 5618 states and 7713 transitions. [2024-11-16 04:15:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:15:45,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 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 301 [2024-11-16 04:15:45,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:15:45,233 INFO L225 Difference]: With dead ends: 5618 [2024-11-16 04:15:45,233 INFO L226 Difference]: Without dead ends: 3635 [2024-11-16 04:15:45,235 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-16 04:15:45,236 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 360 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 04:15:45,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 158 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 04:15:45,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2024-11-16 04:15:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3305. [2024-11-16 04:15:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 3304 states have (on average 1.234866828087167) internal successors, (4080), 3304 states have internal predecessors, (4080), 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-16 04:15:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4080 transitions. [2024-11-16 04:15:45,273 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4080 transitions. Word has length 301 [2024-11-16 04:15:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:15:45,275 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 4080 transitions. [2024-11-16 04:15:45,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 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-16 04:15:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4080 transitions. [2024-11-16 04:15:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2024-11-16 04:15:45,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:15:45,282 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-16 04:15:45,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 04:15:45,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:15:45,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:15:45,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1992713710, now seen corresponding path program 1 times [2024-11-16 04:15:45,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:15:45,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734174928] [2024-11-16 04:15:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:15:45,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:15:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:15:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 702 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-16 04:15:45,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:15:45,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734174928] [2024-11-16 04:15:45,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734174928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:15:45,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:15:45,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:15:45,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709707548] [2024-11-16 04:15:45,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:15:45,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:15:45,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:15:45,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:15:45,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:15:45,543 INFO L87 Difference]: Start difference. First operand 3305 states and 4080 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-16 04:15:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:15:46,399 INFO L93 Difference]: Finished difference Result 7598 states and 9442 transitions. [2024-11-16 04:15:46,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:15:46,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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 556 [2024-11-16 04:15:46,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:15:46,407 INFO L225 Difference]: With dead ends: 7598 [2024-11-16 04:15:46,408 INFO L226 Difference]: Without dead ends: 3965 [2024-11-16 04:15:46,410 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-16 04:15:46,411 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 286 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 04:15:46,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 545 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 04:15:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2024-11-16 04:15:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3965. [2024-11-16 04:15:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3964 states have (on average 1.072653884964682) internal successors, (4252), 3964 states have internal predecessors, (4252), 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-16 04:15:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 4252 transitions. [2024-11-16 04:15:46,451 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 4252 transitions. Word has length 556 [2024-11-16 04:15:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:15:46,451 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 4252 transitions. [2024-11-16 04:15:46,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-16 04:15:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 4252 transitions. [2024-11-16 04:15:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2024-11-16 04:15:46,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:15:46,466 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 04:15:46,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 04:15:46,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:15:46,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:15:46,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1961416992, now seen corresponding path program 1 times [2024-11-16 04:15:46,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:15:46,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253499122] [2024-11-16 04:15:46,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:15:46,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:15:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:15:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 1087 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2024-11-16 04:15:47,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:15:47,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253499122] [2024-11-16 04:15:47,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253499122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:15:47,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:15:47,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:15:47,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832699260] [2024-11-16 04:15:47,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:15:47,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:15:47,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:15:47,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:15:47,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:15:47,036 INFO L87 Difference]: Start difference. First operand 3965 states and 4252 transitions. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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-16 04:15:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:15:47,677 INFO L93 Difference]: Finished difference Result 8918 states and 9613 transitions. [2024-11-16 04:15:47,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:15:47,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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 828 [2024-11-16 04:15:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:15:47,691 INFO L225 Difference]: With dead ends: 8918 [2024-11-16 04:15:47,691 INFO L226 Difference]: Without dead ends: 5285 [2024-11-16 04:15:47,694 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-16 04:15:47,696 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 219 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 04:15:47,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 433 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 04:15:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5285 states. [2024-11-16 04:15:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5285 to 5285. [2024-11-16 04:15:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5285 states, 5284 states have (on average 1.0598031794095382) internal successors, (5600), 5284 states have internal predecessors, (5600), 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-16 04:15:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5285 states to 5285 states and 5600 transitions. [2024-11-16 04:15:47,748 INFO L78 Accepts]: Start accepts. Automaton has 5285 states and 5600 transitions. Word has length 828 [2024-11-16 04:15:47,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:15:47,749 INFO L471 AbstractCegarLoop]: Abstraction has 5285 states and 5600 transitions. [2024-11-16 04:15:47,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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-16 04:15:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand 5285 states and 5600 transitions. [2024-11-16 04:15:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2024-11-16 04:15:47,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:15:47,757 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:15:47,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 04:15:47,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:15:47,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:15:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash -604997871, now seen corresponding path program 1 times [2024-11-16 04:15:47,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:15:47,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441811507] [2024-11-16 04:15:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:15:47,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:15:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:15:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 1087 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-16 04:15:48,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:15:48,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441811507] [2024-11-16 04:15:48,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441811507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:15:48,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:15:48,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:15:48,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62141547] [2024-11-16 04:15:48,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:15:48,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:15:48,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:15:48,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:15:48,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:15:48,277 INFO L87 Difference]: Start difference. First operand 5285 states and 5600 transitions. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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-16 04:15:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:15:48,914 INFO L93 Difference]: Finished difference Result 11888 states and 12654 transitions. [2024-11-16 04:15:48,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:15:48,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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 891 [2024-11-16 04:15:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:15:48,927 INFO L225 Difference]: With dead ends: 11888 [2024-11-16 04:15:48,927 INFO L226 Difference]: Without dead ends: 6935 [2024-11-16 04:15:48,930 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-16 04:15:48,930 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 175 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 04:15:48,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 419 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 04:15:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6935 states. [2024-11-16 04:15:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6935 to 6605. [2024-11-16 04:15:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6605 states, 6604 states have (on average 1.0445184736523319) internal successors, (6898), 6604 states have internal predecessors, (6898), 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-16 04:15:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6605 states to 6605 states and 6898 transitions. [2024-11-16 04:15:48,985 INFO L78 Accepts]: Start accepts. Automaton has 6605 states and 6898 transitions. Word has length 891 [2024-11-16 04:15:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:15:48,986 INFO L471 AbstractCegarLoop]: Abstraction has 6605 states and 6898 transitions. [2024-11-16 04:15:48,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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-16 04:15:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 6605 states and 6898 transitions. [2024-11-16 04:15:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1267 [2024-11-16 04:15:48,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:15:48,998 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-16 04:15:48,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 04:15:48,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:15:48,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:15:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash 165204691, now seen corresponding path program 1 times [2024-11-16 04:15:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:15:48,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522039349] [2024-11-16 04:15:48,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:15:48,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:15:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:15:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2861 backedges. 1626 proven. 0 refuted. 0 times theorem prover too weak. 1235 trivial. 0 not checked. [2024-11-16 04:15:50,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:15:50,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522039349] [2024-11-16 04:15:50,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522039349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:15:50,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:15:50,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:15:50,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124483012] [2024-11-16 04:15:50,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:15:50,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:15:50,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:15:50,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:15:50,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:15:50,197 INFO L87 Difference]: Start difference. First operand 6605 states and 6898 transitions. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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-16 04:15:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:15:50,801 INFO L93 Difference]: Finished difference Result 13868 states and 14517 transitions. [2024-11-16 04:15:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:15:50,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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 1266 [2024-11-16 04:15:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:15:50,823 INFO L225 Difference]: With dead ends: 13868 [2024-11-16 04:15:50,824 INFO L226 Difference]: Without dead ends: 7595 [2024-11-16 04:15:50,829 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-16 04:15:50,830 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 224 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 04:15:50,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 444 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 04:15:50,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7595 states. [2024-11-16 04:15:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7595 to 7595. [2024-11-16 04:15:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7595 states, 7594 states have (on average 1.0396365551751383) internal successors, (7895), 7594 states have internal predecessors, (7895), 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-16 04:15:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7595 states to 7595 states and 7895 transitions. [2024-11-16 04:15:50,933 INFO L78 Accepts]: Start accepts. Automaton has 7595 states and 7895 transitions. Word has length 1266 [2024-11-16 04:15:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:15:50,934 INFO L471 AbstractCegarLoop]: Abstraction has 7595 states and 7895 transitions. [2024-11-16 04:15:50,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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-16 04:15:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 7595 states and 7895 transitions. [2024-11-16 04:15:50,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1285 [2024-11-16 04:15:50,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:15:50,949 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-16 04:15:50,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 04:15:50,950 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:15:50,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:15:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1383976058, now seen corresponding path program 1 times [2024-11-16 04:15:50,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:15:50,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366064995] [2024-11-16 04:15:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:15:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:15:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:15:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2891 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 2668 trivial. 0 not checked. [2024-11-16 04:15:51,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:15:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366064995] [2024-11-16 04:15:51,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366064995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:15:51,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:15:51,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:15:51,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935764464] [2024-11-16 04:15:51,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:15:51,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:15:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:15:51,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:15:51,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:15:51,641 INFO L87 Difference]: Start difference. First operand 7595 states and 7895 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-16 04:15:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:15:52,229 INFO L93 Difference]: Finished difference Result 16175 states and 16897 transitions. [2024-11-16 04:15:52,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:15:52,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 1284 [2024-11-16 04:15:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:15:52,232 INFO L225 Difference]: With dead ends: 16175 [2024-11-16 04:15:52,232 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 04:15:52,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-16 04:15:52,240 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 299 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 04:15:52,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 435 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 04:15:52,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 04:15:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 04:15:52,241 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-16 04:15:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 04:15:52,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1284 [2024-11-16 04:15:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:15:52,242 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 04:15:52,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-16 04:15:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 04:15:52,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 04:15:52,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 04:15:52,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 04:15:52,247 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:15:52,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 04:15:52,357 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 04:15:52,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:15:52 BoogieIcfgContainer [2024-11-16 04:15:52,366 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 04:15:52,366 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 04:15:52,366 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 04:15:52,367 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 04:15:52,367 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:15:38" (3/4) ... [2024-11-16 04:15:52,369 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 04:15:52,390 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-16 04:15:52,391 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 04:15:52,393 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 04:15:52,394 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 04:15:52,546 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 04:15:52,546 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 04:15:52,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 04:15:52,547 INFO L158 Benchmark]: Toolchain (without parser) took 16171.41ms. Allocated memory was 192.9MB in the beginning and 631.2MB in the end (delta: 438.3MB). Free memory was 119.4MB in the beginning and 472.7MB in the end (delta: -353.3MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2024-11-16 04:15:52,547 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 04:15:52,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.49ms. Allocated memory is still 192.9MB. Free memory was 119.4MB in the beginning and 137.6MB in the end (delta: -18.3MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-16 04:15:52,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.12ms. Allocated memory is still 192.9MB. Free memory was 137.3MB in the beginning and 113.4MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 04:15:52,548 INFO L158 Benchmark]: Boogie Preprocessor took 143.30ms. Allocated memory is still 192.9MB. Free memory was 113.4MB in the beginning and 79.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-16 04:15:52,549 INFO L158 Benchmark]: IcfgBuilder took 1606.26ms. Allocated memory was 192.9MB in the beginning and 291.5MB in the end (delta: 98.6MB). Free memory was 79.8MB in the beginning and 155.6MB in the end (delta: -75.8MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-16 04:15:52,550 INFO L158 Benchmark]: TraceAbstraction took 13421.18ms. Allocated memory was 291.5MB in the beginning and 631.2MB in the end (delta: 339.7MB). Free memory was 154.6MB in the beginning and 498.9MB in the end (delta: -344.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 04:15:52,550 INFO L158 Benchmark]: Witness Printer took 180.17ms. Allocated memory is still 631.2MB. Free memory was 498.9MB in the beginning and 472.7MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-16 04:15:52,552 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.13ms. Allocated memory is still 125.8MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 703.49ms. Allocated memory is still 192.9MB. Free memory was 119.4MB in the beginning and 137.6MB in the end (delta: -18.3MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.12ms. Allocated memory is still 192.9MB. Free memory was 137.3MB in the beginning and 113.4MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 143.30ms. Allocated memory is still 192.9MB. Free memory was 113.4MB in the beginning and 79.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1606.26ms. Allocated memory was 192.9MB in the beginning and 291.5MB in the end (delta: 98.6MB). Free memory was 79.8MB in the beginning and 155.6MB in the end (delta: -75.8MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13421.18ms. Allocated memory was 291.5MB in the beginning and 631.2MB in the end (delta: 339.7MB). Free memory was 154.6MB in the beginning and 498.9MB in the end (delta: -344.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 180.17ms. Allocated memory is still 631.2MB. Free memory was 498.9MB in the beginning and 472.7MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. 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: 116]: 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, 399 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3204 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3204 mSDsluCounter, 2822 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 2202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7877 IncrementalHoareTripleChecker+Invalid, 10079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2202 mSolverCounterUnsat, 2750 mSDtfsCounter, 7877 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7595occurred in iteration=8, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 660 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 5530 NumberOfCodeBlocks, 5530 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 5521 ConstructedInterpolants, 0 QuantifiedInterpolants, 8548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 10311/10311 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: 1783]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 04:15:52,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE