./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-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-59.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 78350471832631b990ab07cb00fceb180be6701dc1d364c97cf9dbeb83c7a9cd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:19:42,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:19:42,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:19:42,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:19:42,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:19:42,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:19:42,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:19:42,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:19:42,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:19:42,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:19:42,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:19:42,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:19:42,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:19:42,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:19:42,721 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:19:42,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:19:42,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:19:42,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:19:42,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:19:42,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:19:42,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:19:42,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:19:42,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:19:42,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:19:42,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:19:42,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:19:42,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:19:42,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:19:42,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:19:42,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:19:42,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:19:42,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:19:42,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:19:42,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:19:42,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:19:42,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:19:42,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:19:42,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:19:42,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:19:42,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:19:42,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:19:42,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:19:42,732 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 -> 78350471832631b990ab07cb00fceb180be6701dc1d364c97cf9dbeb83c7a9cd [2024-10-24 10:19:42,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:19:43,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:19:43,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:19:43,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:19:43,029 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:19:43,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-59.i [2024-10-24 10:19:44,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:19:44,669 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:19:44,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-59.i [2024-10-24 10:19:44,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09077a5ed/5eeb05d406fa4f68bb4c931b4963883d/FLAG0cc5b7db2 [2024-10-24 10:19:45,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09077a5ed/5eeb05d406fa4f68bb4c931b4963883d [2024-10-24 10:19:45,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:19:45,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:19:45,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:19:45,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:19:45,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:19:45,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99ef7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45, skipping insertion in model container [2024-10-24 10:19:45,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:19:45,249 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-59.i[915,928] [2024-10-24 10:19:45,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:19:45,279 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:19:45,289 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-59.i[915,928] [2024-10-24 10:19:45,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:19:45,315 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:19:45,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45 WrapperNode [2024-10-24 10:19:45,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:19:45,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:19:45,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:19:45,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:19:45,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,352 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 61 [2024-10-24 10:19:45,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:19:45,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:19:45,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:19:45,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:19:45,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,380 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-24 10:19:45,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:19:45,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:19:45,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:19:45,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:19:45,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (1/1) ... [2024-10-24 10:19:45,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:19:45,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:19:45,440 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-24 10:19:45,444 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-24 10:19:45,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:19:45,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:19:45,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:19:45,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:19:45,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:19:45,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:19:45,559 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:19:45,563 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:19:45,799 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:19:45,800 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:19:45,851 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:19:45,853 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:19:45,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:45 BoogieIcfgContainer [2024-10-24 10:19:45,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:19:45,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:19:45,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:19:45,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:19:45,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:19:45" (1/3) ... [2024-10-24 10:19:45,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d9a865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:19:45, skipping insertion in model container [2024-10-24 10:19:45,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:45" (2/3) ... [2024-10-24 10:19:45,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d9a865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:19:45, skipping insertion in model container [2024-10-24 10:19:45,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:45" (3/3) ... [2024-10-24 10:19:45,862 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-59.i [2024-10-24 10:19:45,881 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:19:45,881 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:19:45,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:19:46,000 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;@6b879502, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:19:46,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:19:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:19:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 10:19:46,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:46,015 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 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-24 10:19:46,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:46,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:46,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1775984561, now seen corresponding path program 1 times [2024-10-24 10:19:46,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:46,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238841312] [2024-10-24 10:19:46,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:46,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:46,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:19:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:46,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:19:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:46,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:19:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:46,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:19:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:46,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:19:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:46,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:19:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:46,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 10:19:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:19:46,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:19:46,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238841312] [2024-10-24 10:19:46,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238841312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:46,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:46,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:19:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269853534] [2024-10-24 10:19:46,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:46,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:19:46,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:19:46,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:19:46,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:19:46,271 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 10:19:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:46,310 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2024-10-24 10:19:46,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:19:46,313 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2024-10-24 10:19:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:46,321 INFO L225 Difference]: With dead ends: 49 [2024-10-24 10:19:46,322 INFO L226 Difference]: Without dead ends: 24 [2024-10-24 10:19:46,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-24 10:19:46,332 INFO L432 NwaCegarLoop]: 30 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, 30 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-24 10:19:46,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:19:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-24 10:19:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-24 10:19:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:19:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2024-10-24 10:19:46,379 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 44 [2024-10-24 10:19:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:46,380 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2024-10-24 10:19:46,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 10:19:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2024-10-24 10:19:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 10:19:46,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:46,384 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 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-24 10:19:46,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:19:46,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:46,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:46,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1834937523, now seen corresponding path program 1 times [2024-10-24 10:19:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:46,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411956823] [2024-10-24 10:19:46,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:46,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:46,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:19:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:19:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:19:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:19:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:19:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:19:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 10:19:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:19:47,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:19:47,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411956823] [2024-10-24 10:19:47,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411956823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:47,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:47,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:19:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743767449] [2024-10-24 10:19:47,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:47,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:19:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:19:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:19:47,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:19:47,042 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:19:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:47,126 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-10-24 10:19:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:19:47,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 44 [2024-10-24 10:19:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:47,128 INFO L225 Difference]: With dead ends: 30 [2024-10-24 10:19:47,128 INFO L226 Difference]: Without dead ends: 28 [2024-10-24 10:19:47,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-24 10:19:47,130 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:47,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:19:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-24 10:19:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-24 10:19:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:19:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-10-24 10:19:47,136 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 44 [2024-10-24 10:19:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:47,138 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-10-24 10:19:47,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:19:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-10-24 10:19:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 10:19:47,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:47,140 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 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-24 10:19:47,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:19:47,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:47,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1062182626, now seen corresponding path program 1 times [2024-10-24 10:19:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:47,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168080814] [2024-10-24 10:19:47,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:47,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:19:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:19:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:19:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:19:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:19:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:19:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 10:19:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:19:47,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:19:47,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168080814] [2024-10-24 10:19:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168080814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:47,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:47,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:19:47,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792182787] [2024-10-24 10:19:47,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:47,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:19:47,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:19:47,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:19:47,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:19:47,624 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:19:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:47,728 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2024-10-24 10:19:47,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:19:47,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2024-10-24 10:19:47,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:47,730 INFO L225 Difference]: With dead ends: 57 [2024-10-24 10:19:47,730 INFO L226 Difference]: Without dead ends: 32 [2024-10-24 10:19:47,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:19:47,731 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:47,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 72 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:19:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-24 10:19:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2024-10-24 10:19:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:19:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-10-24 10:19:47,737 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 45 [2024-10-24 10:19:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:47,738 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-10-24 10:19:47,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:19:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-10-24 10:19:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 10:19:47,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:47,739 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 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-24 10:19:47,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:19:47,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:47,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:47,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1432384471, now seen corresponding path program 1 times [2024-10-24 10:19:47,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:47,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743832071] [2024-10-24 10:19:47,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:47,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:48,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:19:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:48,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:19:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:48,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:19:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:48,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:19:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:48,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:19:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:48,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:19:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:48,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 10:19:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:19:48,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:19:48,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743832071] [2024-10-24 10:19:48,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743832071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:48,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:48,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:19:48,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403740403] [2024-10-24 10:19:48,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:48,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:19:48,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:19:48,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:19:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:19:48,487 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:19:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:48,701 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-10-24 10:19:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:19:48,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 46 [2024-10-24 10:19:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:48,703 INFO L225 Difference]: With dead ends: 40 [2024-10-24 10:19:48,704 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:19:48,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:19:48,705 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:48,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 101 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:19:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:19:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:19:48,711 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-24 10:19:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:19:48,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-10-24 10:19:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:48,711 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:19:48,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:19:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:19:48,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:19:48,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:19:48,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:19:48,720 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 10:19:48,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:19:48,778 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:19:48,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:19:48 BoogieIcfgContainer [2024-10-24 10:19:48,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:19:48,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:19:48,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:19:48,804 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:19:48,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:45" (3/4) ... [2024-10-24 10:19:48,807 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:19:48,811 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:19:48,815 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 10:19:48,816 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 10:19:48,818 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:19:48,818 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:19:48,917 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:19:48,917 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:19:48,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:19:48,918 INFO L158 Benchmark]: Toolchain (without parser) took 3848.03ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 96.6MB in the beginning and 176.3MB in the end (delta: -79.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:19:48,919 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:19:48,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.31ms. Allocated memory is still 151.0MB. Free memory was 96.2MB in the beginning and 83.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:19:48,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.42ms. Allocated memory is still 151.0MB. Free memory was 83.7MB in the beginning and 81.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:19:48,919 INFO L158 Benchmark]: Boogie Preprocessor took 46.67ms. Allocated memory is still 151.0MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:19:48,920 INFO L158 Benchmark]: RCFGBuilder took 453.77ms. Allocated memory is still 151.0MB. Free memory was 79.6MB in the beginning and 65.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:19:48,920 INFO L158 Benchmark]: TraceAbstraction took 2945.09ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 64.9MB in the beginning and 180.5MB in the end (delta: -115.6MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2024-10-24 10:19:48,924 INFO L158 Benchmark]: Witness Printer took 115.60ms. Allocated memory is still 213.9MB. Free memory was 180.5MB in the beginning and 176.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:19:48,925 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.18ms. Allocated memory is still 151.0MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.31ms. Allocated memory is still 151.0MB. Free memory was 96.2MB in the beginning and 83.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.42ms. Allocated memory is still 151.0MB. Free memory was 83.7MB in the beginning and 81.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.67ms. Allocated memory is still 151.0MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.77ms. Allocated memory is still 151.0MB. Free memory was 79.6MB in the beginning and 65.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2945.09ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 64.9MB in the beginning and 180.5MB in the end (delta: -115.6MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. * Witness Printer took 115.60ms. Allocated memory is still 213.9MB. Free memory was 180.5MB in the beginning and 176.3MB in the end (delta: 4.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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 119 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 336/336 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: 64]: 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_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:19:48,954 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