./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-82.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7551b88286b5ebcdb10ff8e818afcc3b44708e73b4c8644c034753d18f164a2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:40:12,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:40:12,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:40:12,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:40:12,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:40:12,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:40:12,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:40:12,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:40:12,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:40:12,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:40:12,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:40:12,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:40:12,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:40:12,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:40:12,544 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:40:12,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:40:12,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:40:12,545 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:40:12,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:40:12,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:40:12,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:40:12,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:40:12,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:40:12,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:40:12,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:40:12,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:40:12,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:40:12,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:40:12,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:40:12,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:40:12,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:40:12,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:40:12,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:40:12,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:40:12,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:40:12,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:40:12,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:40:12,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:40:12,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:40:12,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:40:12,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:40:12,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:40:12,554 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7551b88286b5ebcdb10ff8e818afcc3b44708e73b4c8644c034753d18f164a2 [2024-10-11 12:40:12,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:40:12,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:40:12,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:40:12,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:40:12,840 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:40:12,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-82.i [2024-10-11 12:40:14,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:40:14,574 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:40:14,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-82.i [2024-10-11 12:40:14,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b0f7458e6/35fa552d6fc24d2c8324751aeac19087/FLAG94c548d1d [2024-10-11 12:40:14,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b0f7458e6/35fa552d6fc24d2c8324751aeac19087 [2024-10-11 12:40:14,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:40:14,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:40:14,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:40:14,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:40:14,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:40:14,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:40:14" (1/1) ... [2024-10-11 12:40:14,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671ca187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:14, skipping insertion in model container [2024-10-11 12:40:14,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:40:14" (1/1) ... [2024-10-11 12:40:14,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:40:15,180 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-82.i[915,928] [2024-10-11 12:40:15,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:40:15,256 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:40:15,272 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-82.i[915,928] [2024-10-11 12:40:15,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:40:15,328 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:40:15,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15 WrapperNode [2024-10-11 12:40:15,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:40:15,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:40:15,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:40:15,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:40:15,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (1/1) ... [2024-10-11 12:40:15,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (1/1) ... [2024-10-11 12:40:15,399 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-10-11 12:40:15,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:40:15,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:40:15,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:40:15,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:40:15,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (1/1) ... [2024-10-11 12:40:15,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (1/1) ... [2024-10-11 12:40:15,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (1/1) ... [2024-10-11 12:40:15,439 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:40:15,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (1/1) ... [2024-10-11 12:40:15,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (1/1) ... [2024-10-11 12:40:15,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (1/1) ... [2024-10-11 12:40:15,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (1/1) ... [2024-10-11 12:40:15,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (1/1) ... [2024-10-11 12:40:15,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (1/1) ... [2024-10-11 12:40:15,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:40:15,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:40:15,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:40:15,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:40:15,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (1/1) ... [2024-10-11 12:40:15,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:40:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:40:15,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:40:15,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:40:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:40:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:40:15,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:40:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:40:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:40:15,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:40:15,688 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:40:15,690 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:40:15,957 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 12:40:15,957 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:40:15,983 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:40:15,983 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:40:15,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:40:15 BoogieIcfgContainer [2024-10-11 12:40:15,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:40:15,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:40:15,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:40:15,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:40:15,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:40:14" (1/3) ... [2024-10-11 12:40:15,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a53a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:40:15, skipping insertion in model container [2024-10-11 12:40:15,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:15" (2/3) ... [2024-10-11 12:40:15,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a53a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:40:15, skipping insertion in model container [2024-10-11 12:40:15,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:40:15" (3/3) ... [2024-10-11 12:40:15,994 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-82.i [2024-10-11 12:40:16,011 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:40:16,012 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:40:16,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:40:16,088 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;@34c54be9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:40:16,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:40:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:40:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 12:40:16,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:40:16,106 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:40:16,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:40:16,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:40:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1244330827, now seen corresponding path program 1 times [2024-10-11 12:40:16,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:40:16,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74190642] [2024-10-11 12:40:16,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:40:16,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:40:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:40:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:40:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:40:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:40:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:40:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:40:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:40:16,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:40:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74190642] [2024-10-11 12:40:16,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74190642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:40:16,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:40:16,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:40:16,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363576406] [2024-10-11 12:40:16,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:40:16,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:40:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:40:16,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:40:16,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:40:16,399 INFO L87 Difference]: Start difference. First operand has 39 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 12:40:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:40:16,442 INFO L93 Difference]: Finished difference Result 71 states and 114 transitions. [2024-10-11 12:40:16,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:40:16,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2024-10-11 12:40:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:40:16,453 INFO L225 Difference]: With dead ends: 71 [2024-10-11 12:40:16,453 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 12:40:16,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:40:16,460 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:40:16,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:40:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 12:40:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 12:40:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:40:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2024-10-11 12:40:16,500 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 46 [2024-10-11 12:40:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:40:16,502 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-10-11 12:40:16,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 12:40:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2024-10-11 12:40:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 12:40:16,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:40:16,506 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:40:16,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:40:16,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:40:16,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:40:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2100401977, now seen corresponding path program 1 times [2024-10-11 12:40:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:40:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367884460] [2024-10-11 12:40:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:40:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:40:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:40:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:40:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:40:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:40:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:40:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:40:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:40:16,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:40:16,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367884460] [2024-10-11 12:40:16,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367884460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:40:16,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:40:16,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:40:16,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832854433] [2024-10-11 12:40:16,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:40:16,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:40:16,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:40:16,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:40:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:40:16,839 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:40:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:40:16,917 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2024-10-11 12:40:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:40:16,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2024-10-11 12:40:16,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:40:16,920 INFO L225 Difference]: With dead ends: 79 [2024-10-11 12:40:16,920 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 12:40:16,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:40:16,922 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:40:16,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 107 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:40:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 12:40:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2024-10-11 12:40:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:40:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-10-11 12:40:16,931 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 46 [2024-10-11 12:40:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:40:16,933 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-10-11 12:40:16,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:40:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-10-11 12:40:16,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 12:40:16,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:40:16,935 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:40:16,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:40:16,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:40:16,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:40:16,936 INFO L85 PathProgramCache]: Analyzing trace with hash -633405186, now seen corresponding path program 1 times [2024-10-11 12:40:16,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:40:16,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667724436] [2024-10-11 12:40:16,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:40:16,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:40:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:40:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:40:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:40:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:17,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:40:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:17,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:40:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:17,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:40:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:40:17,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:40:17,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667724436] [2024-10-11 12:40:17,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667724436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:40:17,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:40:17,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:40:17,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778011910] [2024-10-11 12:40:17,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:40:17,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:40:17,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:40:17,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:40:17,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:40:17,617 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:40:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:40:17,834 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2024-10-11 12:40:17,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:40:17,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 48 [2024-10-11 12:40:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:40:17,837 INFO L225 Difference]: With dead ends: 89 [2024-10-11 12:40:17,837 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 12:40:17,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:40:17,839 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 47 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:40:17,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 199 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:40:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 12:40:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2024-10-11 12:40:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.293103448275862) internal successors, (75), 59 states have internal predecessors, (75), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 12:40:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2024-10-11 12:40:17,864 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 48 [2024-10-11 12:40:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:40:17,866 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2024-10-11 12:40:17,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:40:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2024-10-11 12:40:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 12:40:17,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:40:17,869 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:40:17,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:40:17,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:40:17,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:40:17,871 INFO L85 PathProgramCache]: Analyzing trace with hash 67659392, now seen corresponding path program 1 times [2024-10-11 12:40:17,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:40:17,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010027967] [2024-10-11 12:40:17,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:40:17,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:40:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:40:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:40:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:40:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:40:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:40:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:40:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:40:18,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:40:18,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010027967] [2024-10-11 12:40:18,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010027967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:40:18,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:40:18,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:40:18,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370940111] [2024-10-11 12:40:18,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:40:18,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:40:18,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:40:18,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:40:18,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:40:18,177 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:40:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:40:18,385 INFO L93 Difference]: Finished difference Result 184 states and 245 transitions. [2024-10-11 12:40:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:40:18,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 48 [2024-10-11 12:40:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:40:18,396 INFO L225 Difference]: With dead ends: 184 [2024-10-11 12:40:18,398 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 12:40:18,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:40:18,400 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 43 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:40:18,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 157 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:40:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 12:40:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2024-10-11 12:40:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.25) internal successors, (85), 69 states have internal predecessors, (85), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:40:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2024-10-11 12:40:18,423 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 48 [2024-10-11 12:40:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:40:18,424 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2024-10-11 12:40:18,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:40:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2024-10-11 12:40:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 12:40:18,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:40:18,426 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:40:18,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:40:18,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:40:18,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:40:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1663375898, now seen corresponding path program 1 times [2024-10-11 12:40:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:40:18,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060747931] [2024-10-11 12:40:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:40:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:40:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:40:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:40:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:40:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:40:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:40:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:40:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:40:18,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:40:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060747931] [2024-10-11 12:40:18,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060747931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:40:18,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:40:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:40:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744420882] [2024-10-11 12:40:18,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:40:18,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:40:18,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:40:18,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:40:18,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:40:18,657 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:40:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:40:18,733 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2024-10-11 12:40:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:40:18,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-10-11 12:40:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:40:18,736 INFO L225 Difference]: With dead ends: 154 [2024-10-11 12:40:18,737 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 12:40:18,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:40:18,739 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:40:18,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 81 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:40:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 12:40:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2024-10-11 12:40:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 55 states have internal predecessors, (60), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 12:40:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2024-10-11 12:40:18,755 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 49 [2024-10-11 12:40:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:40:18,755 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2024-10-11 12:40:18,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:40:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2024-10-11 12:40:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 12:40:18,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:40:18,757 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 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] [2024-10-11 12:40:18,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 12:40:18,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:40:18,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:40:18,758 INFO L85 PathProgramCache]: Analyzing trace with hash -720654580, now seen corresponding path program 1 times [2024-10-11 12:40:18,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:40:18,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784990766] [2024-10-11 12:40:18,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:40:18,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:40:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:40:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:40:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:40:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:40:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:40:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:40:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 12:40:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 12:40:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 12:40:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 12:40:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 12:40:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 12:40:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:40:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-10-11 12:40:19,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:40:19,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784990766] [2024-10-11 12:40:19,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784990766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:40:19,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:40:19,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:40:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497652728] [2024-10-11 12:40:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:40:19,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:40:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:40:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:40:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:40:19,188 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:40:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:40:19,302 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2024-10-11 12:40:19,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:40:19,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 95 [2024-10-11 12:40:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:40:19,303 INFO L225 Difference]: With dead ends: 81 [2024-10-11 12:40:19,303 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 12:40:19,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:40:19,304 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 31 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:40:19,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 175 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:40:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 12:40:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 12:40:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 12:40:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 12:40:19,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2024-10-11 12:40:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:40:19,306 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 12:40:19,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:40:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 12:40:19,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 12:40:19,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:40:19,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 12:40:19,313 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 12:40:19,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 12:40:19,707 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:40:19,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:40:19 BoogieIcfgContainer [2024-10-11 12:40:19,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:40:19,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:40:19,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:40:19,729 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:40:19,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:40:15" (3/4) ... [2024-10-11 12:40:19,732 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 12:40:19,735 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 12:40:19,739 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 12:40:19,739 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 12:40:19,739 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 12:40:19,739 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 12:40:19,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 12:40:19,832 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 12:40:19,832 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:40:19,833 INFO L158 Benchmark]: Toolchain (without parser) took 4890.36ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 96.0MB in the beginning and 146.2MB in the end (delta: -50.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:40:19,833 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory was 110.3MB in the beginning and 110.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:40:19,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.08ms. Allocated memory is still 151.0MB. Free memory was 95.7MB in the beginning and 81.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:40:19,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.66ms. Allocated memory is still 151.0MB. Free memory was 81.9MB in the beginning and 79.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:40:19,834 INFO L158 Benchmark]: Boogie Preprocessor took 66.25ms. Allocated memory is still 151.0MB. Free memory was 79.2MB in the beginning and 76.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:40:19,834 INFO L158 Benchmark]: RCFGBuilder took 516.34ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 76.3MB in the beginning and 146.2MB in the end (delta: -69.9MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-10-11 12:40:19,834 INFO L158 Benchmark]: TraceAbstraction took 3742.43ms. Allocated memory is still 186.6MB. Free memory was 146.2MB in the beginning and 151.5MB in the end (delta: -5.3MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. [2024-10-11 12:40:19,835 INFO L158 Benchmark]: Witness Printer took 103.04ms. Allocated memory is still 186.6MB. Free memory was 151.5MB in the beginning and 146.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 12:40:19,836 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.15ms. Allocated memory is still 151.0MB. Free memory was 110.3MB in the beginning and 110.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.08ms. Allocated memory is still 151.0MB. Free memory was 95.7MB in the beginning and 81.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.66ms. Allocated memory is still 151.0MB. Free memory was 81.9MB in the beginning and 79.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.25ms. Allocated memory is still 151.0MB. Free memory was 79.2MB in the beginning and 76.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 516.34ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 76.3MB in the beginning and 146.2MB in the end (delta: -69.9MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3742.43ms. Allocated memory is still 186.6MB. Free memory was 146.2MB in the beginning and 151.5MB in the end (delta: -5.3MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. * Witness Printer took 103.04ms. Allocated memory is still 186.6MB. Free memory was 151.5MB in the beginning and 146.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.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: 19]: 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 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 761 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 508 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 273 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 253 mSDtfsCounter, 273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 59 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 326 ConstructedInterpolants, 0 QuantifiedInterpolants, 916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 586/586 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: 81]: Loop Invariant Derived loop invariant: ((((((((long long) last_1_var_1_10 + 10) <= 0) && (((long long) var_1_10 + 10) <= 0)) && (var_1_5 <= 255)) && (0 <= var_1_5)) || (((var_1_5 <= 255) && (0 <= var_1_5)) && (var_1_5 == var_1_9))) || (((0 <= 0) && (var_1_5 == var_1_9)) && (var_1_10 == var_1_9))) RESULT: Ultimate proved your program to be correct! [2024-10-11 12:40:19,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE