./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-98.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 2d6232c8631d670f02ae34af9c218522355d6b13b787e3429e0429d2df4c728a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:20:03,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:20:03,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:20:03,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:20:03,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:20:03,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:20:03,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:20:03,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:20:03,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:20:03,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:20:03,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:20:03,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:20:03,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:20:03,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:20:03,238 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:20:03,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:20:03,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:20:03,238 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:20:03,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:20:03,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:20:03,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:20:03,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:20:03,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:20:03,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:20:03,241 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:20:03,241 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:20:03,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:20:03,242 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:20:03,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:20:03,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:20:03,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:20:03,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:20:03,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:20:03,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:20:03,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:20:03,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:20:03,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:20:03,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:20:03,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:20:03,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:20:03,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:20:03,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:20:03,245 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 -> 2d6232c8631d670f02ae34af9c218522355d6b13b787e3429e0429d2df4c728a [2024-11-10 08:20:03,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:20:03,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:20:03,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:20:03,489 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:20:03,489 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:20:03,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-98.i [2024-11-10 08:20:04,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:20:04,910 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:20:04,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-98.i [2024-11-10 08:20:04,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ccd0189/2df7aee6b766444a877e583ed4e6cb37/FLAG1fe70be35 [2024-11-10 08:20:05,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ccd0189/2df7aee6b766444a877e583ed4e6cb37 [2024-11-10 08:20:05,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:20:05,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:20:05,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:20:05,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:20:05,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:20:05,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156f51a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05, skipping insertion in model container [2024-11-10 08:20:05,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,338 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:20:05,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-98.i[915,928] [2024-11-10 08:20:05,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:20:05,482 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:20:05,493 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-98.i[915,928] [2024-11-10 08:20:05,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:20:05,512 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:20:05,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05 WrapperNode [2024-11-10 08:20:05,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:20:05,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:20:05,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:20:05,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:20:05,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,541 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2024-11-10 08:20:05,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:20:05,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:20:05,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:20:05,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:20:05,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,560 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:20:05,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,563 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:20:05,566 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:20:05,566 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:20:05,567 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:20:05,567 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:20:05,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:20:05,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:20:05,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:20:05,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:20:05,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:20:05,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:20:05,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:20:05,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:20:05,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:20:05,680 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:20:05,682 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:20:05,817 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:20:05,818 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:20:05,830 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:20:05,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:20:05,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:05 BoogieIcfgContainer [2024-11-10 08:20:05,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:20:05,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:20:05,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:20:05,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:20:05,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:20:05" (1/3) ... [2024-11-10 08:20:05,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135fe0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:20:05, skipping insertion in model container [2024-11-10 08:20:05,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (2/3) ... [2024-11-10 08:20:05,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135fe0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:20:05, skipping insertion in model container [2024-11-10 08:20:05,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:05" (3/3) ... [2024-11-10 08:20:05,837 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-98.i [2024-11-10 08:20:05,850 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:20:05,851 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:20:05,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:20:05,907 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;@3ad27b67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:20:05,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:20:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:20:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 08:20:05,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:05,923 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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-11-10 08:20:05,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:05,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1572048164, now seen corresponding path program 1 times [2024-11-10 08:20:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:20:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103799315] [2024-11-10 08:20:05,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:05,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:20:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:20:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:20:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:20:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:20:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:20:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:20:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:20:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:20:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:20:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:20:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:20:06,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:20:06,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103799315] [2024-11-10 08:20:06,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103799315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:06,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:06,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:20:06,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413581260] [2024-11-10 08:20:06,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:06,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:20:06,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:20:06,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:20:06,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:20:06,238 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 08:20:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:06,257 INFO L93 Difference]: Finished difference Result 70 states and 109 transitions. [2024-11-10 08:20:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:20:06,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 67 [2024-11-10 08:20:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:06,263 INFO L225 Difference]: With dead ends: 70 [2024-11-10 08:20:06,264 INFO L226 Difference]: Without dead ends: 34 [2024-11-10 08:20:06,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:20:06,269 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:20:06,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:20:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-10 08:20:06,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-10 08:20:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:20:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-10 08:20:06,342 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 67 [2024-11-10 08:20:06,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:06,343 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-10 08:20:06,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 08:20:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-10 08:20:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 08:20:06,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:06,350 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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-11-10 08:20:06,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:20:06,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:06,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash -459733444, now seen corresponding path program 1 times [2024-11-10 08:20:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:20:06,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621964914] [2024-11-10 08:20:06,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:06,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:20:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:20:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:20:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:20:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:20:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:20:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:20:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:20:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:20:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:20:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:20:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:20:06,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:20:06,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621964914] [2024-11-10 08:20:06,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621964914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:06,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:06,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:20:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095312342] [2024-11-10 08:20:06,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:06,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:20:06,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:20:06,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:20:06,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:20:06,710 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:06,774 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-11-10 08:20:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:20:06,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-10 08:20:06,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:06,775 INFO L225 Difference]: With dead ends: 44 [2024-11-10 08:20:06,776 INFO L226 Difference]: Without dead ends: 41 [2024-11-10 08:20:06,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:20:06,781 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:20:06,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 166 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:20:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-10 08:20:06,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-10 08:20:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:20:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-10 08:20:06,788 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 67 [2024-11-10 08:20:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:06,791 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-10 08:20:06,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-10 08:20:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 08:20:06,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:06,795 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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-11-10 08:20:06,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:20:06,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:06,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:06,800 INFO L85 PathProgramCache]: Analyzing trace with hash -448794421, now seen corresponding path program 1 times [2024-11-10 08:20:06,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:20:06,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877113610] [2024-11-10 08:20:06,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:06,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:20:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:07,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:20:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:20:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:07,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:20:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:07,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:20:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:20:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:07,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:20:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:07,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:20:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:07,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:20:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:07,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:20:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:07,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:20:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:20:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:20:07,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877113610] [2024-11-10 08:20:07,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877113610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:07,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:07,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:20:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584829704] [2024-11-10 08:20:07,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:07,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:20:07,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:20:07,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:20:07,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:20:07,819 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:08,025 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-11-10 08:20:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:20:08,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 68 [2024-11-10 08:20:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:08,026 INFO L225 Difference]: With dead ends: 44 [2024-11-10 08:20:08,026 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:20:08,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:20:08,028 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 16 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:20:08,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 177 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:20:08,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:20:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:20:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 08:20:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:20:08,029 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2024-11-10 08:20:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:08,030 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:20:08,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:20:08,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:20:08,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:20:08,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:20:08,039 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 08:20:08,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:20:08,062 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:20:08,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:20:08 BoogieIcfgContainer [2024-11-10 08:20:08,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:20:08,082 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:20:08,082 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:20:08,082 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:20:08,083 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:05" (3/4) ... [2024-11-10 08:20:08,084 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:20:08,088 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:20:08,091 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:20:08,091 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 08:20:08,091 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:20:08,092 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:20:08,157 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:20:08,158 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:20:08,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:20:08,158 INFO L158 Benchmark]: Toolchain (without parser) took 2843.43ms. Allocated memory was 169.9MB in the beginning and 209.7MB in the end (delta: 39.8MB). Free memory was 102.1MB in the beginning and 135.6MB in the end (delta: -33.4MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-10 08:20:08,158 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:20:08,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.56ms. Allocated memory is still 169.9MB. Free memory was 101.8MB in the beginning and 88.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:20:08,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.11ms. Allocated memory is still 169.9MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:20:08,159 INFO L158 Benchmark]: Boogie Preprocessor took 24.18ms. Allocated memory is still 169.9MB. Free memory was 87.4MB in the beginning and 85.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:20:08,159 INFO L158 Benchmark]: IcfgBuilder took 264.64ms. Allocated memory is still 169.9MB. Free memory was 85.6MB in the beginning and 73.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:20:08,159 INFO L158 Benchmark]: TraceAbstraction took 2248.97ms. Allocated memory was 169.9MB in the beginning and 209.7MB in the end (delta: 39.8MB). Free memory was 72.5MB in the beginning and 140.8MB in the end (delta: -68.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:20:08,159 INFO L158 Benchmark]: Witness Printer took 75.74ms. Allocated memory is still 209.7MB. Free memory was 140.8MB in the beginning and 135.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:20:08,161 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.56ms. Allocated memory is still 169.9MB. Free memory was 101.8MB in the beginning and 88.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.11ms. Allocated memory is still 169.9MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.18ms. Allocated memory is still 169.9MB. Free memory was 87.4MB in the beginning and 85.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 264.64ms. Allocated memory is still 169.9MB. Free memory was 85.6MB in the beginning and 73.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2248.97ms. Allocated memory was 169.9MB in the beginning and 209.7MB in the end (delta: 39.8MB). Free memory was 72.5MB in the beginning and 140.8MB in the end (delta: -68.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 75.74ms. Allocated memory is still 209.7MB. Free memory was 140.8MB in the beginning and 135.6MB 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 388 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 254 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 134 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 540/540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Location Invariant Derived location invariant: null - 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))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:20:08,183 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