./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-2.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 d951d42aa7befd7bda7f80ada4844738e8523e59f9da7a827c45a61796f63a09 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:13:15,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:13:15,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:13:15,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:13:15,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:13:15,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:13:15,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:13:15,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:13:15,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:13:15,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:13:15,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:13:15,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:13:15,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:13:15,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:13:15,258 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:13:15,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:13:15,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:13:15,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:13:15,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:13:15,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:13:15,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:13:15,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:13:15,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:13:15,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:13:15,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:13:15,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:13:15,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:13:15,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:13:15,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:13:15,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:13:15,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:13:15,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:13:15,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:15,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:13:15,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:13:15,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:13:15,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:13:15,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:13:15,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:13:15,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:13:15,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:13:15,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:13:15,264 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 -> d951d42aa7befd7bda7f80ada4844738e8523e59f9da7a827c45a61796f63a09 [2024-11-16 17:13:15,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:13:15,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:13:15,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:13:15,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:13:15,448 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:13:15,449 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-2.i [2024-11-16 17:13:16,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:13:16,744 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:13:16,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-2.i [2024-11-16 17:13:16,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92bb6abb9/94e4e6b989bb4e83be0d70d10dc85090/FLAG708495f97 [2024-11-16 17:13:16,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92bb6abb9/94e4e6b989bb4e83be0d70d10dc85090 [2024-11-16 17:13:16,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:13:16,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:13:16,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:16,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:13:16,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:13:16,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:16,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77deb7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16, skipping insertion in model container [2024-11-16 17:13:16,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:16,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:13:16,925 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-2.i[914,927] [2024-11-16 17:13:16,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:16,955 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:13:16,966 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-2.i[914,927] [2024-11-16 17:13:16,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:16,986 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:13:16,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16 WrapperNode [2024-11-16 17:13:16,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:16,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:16,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:13:16,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:13:16,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:16,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:17,014 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2024-11-16 17:13:17,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:17,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:13:17,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:13:17,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:13:17,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:17,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:17,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:17,039 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-16 17:13:17,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:17,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:17,042 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:17,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:17,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:17,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:17,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:13:17,046 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:13:17,046 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:13:17,046 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:13:17,047 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (1/1) ... [2024-11-16 17:13:17,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:17,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:13:17,074 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-16 17:13:17,079 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-16 17:13:17,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:13:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:13:17,108 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:13:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:13:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:13:17,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:13:17,158 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:13:17,159 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:13:17,297 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 17:13:17,300 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:13:17,309 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:13:17,309 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:13:17,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:17 BoogieIcfgContainer [2024-11-16 17:13:17,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:13:17,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:13:17,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:13:17,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:13:17,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:13:16" (1/3) ... [2024-11-16 17:13:17,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b1303d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:17, skipping insertion in model container [2024-11-16 17:13:17,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:16" (2/3) ... [2024-11-16 17:13:17,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b1303d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:17, skipping insertion in model container [2024-11-16 17:13:17,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:17" (3/3) ... [2024-11-16 17:13:17,315 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-2.i [2024-11-16 17:13:17,327 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:13:17,327 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:13:17,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:13:17,378 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;@4e4a3a02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:13:17,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:13:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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-16 17:13:17,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 17:13:17,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:17,389 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-16 17:13:17,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:17,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:17,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1404539548, now seen corresponding path program 1 times [2024-11-16 17:13:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:13:17,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066580771] [2024-11-16 17:13:17,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:13:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:17,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:13:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:17,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:13:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:17,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:13:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:17,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:13:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:17,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:13:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:17,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:13:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:17,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:13:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:17,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:13:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:17,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:13:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:13:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:17,593 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-16 17:13:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:13:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066580771] [2024-11-16 17:13:17,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066580771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:17,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:17,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:13:17,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824736355] [2024-11-16 17:13:17,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:17,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:13:17,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:13:17,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:13:17,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:13:17,628 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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-16 17:13:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:17,645 INFO L93 Difference]: Finished difference Result 68 states and 105 transitions. [2024-11-16 17:13:17,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:13:17,647 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-16 17:13:17,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:17,652 INFO L225 Difference]: With dead ends: 68 [2024-11-16 17:13:17,652 INFO L226 Difference]: Without dead ends: 33 [2024-11-16 17:13:17,654 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-16 17:13:17,657 INFO L432 NwaCegarLoop]: 43 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, 43 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-16 17:13:17,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:13:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-16 17:13:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-16 17:13:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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-16 17:13:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-16 17:13:17,727 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 67 [2024-11-16 17:13:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:17,727 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-16 17:13:17,727 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-16 17:13:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-16 17:13:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 17:13:17,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:17,729 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-16 17:13:17,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:13:17,729 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:17,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:17,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1778113028, now seen corresponding path program 1 times [2024-11-16 17:13:17,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:13:17,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609890607] [2024-11-16 17:13:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:17,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:13:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:18,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:13:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:18,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:13:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:18,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:13:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:18,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:13:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:18,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:13:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:18,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:13:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:13:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:18,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:13:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:13:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:18,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:13:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:18,754 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-16 17:13:18,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:13:18,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609890607] [2024-11-16 17:13:18,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609890607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:18,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:18,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:13:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752100797] [2024-11-16 17:13:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:18,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:13:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:13:18,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:13:18,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:13:18,759 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-16 17:13:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:18,938 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2024-11-16 17:13:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:13:18,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-16 17:13:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:18,941 INFO L225 Difference]: With dead ends: 66 [2024-11-16 17:13:18,941 INFO L226 Difference]: Without dead ends: 63 [2024-11-16 17:13:18,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:13:18,943 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 42 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:13:18,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 228 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:13:18,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-16 17:13:18,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2024-11-16 17:13:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 17:13:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2024-11-16 17:13:18,962 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 67 [2024-11-16 17:13:18,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:18,963 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2024-11-16 17:13:18,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-16 17:13:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2024-11-16 17:13:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 17:13:18,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:18,965 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-16 17:13:18,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:13:18,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:18,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1749483877, now seen corresponding path program 1 times [2024-11-16 17:13:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:13:18,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571181952] [2024-11-16 17:13:18,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:13:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:13:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:23,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:13:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:13:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:23,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:13:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:23,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:13:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:23,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:13:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:23,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:13:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:23,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:13:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:23,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:13:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:23,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:13:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:23,246 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-16 17:13:23,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:13:23,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571181952] [2024-11-16 17:13:23,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571181952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:23,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:13:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898957233] [2024-11-16 17:13:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:23,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:13:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:13:23,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:13:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:13:23,248 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-16 17:13:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:23,426 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-11-16 17:13:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:13:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-16 17:13:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:23,428 INFO L225 Difference]: With dead ends: 48 [2024-11-16 17:13:23,428 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 17:13:23,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:13:23,429 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:13:23,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 128 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:13:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 17:13:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 17:13:23,430 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-16 17:13:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 17:13:23,430 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-11-16 17:13:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:23,430 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 17:13:23,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-16 17:13:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 17:13:23,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 17:13:23,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:13:23,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:13:23,436 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 17:13:23,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 17:13:23,462 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:13:23,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:13:23 BoogieIcfgContainer [2024-11-16 17:13:23,478 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:13:23,479 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:13:23,479 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:13:23,479 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:13:23,479 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:17" (3/4) ... [2024-11-16 17:13:23,481 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 17:13:23,484 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-16 17:13:23,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-16 17:13:23,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-16 17:13:23,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 17:13:23,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 17:13:23,555 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 17:13:23,555 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 17:13:23,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:13:23,556 INFO L158 Benchmark]: Toolchain (without parser) took 6793.34ms. Allocated memory was 130.0MB in the beginning and 539.0MB in the end (delta: 408.9MB). Free memory was 61.7MB in the beginning and 491.9MB in the end (delta: -430.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:23,556 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:23,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.75ms. Allocated memory is still 190.8MB. Free memory was 163.5MB in the beginning and 154.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-16 17:13:23,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.73ms. Allocated memory is still 190.8MB. Free memory was 154.1MB in the beginning and 152.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:13:23,557 INFO L158 Benchmark]: Boogie Preprocessor took 29.72ms. Allocated memory is still 190.8MB. Free memory was 152.0MB in the beginning and 149.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:13:23,557 INFO L158 Benchmark]: IcfgBuilder took 263.17ms. Allocated memory is still 190.8MB. Free memory was 149.1MB in the beginning and 135.3MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 17:13:23,557 INFO L158 Benchmark]: TraceAbstraction took 6167.77ms. Allocated memory was 190.8MB in the beginning and 539.0MB in the end (delta: 348.1MB). Free memory was 134.4MB in the beginning and 497.1MB in the end (delta: -362.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:23,557 INFO L158 Benchmark]: Witness Printer took 76.75ms. Allocated memory is still 539.0MB. Free memory was 497.1MB in the beginning and 491.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 17:13:23,558 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 130.0MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.75ms. Allocated memory is still 190.8MB. Free memory was 163.5MB in the beginning and 154.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.73ms. Allocated memory is still 190.8MB. Free memory was 154.1MB in the beginning and 152.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.72ms. Allocated memory is still 190.8MB. Free memory was 152.0MB in the beginning and 149.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 263.17ms. Allocated memory is still 190.8MB. Free memory was 149.1MB in the beginning and 135.3MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6167.77ms. Allocated memory was 190.8MB in the beginning and 539.0MB in the end (delta: 348.1MB). Free memory was 134.4MB in the beginning and 497.1MB in the end (delta: -362.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 76.75ms. Allocated memory is still 539.0MB. Free memory was 497.1MB in the beginning and 491.9MB 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 399 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 266 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 133 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 619 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: 66]: 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_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (last_1_var_1_1 == \old(last_1_var_1_1))) RESULT: Ultimate proved your program to be correct! [2024-11-16 17:13:23,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE