./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-82.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 339edc38035dfe8cb71e349cc2d95f28254ea4491ede16137abb97bcdb10ff6a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:28:54,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:28:54,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:28:54,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:28:54,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:28:54,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:28:54,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:28:54,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:28:54,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:28:54,175 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:28:54,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:28:54,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:28:54,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:28:54,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:28:54,189 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:28:54,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:28:54,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:28:54,190 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:28:54,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:28:54,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:28:54,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:28:54,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:28:54,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:28:54,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:28:54,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:28:54,195 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:28:54,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:28:54,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:28:54,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:28:54,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:28:54,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:28:54,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:28:54,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:28:54,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:28:54,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:28:54,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:28:54,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:28:54,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:28:54,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:28:54,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:28:54,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:28:54,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:28:54,200 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 -> 339edc38035dfe8cb71e349cc2d95f28254ea4491ede16137abb97bcdb10ff6a [2024-10-14 12:28:54,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:28:54,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:28:54,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:28:54,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:28:54,494 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:28:54,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-82.i [2024-10-14 12:28:56,018 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:28:56,217 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:28:56,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-82.i [2024-10-14 12:28:56,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f42cb404/62f65700ed28461ebd0e2fbf5ea49378/FLAGa7764a91e [2024-10-14 12:28:56,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f42cb404/62f65700ed28461ebd0e2fbf5ea49378 [2024-10-14 12:28:56,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:28:56,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:28:56,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:28:56,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:28:56,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:28:56,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502b4829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56, skipping insertion in model container [2024-10-14 12:28:56,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:28:56,465 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-82.i[915,928] [2024-10-14 12:28:56,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:28:56,538 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:28:56,550 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-82.i[915,928] [2024-10-14 12:28:56,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:28:56,592 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:28:56,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56 WrapperNode [2024-10-14 12:28:56,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:28:56,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:28:56,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:28:56,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:28:56,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,645 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2024-10-14 12:28:56,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:28:56,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:28:56,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:28:56,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:28:56,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,685 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-14 12:28:56,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:28:56,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:28:56,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:28:56,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:28:56,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (1/1) ... [2024-10-14 12:28:56,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:28:56,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:28:56,754 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-10-14 12:28:56,761 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-10-14 12:28:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:28:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:28:56,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:28:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:28:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:28:56,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:28:56,881 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:28:56,884 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:28:57,112 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 12:28:57,113 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:28:57,157 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:28:57,158 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:28:57,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:57 BoogieIcfgContainer [2024-10-14 12:28:57,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:28:57,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:28:57,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:28:57,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:28:57,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:28:56" (1/3) ... [2024-10-14 12:28:57,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217fefce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:28:57, skipping insertion in model container [2024-10-14 12:28:57,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:56" (2/3) ... [2024-10-14 12:28:57,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217fefce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:28:57, skipping insertion in model container [2024-10-14 12:28:57,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:57" (3/3) ... [2024-10-14 12:28:57,172 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-82.i [2024-10-14 12:28:57,191 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:28:57,192 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:28:57,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:28:57,263 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;@55b2df46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:28:57,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:28:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 12:28:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 12:28:57,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:57,281 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:28:57,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:57,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:57,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1027765869, now seen corresponding path program 1 times [2024-10-14 12:28:57,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:57,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61599949] [2024-10-14 12:28:57,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:57,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:57,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:57,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61599949] [2024-10-14 12:28:57,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61599949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:57,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:57,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:28:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948752202] [2024-10-14 12:28:57,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:57,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:28:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:57,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:28:57,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:28:57,643 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 12:28:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:57,677 INFO L93 Difference]: Finished difference Result 65 states and 112 transitions. [2024-10-14 12:28:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:28:57,681 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 72 [2024-10-14 12:28:57,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:57,689 INFO L225 Difference]: With dead ends: 65 [2024-10-14 12:28:57,689 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 12:28:57,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-14 12:28:57,699 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:57,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:28:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 12:28:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 12:28:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 12:28:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2024-10-14 12:28:57,752 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 72 [2024-10-14 12:28:57,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:57,753 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2024-10-14 12:28:57,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 12:28:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2024-10-14 12:28:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 12:28:57,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:57,757 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:28:57,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:28:57,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:57,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash 619471251, now seen corresponding path program 1 times [2024-10-14 12:28:57,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:57,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259051057] [2024-10-14 12:28:57,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:57,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:58,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:58,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259051057] [2024-10-14 12:28:58,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259051057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:58,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:58,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:28:58,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268304702] [2024-10-14 12:28:58,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:58,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:28:58,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:28:59,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:28:59,001 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:59,101 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2024-10-14 12:28:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:28:59,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 72 [2024-10-14 12:28:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:59,104 INFO L225 Difference]: With dead ends: 38 [2024-10-14 12:28:59,104 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 12:28:59,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:28:59,105 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:59,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 113 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:28:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 12:28:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-10-14 12:28:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 12:28:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-10-14 12:28:59,122 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 72 [2024-10-14 12:28:59,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:59,124 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-10-14 12:28:59,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2024-10-14 12:28:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 12:28:59,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:59,128 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:28:59,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:28:59,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:59,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:59,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2023907769, now seen corresponding path program 1 times [2024-10-14 12:28:59,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:59,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867771979] [2024-10-14 12:28:59,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:59,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:29:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:29:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:29:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:29:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:29:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:29:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:29:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:29:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:29:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:29:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:29:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:29:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:29:01,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:29:01,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867771979] [2024-10-14 12:29:01,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867771979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:29:01,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:29:01,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:29:01,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113818122] [2024-10-14 12:29:01,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:29:01,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:29:01,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:29:01,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:29:01,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:29:01,562 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:29:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:29:01,715 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2024-10-14 12:29:01,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:29:01,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 73 [2024-10-14 12:29:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:29:01,717 INFO L225 Difference]: With dead ends: 42 [2024-10-14 12:29:01,717 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 12:29:01,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:29:01,722 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:29:01,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 144 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:29:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 12:29:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2024-10-14 12:29:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 12:29:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-10-14 12:29:01,735 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 73 [2024-10-14 12:29:01,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:29:01,736 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-10-14 12:29:01,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:29:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2024-10-14 12:29:01,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 12:29:01,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:29:01,740 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:29:01,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:29:01,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:29:01,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:29:01,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1692525012, now seen corresponding path program 1 times [2024-10-14 12:29:01,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:29:01,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870325441] [2024-10-14 12:29:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:29:01,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:29:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:29:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:29:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:29:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:29:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:29:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:29:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:29:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:29:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:29:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:29:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:29:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:29:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:29:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:29:02,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:29:02,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870325441] [2024-10-14 12:29:02,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870325441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:29:02,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:29:02,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:29:02,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676619216] [2024-10-14 12:29:02,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:29:02,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:29:02,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:29:02,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:29:02,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:29:02,060 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:29:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:29:02,158 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-10-14 12:29:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:29:02,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-14 12:29:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:29:02,159 INFO L225 Difference]: With dead ends: 44 [2024-10-14 12:29:02,159 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 12:29:02,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:29:02,161 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:29:02,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 116 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:29:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 12:29:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 12:29:02,162 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-14 12:29:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 12:29:02,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2024-10-14 12:29:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:29:02,163 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 12:29:02,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:29:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 12:29:02,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 12:29:02,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 12:29:02,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 12:29:02,173 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 12:29:02,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 12:29:02,206 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 12:29:02,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:29:02 BoogieIcfgContainer [2024-10-14 12:29:02,225 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 12:29:02,226 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 12:29:02,226 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 12:29:02,227 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 12:29:02,227 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:57" (3/4) ... [2024-10-14 12:29:02,229 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 12:29:02,233 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 12:29:02,238 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-14 12:29:02,239 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 12:29:02,239 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 12:29:02,239 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 12:29:02,353 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 12:29:02,353 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 12:29:02,353 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 12:29:02,354 INFO L158 Benchmark]: Toolchain (without parser) took 6113.27ms. Allocated memory was 142.6MB in the beginning and 281.0MB in the end (delta: 138.4MB). Free memory was 70.5MB in the beginning and 229.1MB in the end (delta: -158.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:29:02,354 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 107.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:29:02,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.49ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 70.3MB in the beginning and 154.7MB in the end (delta: -84.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-10-14 12:29:02,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.39ms. Allocated memory is still 192.9MB. Free memory was 154.7MB in the beginning and 152.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:29:02,355 INFO L158 Benchmark]: Boogie Preprocessor took 60.20ms. Allocated memory is still 192.9MB. Free memory was 152.5MB in the beginning and 150.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:29:02,355 INFO L158 Benchmark]: RCFGBuilder took 447.07ms. Allocated memory is still 192.9MB. Free memory was 150.1MB in the beginning and 133.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 12:29:02,356 INFO L158 Benchmark]: TraceAbstraction took 5064.08ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 133.3MB in the beginning and 234.3MB in the end (delta: -101.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:29:02,356 INFO L158 Benchmark]: Witness Printer took 127.29ms. Allocated memory is still 281.0MB. Free memory was 234.3MB in the beginning and 229.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 12:29:02,357 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.16ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 107.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.49ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 70.3MB in the beginning and 154.7MB in the end (delta: -84.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.39ms. Allocated memory is still 192.9MB. Free memory was 154.7MB in the beginning and 152.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.20ms. Allocated memory is still 192.9MB. Free memory was 152.5MB in the beginning and 150.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 447.07ms. Allocated memory is still 192.9MB. Free memory was 150.1MB in the beginning and 133.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5064.08ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 133.3MB in the beginning and 234.3MB in the end (delta: -101.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 127.29ms. Allocated memory is still 281.0MB. Free memory was 234.3MB in the beginning and 229.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 416 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 246 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 170 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 17, 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1056/1056 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: 77]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-14 12:29:02,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE