./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-57.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_loopvsstraightlinecode_25-while_file-57.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 8747544e36e683649fe61d526aa97a5c087279371c458d990497ba77992cacc4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:34:11,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:34:11,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:34:11,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:34:11,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:34:11,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:34:11,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:34:11,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:34:11,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:34:11,708 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:34:11,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:34:11,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:34:11,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:34:11,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:34:11,711 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:34:11,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:34:11,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:34:11,712 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:34:11,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:34:11,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:34:11,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:34:11,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:34:11,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:34:11,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:34:11,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:34:11,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:34:11,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:34:11,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:34:11,718 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:34:11,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:34:11,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:34:11,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:34:11,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:34:11,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:34:11,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:34:11,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:34:11,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:34:11,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:34:11,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:34:11,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:34:11,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:34:11,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:34:11,722 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 -> 8747544e36e683649fe61d526aa97a5c087279371c458d990497ba77992cacc4 [2024-11-16 16:34:11,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:34:11,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:34:11,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:34:11,975 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:34:11,975 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:34:11,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-57.i [2024-11-16 16:34:13,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:34:13,544 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:34:13,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-57.i [2024-11-16 16:34:13,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cda4163c/80a2d79db9ce44fca82f9a26685d65ed/FLAGde623b71f [2024-11-16 16:34:13,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cda4163c/80a2d79db9ce44fca82f9a26685d65ed [2024-11-16 16:34:13,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:34:13,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:34:13,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:34:13,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:34:13,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:34:13,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:34:13" (1/1) ... [2024-11-16 16:34:13,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7fb613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:13, skipping insertion in model container [2024-11-16 16:34:13,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:34:13" (1/1) ... [2024-11-16 16:34:13,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:34:14,204 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_loopvsstraightlinecode_25-while_file-57.i[915,928] [2024-11-16 16:34:14,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:34:14,265 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:34:14,275 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_loopvsstraightlinecode_25-while_file-57.i[915,928] [2024-11-16 16:34:14,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:34:14,325 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:34:14,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14 WrapperNode [2024-11-16 16:34:14,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:34:14,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:34:14,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:34:14,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:34:14,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (1/1) ... [2024-11-16 16:34:14,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (1/1) ... [2024-11-16 16:34:14,372 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-16 16:34:14,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:34:14,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:34:14,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:34:14,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:34:14,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (1/1) ... [2024-11-16 16:34:14,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (1/1) ... [2024-11-16 16:34:14,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (1/1) ... [2024-11-16 16:34:14,402 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 16:34:14,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (1/1) ... [2024-11-16 16:34:14,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (1/1) ... [2024-11-16 16:34:14,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (1/1) ... [2024-11-16 16:34:14,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (1/1) ... [2024-11-16 16:34:14,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (1/1) ... [2024-11-16 16:34:14,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (1/1) ... [2024-11-16 16:34:14,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:34:14,422 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:34:14,422 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:34:14,422 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:34:14,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (1/1) ... [2024-11-16 16:34:14,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:34:14,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:34:14,460 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 16:34:14,463 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 16:34:14,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:34:14,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:34:14,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:34:14,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:34:14,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:34:14,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:34:14,582 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:34:14,584 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:34:14,833 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: havoc property_#t~ite12#1;havoc property_#t~bitwise11#1;havoc property_#t~short13#1; [2024-11-16 16:34:14,868 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 16:34:14,869 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:34:14,905 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:34:14,907 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:34:14,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:34:14 BoogieIcfgContainer [2024-11-16 16:34:14,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:34:14,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:34:14,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:34:14,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:34:14,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:34:13" (1/3) ... [2024-11-16 16:34:14,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60061bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:34:14, skipping insertion in model container [2024-11-16 16:34:14,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:14" (2/3) ... [2024-11-16 16:34:14,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60061bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:34:14, skipping insertion in model container [2024-11-16 16:34:14,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:34:14" (3/3) ... [2024-11-16 16:34:14,917 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-57.i [2024-11-16 16:34:14,932 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:34:14,933 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:34:14,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:34:15,003 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;@2c8e5377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:34:15,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:34:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 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 16:34:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-16 16:34:15,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:34:15,019 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:34:15,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:34:15,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:34:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash 797142937, now seen corresponding path program 1 times [2024-11-16 16:34:15,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:34:15,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569516671] [2024-11-16 16:34:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:34:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:34:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:34:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:34:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:34:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:34:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:34:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:34:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:34:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:34:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:34:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:34:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,274 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 16:34:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:34:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569516671] [2024-11-16 16:34:15,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569516671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:34:15,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:34:15,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:34:15,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40865154] [2024-11-16 16:34:15,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:34:15,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:34:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:34:15,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:34:15,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:34:15,309 INFO L87 Difference]: Start difference. First operand has 60 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 16:34:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:34:15,339 INFO L93 Difference]: Finished difference Result 111 states and 173 transitions. [2024-11-16 16:34:15,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:34:15,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 76 [2024-11-16 16:34:15,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:34:15,350 INFO L225 Difference]: With dead ends: 111 [2024-11-16 16:34:15,351 INFO L226 Difference]: Without dead ends: 54 [2024-11-16 16:34:15,355 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 16:34:15,360 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:34:15,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:34:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-16 16:34:15,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-16 16:34:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 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 16:34:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2024-11-16 16:34:15,409 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 76 [2024-11-16 16:34:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:34:15,410 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2024-11-16 16:34:15,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 16:34:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2024-11-16 16:34:15,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-16 16:34:15,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:34:15,415 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:34:15,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:34:15,415 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:34:15,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:34:15,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1660678710, now seen corresponding path program 1 times [2024-11-16 16:34:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:34:15,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472312155] [2024-11-16 16:34:15,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:34:15,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:34:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:34:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:34:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:34:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:34:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:34:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:34:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:34:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:34:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:34:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:34:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:15,925 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 16:34:15,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:34:15,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472312155] [2024-11-16 16:34:15,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472312155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:34:15,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:34:15,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:34:15,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234207730] [2024-11-16 16:34:15,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:34:15,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:34:15,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:34:15,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:34:15,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:34:15,930 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 16:34:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:34:16,034 INFO L93 Difference]: Finished difference Result 138 states and 193 transitions. [2024-11-16 16:34:16,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:34:16,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 76 [2024-11-16 16:34:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:34:16,037 INFO L225 Difference]: With dead ends: 138 [2024-11-16 16:34:16,037 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 16:34:16,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:34:16,041 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 64 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 377 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 16:34:16,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 377 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:34:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 16:34:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 54. [2024-11-16 16:34:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 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 16:34:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-16 16:34:16,055 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 76 [2024-11-16 16:34:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:34:16,057 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-16 16:34:16,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 16:34:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-16 16:34:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-16 16:34:16,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:34:16,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:34:16,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:34:16,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:34:16,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:34:16,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2028394817, now seen corresponding path program 1 times [2024-11-16 16:34:16,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:34:16,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055305989] [2024-11-16 16:34:16,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:34:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:34:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:16,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:34:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:16,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:34:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:16,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:34:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:16,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:34:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:16,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:34:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:16,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:34:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:16,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:34:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:16,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:34:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:16,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:34:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:16,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:34:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:34:16,394 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 16:34:16,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:34:16,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055305989] [2024-11-16 16:34:16,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055305989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:34:16,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:34:16,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 16:34:16,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862697692] [2024-11-16 16:34:16,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:34:16,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:34:16,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:34:16,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:34:16,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:34:16,399 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 16:34:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:34:16,526 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2024-11-16 16:34:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 16:34:16,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 78 [2024-11-16 16:34:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:34:16,528 INFO L225 Difference]: With dead ends: 58 [2024-11-16 16:34:16,528 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 16:34:16,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:34:16,530 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 37 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:34:16,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 286 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:34:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 16:34:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 16:34:16,531 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 16:34:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 16:34:16,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2024-11-16 16:34:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:34:16,532 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 16:34:16,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 16:34:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 16:34:16,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 16:34:16,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:34:16,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:34:16,538 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 16:34:16,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 16:34:16,584 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:34:16,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:34:16 BoogieIcfgContainer [2024-11-16 16:34:16,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:34:16,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:34:16,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:34:16,609 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:34:16,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:34:14" (3/4) ... [2024-11-16 16:34:16,612 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 16:34:16,615 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-16 16:34:16,619 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-16 16:34:16,620 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 16:34:16,620 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 16:34:16,620 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 16:34:16,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 16:34:16,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 16:34:16,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:34:16,702 INFO L158 Benchmark]: Toolchain (without parser) took 2773.84ms. Allocated memory was 169.9MB in the beginning and 218.1MB in the end (delta: 48.2MB). Free memory was 108.0MB in the beginning and 95.0MB in the end (delta: 12.9MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2024-11-16 16:34:16,702 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:34:16,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.09ms. Allocated memory is still 169.9MB. Free memory was 108.0MB in the beginning and 134.9MB in the end (delta: -26.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 16:34:16,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.41ms. Allocated memory is still 169.9MB. Free memory was 134.9MB in the beginning and 132.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 16:34:16,704 INFO L158 Benchmark]: Boogie Preprocessor took 48.50ms. Allocated memory is still 169.9MB. Free memory was 132.8MB in the beginning and 130.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 16:34:16,704 INFO L158 Benchmark]: IcfgBuilder took 485.29ms. Allocated memory is still 169.9MB. Free memory was 130.7MB in the beginning and 113.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 16:34:16,704 INFO L158 Benchmark]: TraceAbstraction took 1698.71ms. Allocated memory was 169.9MB in the beginning and 218.1MB in the end (delta: 48.2MB). Free memory was 113.1MB in the beginning and 101.3MB in the end (delta: 11.8MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2024-11-16 16:34:16,704 INFO L158 Benchmark]: Witness Printer took 93.11ms. Allocated memory is still 218.1MB. Free memory was 101.3MB in the beginning and 95.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 16:34:16,706 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.17ms. Allocated memory is still 100.7MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.09ms. Allocated memory is still 169.9MB. Free memory was 108.0MB in the beginning and 134.9MB in the end (delta: -26.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.41ms. Allocated memory is still 169.9MB. Free memory was 134.9MB in the beginning and 132.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.50ms. Allocated memory is still 169.9MB. Free memory was 132.8MB in the beginning and 130.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 485.29ms. Allocated memory is still 169.9MB. Free memory was 130.7MB in the beginning and 113.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1698.71ms. Allocated memory was 169.9MB in the beginning and 218.1MB in the end (delta: 48.2MB). Free memory was 113.1MB in the beginning and 101.3MB in the end (delta: 11.8MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. * Witness Printer took 93.11ms. Allocated memory is still 218.1MB. Free memory was 101.3MB in the beginning and 95.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 735 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 496 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 239 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 33 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 249 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: 92]: 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_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (last_1_var_1_11 == \old(last_1_var_1_11))) RESULT: Ultimate proved your program to be correct! [2024-11-16 16:34:16,731 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