./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-90.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 213a6773a680bcbd913164a5664bc5a26b44f83b15a409d83afc4623b719c3ae --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:15:09,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:15:09,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:15:09,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:15:09,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:15:09,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:15:09,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:15:09,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:15:09,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:15:09,921 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:15:09,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:15:09,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:15:09,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:15:09,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:15:09,926 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:15:09,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:15:09,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:15:09,927 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:15:09,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:15:09,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:15:09,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:15:09,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:15:09,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:15:09,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:15:09,931 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:15:09,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:15:09,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:15:09,932 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:15:09,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:15:09,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:15:09,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:15:09,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:15:09,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:15:09,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:15:09,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:15:09,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:15:09,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:15:09,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:15:09,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:15:09,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:15:09,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:15:09,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:15:09,937 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 213a6773a680bcbd913164a5664bc5a26b44f83b15a409d83afc4623b719c3ae [2024-11-12 06:15:10,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:15:10,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:15:10,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:15:10,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:15:10,240 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:15:10,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-90.i [2024-11-12 06:15:11,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:15:11,922 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:15:11,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-90.i [2024-11-12 06:15:11,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326731af4/91426616d854473ba8cd57a421c83779/FLAG2dd114d87 [2024-11-12 06:15:11,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326731af4/91426616d854473ba8cd57a421c83779 [2024-11-12 06:15:11,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:15:11,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:15:11,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:15:11,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:15:11,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:15:11,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:15:11" (1/1) ... [2024-11-12 06:15:11,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8fd1565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:11, skipping insertion in model container [2024-11-12 06:15:11,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:15:11" (1/1) ... [2024-11-12 06:15:11,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:15:12,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-90.i[915,928] [2024-11-12 06:15:12,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:15:12,170 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:15:12,185 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-90.i[915,928] [2024-11-12 06:15:12,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:15:12,207 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:15:12,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12 WrapperNode [2024-11-12 06:15:12,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:15:12,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:15:12,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:15:12,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:15:12,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (1/1) ... [2024-11-12 06:15:12,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (1/1) ... [2024-11-12 06:15:12,245 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2024-11-12 06:15:12,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:15:12,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:15:12,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:15:12,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:15:12,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (1/1) ... [2024-11-12 06:15:12,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (1/1) ... [2024-11-12 06:15:12,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (1/1) ... [2024-11-12 06:15:12,307 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:15:12,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (1/1) ... [2024-11-12 06:15:12,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (1/1) ... [2024-11-12 06:15:12,319 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (1/1) ... [2024-11-12 06:15:12,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (1/1) ... [2024-11-12 06:15:12,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (1/1) ... [2024-11-12 06:15:12,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (1/1) ... [2024-11-12 06:15:12,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:15:12,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:15:12,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:15:12,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:15:12,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (1/1) ... [2024-11-12 06:15:12,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:15:12,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:15:12,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:15:12,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:15:12,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:15:12,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:15:12,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:15:12,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:15:12,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:15:12,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:15:12,502 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:15:12,504 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:15:12,683 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 06:15:12,687 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:15:12,705 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:15:12,706 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:15:12,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:15:12 BoogieIcfgContainer [2024-11-12 06:15:12,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:15:12,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:15:12,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:15:12,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:15:12,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:15:11" (1/3) ... [2024-11-12 06:15:12,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8054fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:15:12, skipping insertion in model container [2024-11-12 06:15:12,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:12" (2/3) ... [2024-11-12 06:15:12,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8054fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:15:12, skipping insertion in model container [2024-11-12 06:15:12,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:15:12" (3/3) ... [2024-11-12 06:15:12,717 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-90.i [2024-11-12 06:15:12,738 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:15:12,738 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:15:12,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:15:12,799 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;@64f9602e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:15:12,799 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:15:12,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 06:15:12,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 06:15:12,809 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:15:12,810 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:15:12,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:15:12,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:15:12,814 INFO L85 PathProgramCache]: Analyzing trace with hash -150909191, now seen corresponding path program 1 times [2024-11-12 06:15:12,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:15:12,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198970648] [2024-11-12 06:15:12,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:15:12,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:15:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:12,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:15:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:15:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:15:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:15:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:15:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:15:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:15:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:15:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 06:15:13,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:15:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198970648] [2024-11-12 06:15:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198970648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:15:13,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:15:13,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:15:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893731887] [2024-11-12 06:15:13,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:15:13,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:15:13,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:15:13,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:15:13,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:15:13,100 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 06:15:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:15:13,117 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2024-11-12 06:15:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:15:13,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-11-12 06:15:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:15:13,127 INFO L225 Difference]: With dead ends: 59 [2024-11-12 06:15:13,127 INFO L226 Difference]: Without dead ends: 29 [2024-11-12 06:15:13,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-11-12 06:15:13,133 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:15:13,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:15:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-12 06:15:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-12 06:15:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 06:15:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-11-12 06:15:13,178 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 54 [2024-11-12 06:15:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:15:13,179 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-12 06:15:13,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 06:15:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-12 06:15:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 06:15:13,183 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:15:13,183 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:15:13,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:15:13,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:15:13,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:15:13,185 INFO L85 PathProgramCache]: Analyzing trace with hash -956776711, now seen corresponding path program 1 times [2024-11-12 06:15:13,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:15:13,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110171088] [2024-11-12 06:15:13,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:15:13,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:15:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:15:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:15:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:15:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:15:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:15:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:15:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:15:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:15:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 06:15:13,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:15:13,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110171088] [2024-11-12 06:15:13,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110171088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:15:13,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:15:13,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 06:15:13,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563137954] [2024-11-12 06:15:13,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:15:13,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:15:13,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:15:13,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:15:13,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:15:13,834 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 06:15:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:15:14,103 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-11-12 06:15:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 06:15:14,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 54 [2024-11-12 06:15:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:15:14,108 INFO L225 Difference]: With dead ends: 63 [2024-11-12 06:15:14,108 INFO L226 Difference]: Without dead ends: 61 [2024-11-12 06:15:14,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 06:15:14,110 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:15:14,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 163 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:15:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-12 06:15:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2024-11-12 06:15:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 06:15:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2024-11-12 06:15:14,131 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 54 [2024-11-12 06:15:14,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:15:14,132 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-11-12 06:15:14,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 06:15:14,132 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2024-11-12 06:15:14,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 06:15:14,134 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:15:14,134 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:15:14,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:15:14,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:15:14,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:15:14,135 INFO L85 PathProgramCache]: Analyzing trace with hash 458194769, now seen corresponding path program 1 times [2024-11-12 06:15:14,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:15:14,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530812895] [2024-11-12 06:15:14,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:15:14,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:15:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:15:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:15:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:15:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:15:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:15:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:15:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:15:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:15:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 06:15:14,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:15:14,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530812895] [2024-11-12 06:15:14,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530812895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:15:14,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:15:14,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 06:15:14,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633347422] [2024-11-12 06:15:14,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:15:14,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:15:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:15:14,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:15:14,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:15:14,457 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 06:15:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:15:14,578 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2024-11-12 06:15:14,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 06:15:14,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-11-12 06:15:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:15:14,582 INFO L225 Difference]: With dead ends: 58 [2024-11-12 06:15:14,582 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 06:15:14,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 06:15:14,583 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:15:14,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:15:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 06:15:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-12 06:15:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 06:15:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2024-11-12 06:15:14,603 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 55 [2024-11-12 06:15:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:15:14,604 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-11-12 06:15:14,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 06:15:14,604 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2024-11-12 06:15:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 06:15:14,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:15:14,609 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:15:14,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:15:14,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:15:14,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:15:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash 460041811, now seen corresponding path program 1 times [2024-11-12 06:15:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:15:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659320192] [2024-11-12 06:15:14,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:15:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:15:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:15:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:15:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:15:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:15:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:15:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:15:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:15:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:15:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 06:15:14,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:15:14,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659320192] [2024-11-12 06:15:14,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659320192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:15:14,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:15:14,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:15:14,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036249586] [2024-11-12 06:15:14,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:15:14,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:15:14,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:15:14,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:15:14,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:15:14,879 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 06:15:15,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:15:15,007 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2024-11-12 06:15:15,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:15:15,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-11-12 06:15:15,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:15:15,009 INFO L225 Difference]: With dead ends: 85 [2024-11-12 06:15:15,009 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 06:15:15,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:15:15,011 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:15:15,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 112 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:15:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 06:15:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-12 06:15:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 06:15:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-11-12 06:15:15,031 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 55 [2024-11-12 06:15:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:15:15,032 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-11-12 06:15:15,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 06:15:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-11-12 06:15:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 06:15:15,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:15:15,034 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 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-11-12 06:15:15,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:15:15,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:15:15,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:15:15,036 INFO L85 PathProgramCache]: Analyzing trace with hash 21912416, now seen corresponding path program 1 times [2024-11-12 06:15:15,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:15:15,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799830755] [2024-11-12 06:15:15,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:15:15,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:15:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:15:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:15:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:15:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:15:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:15:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:15:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:15:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:15:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 06:15:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:15:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 06:15:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:15:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 06:15:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:15:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 06:15:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 06:15:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,373 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2024-11-12 06:15:15,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:15:15,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799830755] [2024-11-12 06:15:15,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799830755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:15:15,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:15:15,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:15:15,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480787296] [2024-11-12 06:15:15,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:15:15,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:15:15,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:15:15,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:15:15,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:15:15,376 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 06:15:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:15:15,469 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2024-11-12 06:15:15,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:15:15,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 105 [2024-11-12 06:15:15,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:15:15,471 INFO L225 Difference]: With dead ends: 61 [2024-11-12 06:15:15,471 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 06:15:15,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:15:15,472 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:15:15,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 147 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:15:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 06:15:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2024-11-12 06:15:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 06:15:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-11-12 06:15:15,490 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 105 [2024-11-12 06:15:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:15:15,491 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-11-12 06:15:15,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 06:15:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-11-12 06:15:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 06:15:15,494 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:15:15,494 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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-11-12 06:15:15,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 06:15:15,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:15:15,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:15:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash 734633676, now seen corresponding path program 1 times [2024-11-12 06:15:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:15:15,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190845323] [2024-11-12 06:15:15,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:15:15,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:15:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:15:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:15:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:15:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:15:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:15:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:15:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:15:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:15:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 06:15:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:15:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 06:15:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:15:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 06:15:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:15:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 06:15:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 06:15:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:15:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2024-11-12 06:15:15,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:15:15,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190845323] [2024-11-12 06:15:15,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190845323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:15:15,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:15:15,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 06:15:15,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712062293] [2024-11-12 06:15:15,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:15:15,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:15:15,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:15:15,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:15:15,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:15:15,789 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 06:15:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:15:15,900 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-12 06:15:15,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 06:15:15,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 106 [2024-11-12 06:15:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:15:15,905 INFO L225 Difference]: With dead ends: 53 [2024-11-12 06:15:15,905 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 06:15:15,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 06:15:15,907 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:15:15,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 159 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:15:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 06:15:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 06:15:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 06:15:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 06:15:15,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2024-11-12 06:15:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:15:15,912 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 06:15:15,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 06:15:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 06:15:15,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 06:15:15,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:15:15,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 06:15:15,922 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 06:15:15,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 06:15:15,965 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:15:15,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:15:15 BoogieIcfgContainer [2024-11-12 06:15:15,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:15:15,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:15:15,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:15:15,987 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:15:15,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:15:12" (3/4) ... [2024-11-12 06:15:15,990 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 06:15:15,996 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 06:15:16,000 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-12 06:15:16,001 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 06:15:16,002 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 06:15:16,002 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 06:15:16,092 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 06:15:16,093 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 06:15:16,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:15:16,093 INFO L158 Benchmark]: Toolchain (without parser) took 4144.96ms. Allocated memory was 174.1MB in the beginning and 239.1MB in the end (delta: 65.0MB). Free memory was 103.9MB in the beginning and 144.3MB in the end (delta: -40.4MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-11-12 06:15:16,093 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 174.1MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:15:16,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.87ms. Allocated memory is still 174.1MB. Free memory was 103.6MB in the beginning and 90.8MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:15:16,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.67ms. Allocated memory is still 174.1MB. Free memory was 90.8MB in the beginning and 89.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:15:16,094 INFO L158 Benchmark]: Boogie Preprocessor took 88.68ms. Allocated memory is still 174.1MB. Free memory was 145.3MB in the beginning and 143.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:15:16,094 INFO L158 Benchmark]: RCFGBuilder took 346.54ms. Allocated memory is still 174.1MB. Free memory was 143.2MB in the beginning and 131.3MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 06:15:16,095 INFO L158 Benchmark]: TraceAbstraction took 3277.34ms. Allocated memory was 174.1MB in the beginning and 239.1MB in the end (delta: 65.0MB). Free memory was 130.6MB in the beginning and 149.5MB in the end (delta: -18.9MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2024-11-12 06:15:16,095 INFO L158 Benchmark]: Witness Printer took 106.24ms. Allocated memory is still 239.1MB. Free memory was 149.5MB in the beginning and 144.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 06:15:16,097 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 174.1MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.87ms. Allocated memory is still 174.1MB. Free memory was 103.6MB in the beginning and 90.8MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.67ms. Allocated memory is still 174.1MB. Free memory was 90.8MB in the beginning and 89.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 88.68ms. Allocated memory is still 174.1MB. Free memory was 145.3MB in the beginning and 143.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 346.54ms. Allocated memory is still 174.1MB. Free memory was 143.2MB in the beginning and 131.3MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3277.34ms. Allocated memory was 174.1MB in the beginning and 239.1MB in the end (delta: 65.0MB). Free memory was 130.6MB in the beginning and 149.5MB in the end (delta: -18.9MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. * Witness Printer took 106.24ms. Allocated memory is still 239.1MB. Free memory was 149.5MB in the beginning and 144.3MB 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 789 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 583 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 300 IncrementalHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 206 mSDtfsCounter, 300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=2, InterpolantAutomatonStates: 34, 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, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 423 ConstructedInterpolants, 0 QuantifiedInterpolants, 929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1444/1444 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: 67]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (last_1_var_1_1 == \old(last_1_var_1_1))) RESULT: Ultimate proved your program to be correct! [2024-11-12 06:15:16,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE