./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_loopvsstraightlinecode_25-1loop_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_loopvsstraightlinecode_25-1loop_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 94517564427e872c49cfdf1d666acd8c5b1d1d7f855fe0e11d067a0d3a0e2e28 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:32:08,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:32:08,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:32:08,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:32:08,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:32:08,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:32:08,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:32:08,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:32:08,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:32:08,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:32:08,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:32:08,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:32:08,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:32:08,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:32:08,696 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:32:08,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:32:08,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:32:08,697 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:32:08,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:32:08,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:32:08,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:32:08,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:32:08,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:32:08,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:32:08,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:32:08,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:32:08,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:32:08,704 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:32:08,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:32:08,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:32:08,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:32:08,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:32:08,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:32:08,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:32:08,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:32:08,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:32:08,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:32:08,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:32:08,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:32:08,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:32:08,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:32:08,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:32:08,708 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 -> 94517564427e872c49cfdf1d666acd8c5b1d1d7f855fe0e11d067a0d3a0e2e28 [2024-10-11 11:32:08,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:32:09,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:32:09,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:32:09,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:32:09,011 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:32:09,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i [2024-10-11 11:32:10,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:32:10,693 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:32:10,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i [2024-10-11 11:32:10,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aa8d82d0f/45021da17c5d4d5d8f2b672d9fc7dc09/FLAGe75103e53 [2024-10-11 11:32:10,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aa8d82d0f/45021da17c5d4d5d8f2b672d9fc7dc09 [2024-10-11 11:32:10,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:32:10,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:32:10,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:32:10,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:32:10,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:32:10,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:10,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b52bceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10, skipping insertion in model container [2024-10-11 11:32:10,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:10,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:32:10,915 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_loopvsstraightlinecode_25-1loop_file-82.i[915,928] [2024-10-11 11:32:10,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:32:10,958 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:32:10,968 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_loopvsstraightlinecode_25-1loop_file-82.i[915,928] [2024-10-11 11:32:10,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:32:10,995 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:32:10,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10 WrapperNode [2024-10-11 11:32:10,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:32:10,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:32:10,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:32:10,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:32:11,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:11,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:11,040 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-10-11 11:32:11,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:32:11,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:32:11,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:32:11,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:32:11,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:11,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:11,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:11,097 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 11:32:11,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:11,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:11,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:11,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:11,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:11,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:11,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:32:11,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:32:11,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:32:11,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:32:11,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (1/1) ... [2024-10-11 11:32:11,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:32:11,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:32:11,228 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 11:32:11,230 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 11:32:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:32:11,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:32:11,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:32:11,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:32:11,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:32:11,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:32:11,332 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:32:11,334 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:32:11,567 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 11:32:11,570 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:32:11,598 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:32:11,598 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:32:11,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:32:11 BoogieIcfgContainer [2024-10-11 11:32:11,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:32:11,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:32:11,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:32:11,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:32:11,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:32:10" (1/3) ... [2024-10-11 11:32:11,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a62d7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:32:11, skipping insertion in model container [2024-10-11 11:32:11,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:10" (2/3) ... [2024-10-11 11:32:11,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a62d7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:32:11, skipping insertion in model container [2024-10-11 11:32:11,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:32:11" (3/3) ... [2024-10-11 11:32:11,607 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-82.i [2024-10-11 11:32:11,621 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:32:11,621 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:32:11,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:32:11,674 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;@2317c74c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:32:11,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:32:11,678 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 11:32:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 11:32:11,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:32:11,685 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 11:32:11,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:32:11,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:32:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2063194076, now seen corresponding path program 1 times [2024-10-11 11:32:11,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:32:11,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307573389] [2024-10-11 11:32:11,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:32:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:32:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:11,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:32:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:11,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:32:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:11,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:32:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:11,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:32:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:11,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:32:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:11,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:32:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:11,895 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 11:32:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:32:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307573389] [2024-10-11 11:32:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307573389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:32:11,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:32:11,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:32:11,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838141862] [2024-10-11 11:32:11,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:32:11,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:32:11,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:32:11,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:32:11,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:32:11,936 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 11:32:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:32:11,970 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2024-10-11 11:32:11,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:32:11,973 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 11:32:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:32:11,983 INFO L225 Difference]: With dead ends: 73 [2024-10-11 11:32:11,983 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 11:32:11,987 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 11:32:11,992 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:32:11,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:32:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 11:32:12,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 11:32:12,025 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 11:32:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2024-10-11 11:32:12,028 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 46 [2024-10-11 11:32:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:32:12,029 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-10-11 11:32:12,029 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 11:32:12,029 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2024-10-11 11:32:12,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 11:32:12,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:32:12,031 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 11:32:12,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:32:12,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:32:12,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:32:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1112959584, now seen corresponding path program 1 times [2024-10-11 11:32:12,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:32:12,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153022485] [2024-10-11 11:32:12,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:32:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:32:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:32:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:32:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:32:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:32:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:32:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:32:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,267 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 11:32:12,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:32:12,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153022485] [2024-10-11 11:32:12,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153022485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:32:12,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:32:12,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:32:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725382782] [2024-10-11 11:32:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:32:12,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:32:12,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:32:12,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:32:12,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:32:12,271 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 11:32:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:32:12,330 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2024-10-11 11:32:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:32:12,331 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 11:32:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:32:12,332 INFO L225 Difference]: With dead ends: 79 [2024-10-11 11:32:12,332 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 11:32:12,333 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 11:32:12,334 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 13 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:32:12,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 104 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:32:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 11:32:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2024-10-11 11:32:12,343 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 11:32:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-10-11 11:32:12,346 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 46 [2024-10-11 11:32:12,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:32:12,348 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-10-11 11:32:12,348 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 11:32:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-10-11 11:32:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 11:32:12,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:32:12,352 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 11:32:12,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:32:12,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:32:12,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:32:12,353 INFO L85 PathProgramCache]: Analyzing trace with hash -380540155, now seen corresponding path program 1 times [2024-10-11 11:32:12,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:32:12,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416718607] [2024-10-11 11:32:12,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:32:12,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:32:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:32:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:32:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:32:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:32:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:32:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:32:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:12,854 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 11:32:12,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:32:12,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416718607] [2024-10-11 11:32:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416718607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:32:12,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:32:12,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:32:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797859625] [2024-10-11 11:32:12,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:32:12,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:32:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:32:12,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:32:12,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:32:12,859 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 11:32:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:32:13,019 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2024-10-11 11:32:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:32:13,021 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 11:32:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:32:13,022 INFO L225 Difference]: With dead ends: 70 [2024-10-11 11:32:13,022 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 11:32:13,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:32:13,023 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 47 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:32:13,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 172 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:32:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 11:32:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2024-10-11 11:32:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 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 11:32:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2024-10-11 11:32:13,042 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 48 [2024-10-11 11:32:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:32:13,042 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2024-10-11 11:32:13,042 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 11:32:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2024-10-11 11:32:13,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 11:32:13,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:32:13,044 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 11:32:13,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:32:13,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:32:13,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:32:13,045 INFO L85 PathProgramCache]: Analyzing trace with hash 912170776, now seen corresponding path program 1 times [2024-10-11 11:32:13,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:32:13,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79837557] [2024-10-11 11:32:13,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:32:13,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:32:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:32:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:32:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:32:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:32:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:32:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:32:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,316 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 11:32:13,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:32:13,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79837557] [2024-10-11 11:32:13,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79837557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:32:13,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:32:13,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:32:13,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453459450] [2024-10-11 11:32:13,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:32:13,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:32:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:32:13,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:32:13,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:32:13,319 INFO L87 Difference]: Start difference. First operand 54 states and 70 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 11:32:13,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:32:13,392 INFO L93 Difference]: Finished difference Result 134 states and 171 transitions. [2024-10-11 11:32:13,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:32:13,393 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 11:32:13,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:32:13,395 INFO L225 Difference]: With dead ends: 134 [2024-10-11 11:32:13,395 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 11:32:13,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 11:32:13,396 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:32:13,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 85 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:32:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 11:32:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2024-10-11 11:32:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 64 states have internal predecessors, (73), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 11:32:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2024-10-11 11:32:13,410 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 49 [2024-10-11 11:32:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:32:13,411 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2024-10-11 11:32:13,411 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 11:32:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2024-10-11 11:32:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 11:32:13,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:32:13,412 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 11:32:13,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:32:13,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:32:13,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:32:13,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1170336214, now seen corresponding path program 1 times [2024-10-11 11:32:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:32:13,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636946016] [2024-10-11 11:32:13,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:32:13,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:32:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:32:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:32:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:32:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:32:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:32:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:32:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,624 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 11:32:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:32:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636946016] [2024-10-11 11:32:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636946016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:32:13,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:32:13,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:32:13,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913809577] [2024-10-11 11:32:13,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:32:13,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:32:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:32:13,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:32:13,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:32:13,626 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 11:32:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:32:13,786 INFO L93 Difference]: Finished difference Result 180 states and 224 transitions. [2024-10-11 11:32:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:32:13,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 11:32:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:32:13,787 INFO L225 Difference]: With dead ends: 180 [2024-10-11 11:32:13,788 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 11:32:13,788 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 11:32:13,789 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 34 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:32:13,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 145 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:32:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 11:32:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2024-10-11 11:32:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:32:13,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-10-11 11:32:13,806 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 49 [2024-10-11 11:32:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:32:13,807 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-10-11 11:32:13,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 11:32:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-10-11 11:32:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 11:32:13,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:32:13,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:32:13,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:32:13,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:32:13,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:32:13,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1594345203, now seen corresponding path program 1 times [2024-10-11 11:32:13,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:32:13,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896038993] [2024-10-11 11:32:13,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:32:13,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:32:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:32:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:32:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:32:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:32:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:32:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:32:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 11:32:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:32:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:32:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 11:32:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 11:32:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 11:32:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:32:13,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:32:13,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896038993] [2024-10-11 11:32:13,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896038993] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:32:13,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433872194] [2024-10-11 11:32:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:32:13,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:32:13,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:32:13,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:32:13,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:32:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:14,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 11:32:14,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:32:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-11 11:32:14,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:32:14,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433872194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:32:14,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:32:14,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-10-11 11:32:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337725331] [2024-10-11 11:32:14,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:32:14,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:32:14,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:32:14,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:32:14,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:32:14,089 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:32:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:32:14,112 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2024-10-11 11:32:14,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:32:14,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2024-10-11 11:32:14,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:32:14,113 INFO L225 Difference]: With dead ends: 80 [2024-10-11 11:32:14,113 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 11:32:14,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 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 11:32:14,116 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:32:14,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 67 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:32:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 11:32:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 11:32:14,117 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 11:32:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 11:32:14,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2024-10-11 11:32:14,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:32:14,120 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 11:32:14,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:32:14,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 11:32:14,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 11:32:14,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:32:14,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:32:14,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:32:14,331 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 11:32:14,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 11:32:14,435 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:32:14,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:32:14 BoogieIcfgContainer [2024-10-11 11:32:14,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:32:14,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:32:14,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:32:14,451 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:32:14,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:32:11" (3/4) ... [2024-10-11 11:32:14,452 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 11:32:14,459 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 11:32:14,466 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 11:32:14,466 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 11:32:14,467 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 11:32:14,467 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 11:32:14,580 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 11:32:14,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 11:32:14,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:32:14,582 INFO L158 Benchmark]: Toolchain (without parser) took 3858.18ms. Allocated memory was 201.3MB in the beginning and 260.0MB in the end (delta: 58.7MB). Free memory was 132.7MB in the beginning and 145.4MB in the end (delta: -12.7MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2024-10-11 11:32:14,582 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 169.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:32:14,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.73ms. Allocated memory is still 201.3MB. Free memory was 132.5MB in the beginning and 119.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 11:32:14,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.14ms. Allocated memory is still 201.3MB. Free memory was 119.0MB in the beginning and 116.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:32:14,583 INFO L158 Benchmark]: Boogie Preprocessor took 85.25ms. Allocated memory is still 201.3MB. Free memory was 116.4MB in the beginning and 171.6MB in the end (delta: -55.2MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-10-11 11:32:14,583 INFO L158 Benchmark]: RCFGBuilder took 468.72ms. Allocated memory is still 201.3MB. Free memory was 171.5MB in the beginning and 154.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:32:14,583 INFO L158 Benchmark]: TraceAbstraction took 2849.25ms. Allocated memory was 201.3MB in the beginning and 260.0MB in the end (delta: 58.7MB). Free memory was 153.5MB in the beginning and 150.7MB in the end (delta: 2.8MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2024-10-11 11:32:14,583 INFO L158 Benchmark]: Witness Printer took 130.65ms. Allocated memory is still 260.0MB. Free memory was 150.7MB in the beginning and 145.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:32:14,591 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 169.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.73ms. Allocated memory is still 201.3MB. Free memory was 132.5MB in the beginning and 119.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.14ms. Allocated memory is still 201.3MB. Free memory was 119.0MB in the beginning and 116.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.25ms. Allocated memory is still 201.3MB. Free memory was 116.4MB in the beginning and 171.6MB in the end (delta: -55.2MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * RCFGBuilder took 468.72ms. Allocated memory is still 201.3MB. Free memory was 171.5MB in the beginning and 154.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2849.25ms. Allocated memory was 201.3MB in the beginning and 260.0MB in the end (delta: 58.7MB). Free memory was 153.5MB in the beginning and 150.7MB in the end (delta: 2.8MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. * Witness Printer took 130.65ms. Allocated memory is still 260.0MB. Free memory was 150.7MB in the beginning and 145.4MB in the end (delta: 5.3MB). 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: 2.7s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 615 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 386 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 229 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 66 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 423 ConstructedInterpolants, 0 QuantifiedInterpolants, 889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 871/872 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: 82]: Loop Invariant Derived loop invariant: (((1 <= k_loop) && (var_1_5 == var_1_9)) || (((((0 <= 0) && (((long long) last_1_var_1_10 + 10) <= 0)) && (((long long) var_1_10 + 10) <= 0)) && (0 <= k_loop)) && (0 <= var_1_5))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((0 <= 0) && (((long long) last_1_var_1_10 + 10) <= 0)) && (((long long) var_1_10 + 10) <= 0)) && (0 <= var_1_5)) Ensures: ((((0 <= 0) && (((long long) last_1_var_1_10 + 10) <= 0)) && (((long long) var_1_10 + 10) <= 0)) && (0 <= var_1_5)) RESULT: Ultimate proved your program to be correct! [2024-10-11 11:32:14,618 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